./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi003_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/rfi003_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 bcb38a6f 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/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi003_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-bcb38a6-m [2024-06-03 22:16:23,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 22:16:23,330 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 22:16:23,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 22:16:23,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 22:16:23,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 22:16:23,364 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 22:16:23,364 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 22:16:23,365 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 22:16:23,367 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 22:16:23,368 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 22:16:23,369 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 22:16:23,369 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 22:16:23,370 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 22:16:23,371 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 22:16:23,371 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 22:16:23,371 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 22:16:23,371 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 22:16:23,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 22:16:23,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 22:16:23,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 22:16:23,372 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 22:16:23,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 22:16:23,373 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 22:16:23,373 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 22:16:23,373 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 22:16:23,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 22:16:23,374 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 22:16:23,374 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 22:16:23,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 22:16:23,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 22:16:23,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 22:16:23,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:16:23,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 22:16:23,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 22:16:23,376 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 22:16:23,376 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 22:16:23,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 22:16:23,377 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 22:16:23,377 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 22:16:23,377 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 22:16:23,377 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 22:16:23,378 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 22:16:23,378 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-03 22:16:23,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 22:16:23,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 22:16:23,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 22:16:23,615 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 22:16:23,615 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 22:16:23,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-03 22:16:24,648 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 22:16:24,860 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 22:16:24,860 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-03 22:16:24,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c7ff964c/dc6396c0ae934ee2aee7778c55cf358d/FLAG97c39c552 [2024-06-03 22:16:24,889 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c7ff964c/dc6396c0ae934ee2aee7778c55cf358d [2024-06-03 22:16:24,891 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 22:16:24,891 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 22:16:24,892 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/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-03 22:16:25,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 22:16:25,043 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 22:16:25,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 22:16:25,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 22:16:25,049 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 22:16:25,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:16:24" (1/2) ... [2024-06-03 22:16:25,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72b0eda5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:16:25, skipping insertion in model container [2024-06-03 22:16:25,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:16:24" (1/2) ... [2024-06-03 22:16:25,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@25627e5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:16:25, skipping insertion in model container [2024-06-03 22:16:25,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:16:25" (2/2) ... [2024-06-03 22:16:25,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72b0eda5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:25, skipping insertion in model container [2024-06-03 22:16:25,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:16:25" (2/2) ... [2024-06-03 22:16:25,053 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 22:16:25,134 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 22:16:25,135 INFO L97 edCorrectnessWitness]: Location invariant before [L816-L816] ((((((((((((((((! multithreaded || (((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 2) && __unbuffered_p1_EAX <= 127) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 2) && __unbuffered_p1_EBX <= 127) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$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_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$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_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (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) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (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) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_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_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! 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_p0_EAX <= 1) && __unbuffered_p1_EAX <= 127) && __unbuffered_p1_EBX <= 127) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1))) [2024-06-03 22:16:25,135 INFO L97 edCorrectnessWitness]: Location invariant before [L817-L817] ((((((((((((((((! multithreaded || (((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 2) && __unbuffered_p1_EAX <= 127) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 2) && __unbuffered_p1_EBX <= 127) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$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_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$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_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (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) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (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) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_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_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! 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_p0_EAX <= 1) && __unbuffered_p1_EAX <= 127) && __unbuffered_p1_EBX <= 127) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1))) [2024-06-03 22:16:25,136 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 22:16:25,136 INFO L106 edCorrectnessWitness]: ghost_update [L814-L814] multithreaded = 1; [2024-06-03 22:16:25,174 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 22:16:25,498 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:16:25,506 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 22:16:25,761 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:16:25,790 INFO L206 MainTranslator]: Completed translation [2024-06-03 22:16:25,791 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:25 WrapperNode [2024-06-03 22:16:25,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 22:16:25,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 22:16:25,792 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 22:16:25,792 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 22:16:25,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:25" (1/1) ... [2024-06-03 22:16:25,828 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:25" (1/1) ... [2024-06-03 22:16:25,908 INFO L138 Inliner]: procedures = 174, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 120 [2024-06-03 22:16:25,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 22:16:25,910 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 22:16:25,910 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 22:16:25,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 22:16:25,932 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:25" (1/1) ... [2024-06-03 22:16:25,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:25" (1/1) ... [2024-06-03 22:16:25,951 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:25" (1/1) ... [2024-06-03 22:16:26,009 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-03 22:16:26,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:25" (1/1) ... [2024-06-03 22:16:26,011 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:25" (1/1) ... [2024-06-03 22:16:26,045 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:25" (1/1) ... [2024-06-03 22:16:26,048 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:25" (1/1) ... [2024-06-03 22:16:26,062 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:25" (1/1) ... [2024-06-03 22:16:26,066 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:25" (1/1) ... [2024-06-03 22:16:26,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 22:16:26,093 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 22:16:26,093 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 22:16:26,093 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 22:16:26,093 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:25" (1/1) ... [2024-06-03 22:16:26,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:16:26,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 22:16:26,116 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-03 22:16:26,151 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-03 22:16:26,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 22:16:26,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 22:16:26,172 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 22:16:26,172 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 22:16:26,172 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 22:16:26,172 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 22:16:26,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 22:16:26,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 22:16:26,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 22:16:26,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 22:16:26,174 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 22:16:26,266 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 22:16:26,268 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 22:16:27,017 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 22:16:27,017 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 22:16:27,193 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 22:16:27,194 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 22:16:27,196 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:16:27 BoogieIcfgContainer [2024-06-03 22:16:27,196 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 22:16:27,198 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 22:16:27,198 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 22:16:27,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 22:16:27,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 10:16:24" (1/4) ... [2024-06-03 22:16:27,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bcd9526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:16:27, skipping insertion in model container [2024-06-03 22:16:27,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:16:25" (2/4) ... [2024-06-03 22:16:27,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bcd9526 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:16:27, skipping insertion in model container [2024-06-03 22:16:27,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:25" (3/4) ... [2024-06-03 22:16:27,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bcd9526 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:16:27, skipping insertion in model container [2024-06-03 22:16:27,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:16:27" (4/4) ... [2024-06-03 22:16:27,208 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-03 22:16:27,222 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 22:16:27,223 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-03 22:16:27,223 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 22:16:27,290 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 22:16:27,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 33 transitions, 74 flow [2024-06-03 22:16:27,374 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-06-03 22:16:27,374 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:16:27,376 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 44 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-03 22:16:27,376 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 33 transitions, 74 flow [2024-06-03 22:16:27,379 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 56 flow [2024-06-03 22:16:27,398 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 22:16:27,405 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;@38fcf511, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 22:16:27,405 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-03 22:16:27,412 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 22:16:27,413 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 22:16:27,413 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:16:27,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:27,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 22:16:27,414 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-03 22:16:27,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:27,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1491043083, now seen corresponding path program 1 times [2024-06-03 22:16:27,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:27,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959652714] [2024-06-03 22:16:27,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:27,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:16:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:16:31,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:16:31,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959652714] [2024-06-03 22:16:31,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959652714] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:16:31,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:16:31,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 22:16:31,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743006801] [2024-06-03 22:16:31,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:16:31,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 22:16:31,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:16:31,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 22:16:31,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 22:16:31,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2024-06-03 22:16:31,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:31,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:16:31,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2024-06-03 22:16:31,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:16:31,947 INFO L124 PetriNetUnfolderBase]: 131/270 cut-off events. [2024-06-03 22:16:31,947 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-03 22:16:31,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 270 events. 131/270 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1073 event pairs, 75 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 514. Up to 235 conditions per place. [2024-06-03 22:16:31,951 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 22 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2024-06-03 22:16:31,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 121 flow [2024-06-03 22:16:31,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 22:16:31,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 22:16:31,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-06-03 22:16:31,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2024-06-03 22:16:31,961 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 56 flow. Second operand 3 states and 60 transitions. [2024-06-03 22:16:31,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 121 flow [2024-06-03 22:16:31,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 22:16:31,965 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 75 flow [2024-06-03 22:16:31,966 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-03 22:16:31,969 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2024-06-03 22:16:31,969 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 75 flow [2024-06-03 22:16:31,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:31,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:31,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:16:31,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 22:16:31,970 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-03 22:16:31,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:31,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1626464162, now seen corresponding path program 1 times [2024-06-03 22:16:31,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:31,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274120692] [2024-06-03 22:16:31,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:31,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:16:34,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:16:34,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:16:34,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274120692] [2024-06-03 22:16:34,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274120692] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:16:34,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:16:34,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 22:16:34,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405076398] [2024-06-03 22:16:34,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:16:34,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 22:16:34,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:16:34,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 22:16:34,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-03 22:16:34,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 22:16:34,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:34,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:16:34,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 22:16:34,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:16:34,930 INFO L124 PetriNetUnfolderBase]: 172/323 cut-off events. [2024-06-03 22:16:34,930 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-06-03 22:16:34,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 323 events. 172/323 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1254 event pairs, 79 based on Foata normal form. 2/324 useless extension candidates. Maximal degree in co-relation 723. Up to 295 conditions per place. [2024-06-03 22:16:34,933 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 28 selfloop transitions, 5 changer transitions 0/37 dead transitions. [2024-06-03 22:16:34,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 167 flow [2024-06-03 22:16:34,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 22:16:34,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 22:16:34,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2024-06-03 22:16:34,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5378787878787878 [2024-06-03 22:16:34,935 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 75 flow. Second operand 4 states and 71 transitions. [2024-06-03 22:16:34,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 167 flow [2024-06-03 22:16:34,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 22:16:34,936 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 99 flow [2024-06-03 22:16:34,937 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-03 22:16:34,937 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2024-06-03 22:16:34,937 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 99 flow [2024-06-03 22:16:34,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:34,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:34,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:16:34,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 22:16:34,938 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-03 22:16:34,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:34,939 INFO L85 PathProgramCache]: Analyzing trace with hash 169841225, now seen corresponding path program 1 times [2024-06-03 22:16:34,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:34,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753010875] [2024-06-03 22:16:34,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:34,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:16:38,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:16:38,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:16:38,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753010875] [2024-06-03 22:16:38,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753010875] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:16:38,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:16:38,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 22:16:38,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447703737] [2024-06-03 22:16:38,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:16:38,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 22:16:38,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:16:38,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 22:16:38,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-03 22:16:38,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 22:16:38,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:38,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:16:38,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 22:16:38,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:16:38,860 INFO L124 PetriNetUnfolderBase]: 169/318 cut-off events. [2024-06-03 22:16:38,860 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2024-06-03 22:16:38,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 318 events. 169/318 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1228 event pairs, 55 based on Foata normal form. 2/319 useless extension candidates. Maximal degree in co-relation 792. Up to 281 conditions per place. [2024-06-03 22:16:38,865 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 32 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-06-03 22:16:38,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 215 flow [2024-06-03 22:16:38,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:16:38,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:16:38,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2024-06-03 22:16:38,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212121212121212 [2024-06-03 22:16:38,870 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 99 flow. Second operand 5 states and 86 transitions. [2024-06-03 22:16:38,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 215 flow [2024-06-03 22:16:38,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 206 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-03 22:16:38,873 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 123 flow [2024-06-03 22:16:38,873 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-03 22:16:38,874 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2024-06-03 22:16:38,874 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 123 flow [2024-06-03 22:16:38,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:38,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:38,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:16:38,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 22:16:38,875 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-03 22:16:38,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:38,876 INFO L85 PathProgramCache]: Analyzing trace with hash 211099886, now seen corresponding path program 1 times [2024-06-03 22:16:38,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:38,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30158924] [2024-06-03 22:16:38,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:38,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:16:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:16:43,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:16:43,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30158924] [2024-06-03 22:16:43,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30158924] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:16:43,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:16:43,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:16:43,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301093405] [2024-06-03 22:16:43,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:16:43,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:16:43,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:16:43,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:16:43,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:16:44,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-06-03 22:16:44,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 123 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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-03 22:16:44,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:16:44,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-06-03 22:16:44,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:16:44,268 INFO L124 PetriNetUnfolderBase]: 123/265 cut-off events. [2024-06-03 22:16:44,269 INFO L125 PetriNetUnfolderBase]: For 265/265 co-relation queries the response was YES. [2024-06-03 22:16:44,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 265 events. 123/265 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1039 event pairs, 38 based on Foata normal form. 1/262 useless extension candidates. Maximal degree in co-relation 693. Up to 219 conditions per place. [2024-06-03 22:16:44,270 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 26 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2024-06-03 22:16:44,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 38 transitions, 205 flow [2024-06-03 22:16:44,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:16:44,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:16:44,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2024-06-03 22:16:44,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47878787878787876 [2024-06-03 22:16:44,272 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 123 flow. Second operand 5 states and 79 transitions. [2024-06-03 22:16:44,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 38 transitions, 205 flow [2024-06-03 22:16:44,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 190 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-03 22:16:44,273 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 135 flow [2024-06-03 22:16:44,274 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-03 22:16:44,274 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2024-06-03 22:16:44,274 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 135 flow [2024-06-03 22:16:44,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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-03 22:16:44,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:44,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:16:44,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 22:16:44,275 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-03 22:16:44,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:44,276 INFO L85 PathProgramCache]: Analyzing trace with hash 8700904, now seen corresponding path program 1 times [2024-06-03 22:16:44,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:44,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698880899] [2024-06-03 22:16:44,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:44,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:16:47,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:16:47,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:16:47,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698880899] [2024-06-03 22:16:47,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698880899] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:16:47,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:16:47,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:16:47,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443259370] [2024-06-03 22:16:47,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:16:47,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:16:47,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:16:47,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:16:47,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:16:47,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 22:16:47,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 135 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:47,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:16:47,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 22:16:47,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:16:47,752 INFO L124 PetriNetUnfolderBase]: 163/307 cut-off events. [2024-06-03 22:16:47,752 INFO L125 PetriNetUnfolderBase]: For 475/475 co-relation queries the response was YES. [2024-06-03 22:16:47,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 307 events. 163/307 cut-off events. For 475/475 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1168 event pairs, 29 based on Foata normal form. 4/310 useless extension candidates. Maximal degree in co-relation 890. Up to 252 conditions per place. [2024-06-03 22:16:47,754 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 34 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2024-06-03 22:16:47,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 245 flow [2024-06-03 22:16:47,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:16:47,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:16:47,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2024-06-03 22:16:47,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-06-03 22:16:47,756 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 135 flow. Second operand 6 states and 96 transitions. [2024-06-03 22:16:47,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 245 flow [2024-06-03 22:16:47,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 234 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-03 22:16:47,758 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 136 flow [2024-06-03 22:16:47,758 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-03 22:16:47,758 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2024-06-03 22:16:47,759 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 136 flow [2024-06-03 22:16:47,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:47,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:47,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:16:47,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 22:16:47,759 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-03 22:16:47,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:47,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2045837293, now seen corresponding path program 1 times [2024-06-03 22:16:47,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:47,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10948751] [2024-06-03 22:16:47,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:47,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:16:52,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:16:52,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:16:52,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10948751] [2024-06-03 22:16:52,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10948751] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:16:52,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:16:52,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:16:52,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209824509] [2024-06-03 22:16:52,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:16:52,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:16:52,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:16:52,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:16:52,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:16:53,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:16:53,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 136 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:53,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:16:53,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:16:53,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:16:53,244 INFO L124 PetriNetUnfolderBase]: 179/337 cut-off events. [2024-06-03 22:16:53,245 INFO L125 PetriNetUnfolderBase]: For 705/705 co-relation queries the response was YES. [2024-06-03 22:16:53,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 337 events. 179/337 cut-off events. For 705/705 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1350 event pairs, 49 based on Foata normal form. 3/338 useless extension candidates. Maximal degree in co-relation 1017. Up to 269 conditions per place. [2024-06-03 22:16:53,247 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 31 selfloop transitions, 12 changer transitions 0/47 dead transitions. [2024-06-03 22:16:53,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 278 flow [2024-06-03 22:16:53,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:16:53,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:16:53,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2024-06-03 22:16:53,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-03 22:16:53,248 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 136 flow. Second operand 6 states and 88 transitions. [2024-06-03 22:16:53,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 278 flow [2024-06-03 22:16:53,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 47 transitions, 258 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-03 22:16:53,250 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 184 flow [2024-06-03 22:16:53,251 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=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2024-06-03 22:16:53,251 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2024-06-03 22:16:53,251 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 184 flow [2024-06-03 22:16:53,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:53,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:53,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:16:53,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 22:16:53,252 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-03 22:16:53,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:53,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1316054797, now seen corresponding path program 1 times [2024-06-03 22:16:53,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:53,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781253269] [2024-06-03 22:16:53,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:53,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:16:58,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:16:58,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:16:58,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781253269] [2024-06-03 22:16:58,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781253269] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:16:58,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:16:58,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:16:58,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574410005] [2024-06-03 22:16:58,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:16:58,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:16:58,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:16:58,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:16:58,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:16:58,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:16:58,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 184 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:58,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:16:58,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:16:58,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:16:58,449 INFO L124 PetriNetUnfolderBase]: 189/360 cut-off events. [2024-06-03 22:16:58,450 INFO L125 PetriNetUnfolderBase]: For 1011/1011 co-relation queries the response was YES. [2024-06-03 22:16:58,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1247 conditions, 360 events. 189/360 cut-off events. For 1011/1011 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1453 event pairs, 53 based on Foata normal form. 2/361 useless extension candidates. Maximal degree in co-relation 1224. Up to 315 conditions per place. [2024-06-03 22:16:58,452 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 39 selfloop transitions, 11 changer transitions 0/54 dead transitions. [2024-06-03 22:16:58,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 54 transitions, 346 flow [2024-06-03 22:16:58,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:16:58,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:16:58,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2024-06-03 22:16:58,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4199134199134199 [2024-06-03 22:16:58,454 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 184 flow. Second operand 7 states and 97 transitions. [2024-06-03 22:16:58,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 54 transitions, 346 flow [2024-06-03 22:16:58,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 54 transitions, 332 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-03 22:16:58,456 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 239 flow [2024-06-03 22:16:58,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=239, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2024-06-03 22:16:58,457 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2024-06-03 22:16:58,457 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 239 flow [2024-06-03 22:16:58,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:58,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:58,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:16:58,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 22:16:58,458 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-03 22:16:58,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:58,459 INFO L85 PathProgramCache]: Analyzing trace with hash 110298893, now seen corresponding path program 2 times [2024-06-03 22:16:58,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:58,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966333349] [2024-06-03 22:16:58,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:58,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:03,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:17:03,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:03,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966333349] [2024-06-03 22:17:03,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966333349] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:03,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:03,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:17:03,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042363720] [2024-06-03 22:17:03,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:03,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:17:03,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:03,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:17:03,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:17:03,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:17:03,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:03,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:03,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:17:03,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:03,915 INFO L124 PetriNetUnfolderBase]: 195/374 cut-off events. [2024-06-03 22:17:03,915 INFO L125 PetriNetUnfolderBase]: For 1378/1378 co-relation queries the response was YES. [2024-06-03 22:17:03,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1384 conditions, 374 events. 195/374 cut-off events. For 1378/1378 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1535 event pairs, 50 based on Foata normal form. 2/375 useless extension candidates. Maximal degree in co-relation 1358. Up to 319 conditions per place. [2024-06-03 22:17:03,919 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 38 selfloop transitions, 12 changer transitions 0/54 dead transitions. [2024-06-03 22:17:03,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 384 flow [2024-06-03 22:17:03,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:17:03,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:17:03,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2024-06-03 22:17:03,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4292929292929293 [2024-06-03 22:17:03,922 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 239 flow. Second operand 6 states and 85 transitions. [2024-06-03 22:17:03,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 384 flow [2024-06-03 22:17:03,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 54 transitions, 363 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-03 22:17:03,925 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 273 flow [2024-06-03 22:17:03,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=273, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2024-06-03 22:17:03,932 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2024-06-03 22:17:03,933 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 273 flow [2024-06-03 22:17:03,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:03,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:03,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:17:03,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 22:17:03,933 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-03 22:17:03,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:03,934 INFO L85 PathProgramCache]: Analyzing trace with hash 116965133, now seen corresponding path program 3 times [2024-06-03 22:17:03,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:03,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518986155] [2024-06-03 22:17:03,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:03,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:09,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:17:09,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:09,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518986155] [2024-06-03 22:17:09,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518986155] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:09,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:09,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:17:09,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467647485] [2024-06-03 22:17:09,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:09,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:17:09,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:09,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:17:09,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:17:09,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:17:09,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 273 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:09,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:09,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:17:09,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:09,484 INFO L124 PetriNetUnfolderBase]: 185/356 cut-off events. [2024-06-03 22:17:09,485 INFO L125 PetriNetUnfolderBase]: For 1675/1675 co-relation queries the response was YES. [2024-06-03 22:17:09,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 356 events. 185/356 cut-off events. For 1675/1675 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1459 event pairs, 52 based on Foata normal form. 4/357 useless extension candidates. Maximal degree in co-relation 1320. Up to 269 conditions per place. [2024-06-03 22:17:09,487 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 33 selfloop transitions, 16 changer transitions 0/53 dead transitions. [2024-06-03 22:17:09,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 53 transitions, 395 flow [2024-06-03 22:17:09,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:17:09,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:17:09,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2024-06-03 22:17:09,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-06-03 22:17:09,488 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 273 flow. Second operand 6 states and 87 transitions. [2024-06-03 22:17:09,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 53 transitions, 395 flow [2024-06-03 22:17:09,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 365 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-03 22:17:09,492 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 282 flow [2024-06-03 22:17:09,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=282, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2024-06-03 22:17:09,493 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 24 predicate places. [2024-06-03 22:17:09,493 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 282 flow [2024-06-03 22:17:09,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:09,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:09,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:17:09,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 22:17:09,494 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-03 22:17:09,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:09,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1003554221, now seen corresponding path program 1 times [2024-06-03 22:17:09,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:09,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691343776] [2024-06-03 22:17:09,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:09,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:17:14,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:14,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691343776] [2024-06-03 22:17:14,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691343776] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:14,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:14,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:17:14,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518792729] [2024-06-03 22:17:14,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:14,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:17:14,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:14,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:17:14,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:17:14,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:17:14,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 282 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:14,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:14,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:17:14,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:15,100 INFO L124 PetriNetUnfolderBase]: 194/371 cut-off events. [2024-06-03 22:17:15,100 INFO L125 PetriNetUnfolderBase]: For 1613/1613 co-relation queries the response was YES. [2024-06-03 22:17:15,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1396 conditions, 371 events. 194/371 cut-off events. For 1613/1613 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1532 event pairs, 51 based on Foata normal form. 3/371 useless extension candidates. Maximal degree in co-relation 1368. Up to 260 conditions per place. [2024-06-03 22:17:15,103 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 35 selfloop transitions, 22 changer transitions 0/61 dead transitions. [2024-06-03 22:17:15,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 61 transitions, 468 flow [2024-06-03 22:17:15,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:17:15,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:17:15,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2024-06-03 22:17:15,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2024-06-03 22:17:15,104 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 282 flow. Second operand 7 states and 102 transitions. [2024-06-03 22:17:15,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 61 transitions, 468 flow [2024-06-03 22:17:15,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 61 transitions, 423 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 22:17:15,107 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 317 flow [2024-06-03 22:17:15,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=317, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2024-06-03 22:17:15,108 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 26 predicate places. [2024-06-03 22:17:15,108 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 317 flow [2024-06-03 22:17:15,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:15,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:15,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:17:15,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 22:17:15,109 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-03 22:17:15,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:15,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1045410674, now seen corresponding path program 1 times [2024-06-03 22:17:15,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:15,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351270314] [2024-06-03 22:17:15,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:15,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:20,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-03 22:17:20,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:20,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351270314] [2024-06-03 22:17:20,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351270314] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:20,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:20,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:17:20,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877523773] [2024-06-03 22:17:20,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:20,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:17:20,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:20,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:17:20,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:17:20,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:17:20,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 317 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:20,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:20,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:17:20,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:21,124 INFO L124 PetriNetUnfolderBase]: 203/386 cut-off events. [2024-06-03 22:17:21,124 INFO L125 PetriNetUnfolderBase]: For 1939/1939 co-relation queries the response was YES. [2024-06-03 22:17:21,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1530 conditions, 386 events. 203/386 cut-off events. For 1939/1939 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1607 event pairs, 54 based on Foata normal form. 3/386 useless extension candidates. Maximal degree in co-relation 1501. Up to 249 conditions per place. [2024-06-03 22:17:21,128 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 38 selfloop transitions, 26 changer transitions 0/68 dead transitions. [2024-06-03 22:17:21,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 68 transitions, 531 flow [2024-06-03 22:17:21,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:17:21,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:17:21,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2024-06-03 22:17:21,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-06-03 22:17:21,131 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 317 flow. Second operand 8 states and 116 transitions. [2024-06-03 22:17:21,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 68 transitions, 531 flow [2024-06-03 22:17:21,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 68 transitions, 506 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-03 22:17:21,136 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 386 flow [2024-06-03 22:17:21,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=386, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2024-06-03 22:17:21,136 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 31 predicate places. [2024-06-03 22:17:21,136 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 386 flow [2024-06-03 22:17:21,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:21,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:21,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:17:21,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 22:17:21,137 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-03 22:17:21,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:21,138 INFO L85 PathProgramCache]: Analyzing trace with hash 407007084, now seen corresponding path program 1 times [2024-06-03 22:17:21,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:21,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187172620] [2024-06-03 22:17:21,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:21,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:26,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:17:26,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:26,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187172620] [2024-06-03 22:17:26,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187172620] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:26,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:26,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:17:26,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702381608] [2024-06-03 22:17:26,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:26,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:17:26,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:26,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:17:26,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:17:26,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:17:26,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 386 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:26,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:26,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:17:26,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:26,412 INFO L124 PetriNetUnfolderBase]: 201/385 cut-off events. [2024-06-03 22:17:26,412 INFO L125 PetriNetUnfolderBase]: For 2258/2258 co-relation queries the response was YES. [2024-06-03 22:17:26,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 385 events. 201/385 cut-off events. For 2258/2258 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1595 event pairs, 56 based on Foata normal form. 1/385 useless extension candidates. Maximal degree in co-relation 1615. Up to 327 conditions per place. [2024-06-03 22:17:26,415 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 53 selfloop transitions, 12 changer transitions 0/69 dead transitions. [2024-06-03 22:17:26,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 69 transitions, 566 flow [2024-06-03 22:17:26,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:17:26,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:17:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2024-06-03 22:17:26,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-03 22:17:26,417 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 386 flow. Second operand 7 states and 98 transitions. [2024-06-03 22:17:26,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 69 transitions, 566 flow [2024-06-03 22:17:26,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 69 transitions, 533 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-03 22:17:26,420 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 402 flow [2024-06-03 22:17:26,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=402, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-06-03 22:17:26,421 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 34 predicate places. [2024-06-03 22:17:26,421 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 402 flow [2024-06-03 22:17:26,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:26,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:26,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:17:26,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 22:17:26,422 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-03 22:17:26,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:26,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1952314130, now seen corresponding path program 1 times [2024-06-03 22:17:26,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:26,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720405508] [2024-06-03 22:17:26,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:26,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:32,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:17:32,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:32,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720405508] [2024-06-03 22:17:32,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720405508] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:32,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:32,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:17:32,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683640703] [2024-06-03 22:17:32,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:32,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:17:32,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:32,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:17:32,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:17:32,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:17:32,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 402 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:32,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:32,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:17:32,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:32,381 INFO L124 PetriNetUnfolderBase]: 207/401 cut-off events. [2024-06-03 22:17:32,381 INFO L125 PetriNetUnfolderBase]: For 2722/2722 co-relation queries the response was YES. [2024-06-03 22:17:32,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1742 conditions, 401 events. 207/401 cut-off events. For 2722/2722 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1708 event pairs, 51 based on Foata normal form. 2/400 useless extension candidates. Maximal degree in co-relation 1709. Up to 278 conditions per place. [2024-06-03 22:17:32,384 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 44 selfloop transitions, 22 changer transitions 0/70 dead transitions. [2024-06-03 22:17:32,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 70 transitions, 602 flow [2024-06-03 22:17:32,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:17:32,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:17:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2024-06-03 22:17:32,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2024-06-03 22:17:32,386 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 402 flow. Second operand 7 states and 102 transitions. [2024-06-03 22:17:32,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 70 transitions, 602 flow [2024-06-03 22:17:32,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 70 transitions, 569 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-03 22:17:32,390 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 432 flow [2024-06-03 22:17:32,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=432, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2024-06-03 22:17:32,390 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 36 predicate places. [2024-06-03 22:17:32,390 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 432 flow [2024-06-03 22:17:32,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:32,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:32,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:17:32,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 22:17:32,391 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-03 22:17:32,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:32,391 INFO L85 PathProgramCache]: Analyzing trace with hash 742652384, now seen corresponding path program 2 times [2024-06-03 22:17:32,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:32,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15590668] [2024-06-03 22:17:32,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:32,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:38,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-03 22:17:38,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:38,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15590668] [2024-06-03 22:17:38,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15590668] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:38,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:38,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:17:38,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664412157] [2024-06-03 22:17:38,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:38,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:17:38,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:38,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:17:38,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:17:38,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:17:38,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 432 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:38,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:38,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:17:38,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:38,661 INFO L124 PetriNetUnfolderBase]: 203/391 cut-off events. [2024-06-03 22:17:38,661 INFO L125 PetriNetUnfolderBase]: For 2991/2991 co-relation queries the response was YES. [2024-06-03 22:17:38,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1750 conditions, 391 events. 203/391 cut-off events. For 2991/2991 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1638 event pairs, 47 based on Foata normal form. 2/390 useless extension candidates. Maximal degree in co-relation 1716. Up to 275 conditions per place. [2024-06-03 22:17:38,664 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 43 selfloop transitions, 24 changer transitions 0/71 dead transitions. [2024-06-03 22:17:38,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 71 transitions, 602 flow [2024-06-03 22:17:38,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:17:38,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:17:38,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2024-06-03 22:17:38,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42803030303030304 [2024-06-03 22:17:38,665 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 432 flow. Second operand 8 states and 113 transitions. [2024-06-03 22:17:38,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 71 transitions, 602 flow [2024-06-03 22:17:38,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 71 transitions, 547 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 22:17:38,670 INFO L231 Difference]: Finished difference. Result has 71 places, 59 transitions, 430 flow [2024-06-03 22:17:38,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=430, PETRI_PLACES=71, PETRI_TRANSITIONS=59} [2024-06-03 22:17:38,672 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 39 predicate places. [2024-06-03 22:17:38,672 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 59 transitions, 430 flow [2024-06-03 22:17:38,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:38,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:38,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:17:38,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 22:17:38,673 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-03 22:17:38,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:38,674 INFO L85 PathProgramCache]: Analyzing trace with hash 742951596, now seen corresponding path program 1 times [2024-06-03 22:17:38,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:38,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599084206] [2024-06-03 22:17:38,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:38,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:45,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:17:45,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:45,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599084206] [2024-06-03 22:17:45,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599084206] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:45,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:45,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:17:45,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379247001] [2024-06-03 22:17:45,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:45,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:17:45,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:45,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:17:45,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:17:45,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:17:45,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 59 transitions, 430 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:45,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:45,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:17:45,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:45,840 INFO L124 PetriNetUnfolderBase]: 207/398 cut-off events. [2024-06-03 22:17:45,840 INFO L125 PetriNetUnfolderBase]: For 3337/3337 co-relation queries the response was YES. [2024-06-03 22:17:45,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1797 conditions, 398 events. 207/398 cut-off events. For 3337/3337 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1667 event pairs, 48 based on Foata normal form. 3/398 useless extension candidates. Maximal degree in co-relation 1762. Up to 245 conditions per place. [2024-06-03 22:17:45,843 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 42 selfloop transitions, 31 changer transitions 0/77 dead transitions. [2024-06-03 22:17:45,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 77 transitions, 672 flow [2024-06-03 22:17:45,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:17:45,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:17:45,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 129 transitions. [2024-06-03 22:17:45,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43434343434343436 [2024-06-03 22:17:45,845 INFO L175 Difference]: Start difference. First operand has 71 places, 59 transitions, 430 flow. Second operand 9 states and 129 transitions. [2024-06-03 22:17:45,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 77 transitions, 672 flow [2024-06-03 22:17:45,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 77 transitions, 617 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-03 22:17:45,849 INFO L231 Difference]: Finished difference. Result has 73 places, 63 transitions, 482 flow [2024-06-03 22:17:45,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=482, PETRI_PLACES=73, PETRI_TRANSITIONS=63} [2024-06-03 22:17:45,851 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 41 predicate places. [2024-06-03 22:17:45,851 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 63 transitions, 482 flow [2024-06-03 22:17:45,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:45,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:45,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:17:45,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 22:17:45,852 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-03 22:17:45,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:45,852 INFO L85 PathProgramCache]: Analyzing trace with hash 766856593, now seen corresponding path program 1 times [2024-06-03 22:17:45,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:45,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483668801] [2024-06-03 22:17:45,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:45,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:51,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-03 22:17:51,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:51,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483668801] [2024-06-03 22:17:51,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483668801] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:51,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:51,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:17:51,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416659479] [2024-06-03 22:17:51,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:51,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:17:51,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:51,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:17:51,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:17:51,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:17:51,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 63 transitions, 482 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:51,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:51,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:17:51,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:51,962 INFO L124 PetriNetUnfolderBase]: 205/392 cut-off events. [2024-06-03 22:17:51,962 INFO L125 PetriNetUnfolderBase]: For 3493/3493 co-relation queries the response was YES. [2024-06-03 22:17:51,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1890 conditions, 392 events. 205/392 cut-off events. For 3493/3493 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1656 event pairs, 47 based on Foata normal form. 1/389 useless extension candidates. Maximal degree in co-relation 1854. Up to 286 conditions per place. [2024-06-03 22:17:51,965 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 47 selfloop transitions, 22 changer transitions 0/73 dead transitions. [2024-06-03 22:17:51,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 73 transitions, 666 flow [2024-06-03 22:17:51,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:17:51,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:17:51,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2024-06-03 22:17:51,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-03 22:17:51,967 INFO L175 Difference]: Start difference. First operand has 73 places, 63 transitions, 482 flow. Second operand 6 states and 88 transitions. [2024-06-03 22:17:51,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 73 transitions, 666 flow [2024-06-03 22:17:51,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 73 transitions, 587 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-03 22:17:51,972 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 481 flow [2024-06-03 22:17:51,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=481, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2024-06-03 22:17:51,973 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 40 predicate places. [2024-06-03 22:17:51,973 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 481 flow [2024-06-03 22:17:51,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:51,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:51,973 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:17:51,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 22:17:51,974 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-03 22:17:51,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:51,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1547128849, now seen corresponding path program 1 times [2024-06-03 22:17:51,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:51,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056609191] [2024-06-03 22:17:51,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:51,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:57,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:17:57,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:57,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056609191] [2024-06-03 22:17:57,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056609191] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:57,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:57,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:17:57,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131298530] [2024-06-03 22:17:57,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:57,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:17:57,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:57,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:17:57,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:17:57,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:17:57,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 481 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:57,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:57,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:17:57,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:58,115 INFO L124 PetriNetUnfolderBase]: 211/413 cut-off events. [2024-06-03 22:17:58,116 INFO L125 PetriNetUnfolderBase]: For 4033/4033 co-relation queries the response was YES. [2024-06-03 22:17:58,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1949 conditions, 413 events. 211/413 cut-off events. For 4033/4033 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1799 event pairs, 49 based on Foata normal form. 2/412 useless extension candidates. Maximal degree in co-relation 1912. Up to 257 conditions per place. [2024-06-03 22:17:58,118 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 49 selfloop transitions, 27 changer transitions 0/80 dead transitions. [2024-06-03 22:17:58,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 80 transitions, 723 flow [2024-06-03 22:17:58,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:17:58,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:17:58,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2024-06-03 22:17:58,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-06-03 22:17:58,120 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 481 flow. Second operand 8 states and 116 transitions. [2024-06-03 22:17:58,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 80 transitions, 723 flow [2024-06-03 22:17:58,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 80 transitions, 685 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-03 22:17:58,125 INFO L231 Difference]: Finished difference. Result has 76 places, 67 transitions, 516 flow [2024-06-03 22:17:58,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=516, PETRI_PLACES=76, PETRI_TRANSITIONS=67} [2024-06-03 22:17:58,125 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 44 predicate places. [2024-06-03 22:17:58,126 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 516 flow [2024-06-03 22:17:58,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:58,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:58,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:17:58,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 22:17:58,126 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-03 22:17:58,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:58,127 INFO L85 PathProgramCache]: Analyzing trace with hash -382671791, now seen corresponding path program 2 times [2024-06-03 22:17:58,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:58,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879630233] [2024-06-03 22:17:58,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:58,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:04,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:18:04,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:04,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879630233] [2024-06-03 22:18:04,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879630233] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:04,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:04,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:18:04,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429541429] [2024-06-03 22:18:04,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:04,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:18:04,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:04,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:18:04,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:18:04,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:18:04,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 67 transitions, 516 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:04,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:04,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:18:04,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:04,761 INFO L124 PetriNetUnfolderBase]: 217/419 cut-off events. [2024-06-03 22:18:04,762 INFO L125 PetriNetUnfolderBase]: For 4478/4478 co-relation queries the response was YES. [2024-06-03 22:18:04,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2048 conditions, 419 events. 217/419 cut-off events. For 4478/4478 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1810 event pairs, 49 based on Foata normal form. 2/418 useless extension candidates. Maximal degree in co-relation 2010. Up to 263 conditions per place. [2024-06-03 22:18:04,764 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 49 selfloop transitions, 31 changer transitions 0/84 dead transitions. [2024-06-03 22:18:04,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 84 transitions, 780 flow [2024-06-03 22:18:04,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:18:04,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:18:04,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2024-06-03 22:18:04,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43097643097643096 [2024-06-03 22:18:04,766 INFO L175 Difference]: Start difference. First operand has 76 places, 67 transitions, 516 flow. Second operand 9 states and 128 transitions. [2024-06-03 22:18:04,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 84 transitions, 780 flow [2024-06-03 22:18:04,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 84 transitions, 710 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-03 22:18:04,771 INFO L231 Difference]: Finished difference. Result has 79 places, 69 transitions, 531 flow [2024-06-03 22:18:04,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=531, PETRI_PLACES=79, PETRI_TRANSITIONS=69} [2024-06-03 22:18:04,772 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 47 predicate places. [2024-06-03 22:18:04,772 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 69 transitions, 531 flow [2024-06-03 22:18:04,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:04,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:04,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:18:04,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 22:18:04,772 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-03 22:18:04,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:04,773 INFO L85 PathProgramCache]: Analyzing trace with hash -382998221, now seen corresponding path program 3 times [2024-06-03 22:18:04,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:04,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381873581] [2024-06-03 22:18:04,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:04,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:10,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:18:10,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:10,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381873581] [2024-06-03 22:18:10,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381873581] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:10,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:10,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:18:10,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309271982] [2024-06-03 22:18:10,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:10,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:18:10,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:10,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:18:10,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:18:10,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:18:10,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 69 transitions, 531 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:10,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:10,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:18:10,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:11,243 INFO L124 PetriNetUnfolderBase]: 213/413 cut-off events. [2024-06-03 22:18:11,244 INFO L125 PetriNetUnfolderBase]: For 4600/4600 co-relation queries the response was YES. [2024-06-03 22:18:11,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2030 conditions, 413 events. 213/413 cut-off events. For 4600/4600 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1777 event pairs, 46 based on Foata normal form. 2/412 useless extension candidates. Maximal degree in co-relation 1991. Up to 260 conditions per place. [2024-06-03 22:18:11,247 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 48 selfloop transitions, 31 changer transitions 0/83 dead transitions. [2024-06-03 22:18:11,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 83 transitions, 741 flow [2024-06-03 22:18:11,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:18:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:18:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2024-06-03 22:18:11,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43097643097643096 [2024-06-03 22:18:11,248 INFO L175 Difference]: Start difference. First operand has 79 places, 69 transitions, 531 flow. Second operand 9 states and 128 transitions. [2024-06-03 22:18:11,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 83 transitions, 741 flow [2024-06-03 22:18:11,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 83 transitions, 692 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 22:18:11,254 INFO L231 Difference]: Finished difference. Result has 82 places, 69 transitions, 549 flow [2024-06-03 22:18:11,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=549, PETRI_PLACES=82, PETRI_TRANSITIONS=69} [2024-06-03 22:18:11,254 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 50 predicate places. [2024-06-03 22:18:11,254 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 69 transitions, 549 flow [2024-06-03 22:18:11,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:11,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:11,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:18:11,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 22:18:11,255 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-03 22:18:11,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:11,255 INFO L85 PathProgramCache]: Analyzing trace with hash -382659887, now seen corresponding path program 1 times [2024-06-03 22:18:11,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:11,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948844994] [2024-06-03 22:18:11,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:11,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:17,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:18:17,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:17,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948844994] [2024-06-03 22:18:17,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948844994] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:17,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:17,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:18:17,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359587438] [2024-06-03 22:18:17,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:17,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:18:17,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:17,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:18:17,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:18:18,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:18:18,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 69 transitions, 549 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:18,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:18,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:18:18,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:18,427 INFO L124 PetriNetUnfolderBase]: 214/428 cut-off events. [2024-06-03 22:18:18,427 INFO L125 PetriNetUnfolderBase]: For 5256/5256 co-relation queries the response was YES. [2024-06-03 22:18:18,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2041 conditions, 428 events. 214/428 cut-off events. For 5256/5256 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1901 event pairs, 42 based on Foata normal form. 4/429 useless extension candidates. Maximal degree in co-relation 2001. Up to 297 conditions per place. [2024-06-03 22:18:18,430 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 65 selfloop transitions, 29 changer transitions 0/98 dead transitions. [2024-06-03 22:18:18,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 98 transitions, 913 flow [2024-06-03 22:18:18,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:18:18,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:18:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-03 22:18:18,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2024-06-03 22:18:18,431 INFO L175 Difference]: Start difference. First operand has 82 places, 69 transitions, 549 flow. Second operand 10 states and 134 transitions. [2024-06-03 22:18:18,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 98 transitions, 913 flow [2024-06-03 22:18:18,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 98 transitions, 795 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-03 22:18:18,437 INFO L231 Difference]: Finished difference. Result has 88 places, 84 transitions, 677 flow [2024-06-03 22:18:18,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=677, PETRI_PLACES=88, PETRI_TRANSITIONS=84} [2024-06-03 22:18:18,437 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 56 predicate places. [2024-06-03 22:18:18,438 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 84 transitions, 677 flow [2024-06-03 22:18:18,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:18,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:18,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:18:18,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 22:18:18,438 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-03 22:18:18,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:18,439 INFO L85 PathProgramCache]: Analyzing trace with hash 288948555, now seen corresponding path program 1 times [2024-06-03 22:18:18,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:18,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143542235] [2024-06-03 22:18:18,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:18,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:24,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:18:24,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:24,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143542235] [2024-06-03 22:18:24,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143542235] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:24,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:24,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:18:24,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013697785] [2024-06-03 22:18:24,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:24,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:18:24,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:24,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:18:24,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:18:24,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:18:24,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 84 transitions, 677 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:24,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:24,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:18:24,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:24,973 INFO L124 PetriNetUnfolderBase]: 218/430 cut-off events. [2024-06-03 22:18:24,973 INFO L125 PetriNetUnfolderBase]: For 5225/5225 co-relation queries the response was YES. [2024-06-03 22:18:24,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2174 conditions, 430 events. 218/430 cut-off events. For 5225/5225 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1875 event pairs, 23 based on Foata normal form. 2/431 useless extension candidates. Maximal degree in co-relation 2128. Up to 337 conditions per place. [2024-06-03 22:18:24,976 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 84 selfloop transitions, 12 changer transitions 0/100 dead transitions. [2024-06-03 22:18:24,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 100 transitions, 917 flow [2024-06-03 22:18:24,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:18:24,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:18:24,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-03 22:18:24,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-03 22:18:24,978 INFO L175 Difference]: Start difference. First operand has 88 places, 84 transitions, 677 flow. Second operand 8 states and 108 transitions. [2024-06-03 22:18:24,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 100 transitions, 917 flow [2024-06-03 22:18:24,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 100 transitions, 877 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-06-03 22:18:24,985 INFO L231 Difference]: Finished difference. Result has 94 places, 85 transitions, 675 flow [2024-06-03 22:18:24,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=675, PETRI_PLACES=94, PETRI_TRANSITIONS=85} [2024-06-03 22:18:24,986 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 62 predicate places. [2024-06-03 22:18:24,986 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 85 transitions, 675 flow [2024-06-03 22:18:24,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:24,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:24,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:18:24,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 22:18:24,987 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-03 22:18:24,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:24,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1272914161, now seen corresponding path program 2 times [2024-06-03 22:18:24,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:24,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117886903] [2024-06-03 22:18:24,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:24,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:30,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:18:30,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:30,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117886903] [2024-06-03 22:18:30,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117886903] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:30,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:30,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:18:30,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370422586] [2024-06-03 22:18:30,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:30,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:18:30,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:30,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:18:30,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:18:30,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 22:18:30,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 85 transitions, 675 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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-03 22:18:30,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:30,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 22:18:30,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:30,443 INFO L124 PetriNetUnfolderBase]: 222/438 cut-off events. [2024-06-03 22:18:30,444 INFO L125 PetriNetUnfolderBase]: For 5574/5574 co-relation queries the response was YES. [2024-06-03 22:18:30,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2194 conditions, 438 events. 222/438 cut-off events. For 5574/5574 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1942 event pairs, 43 based on Foata normal form. 2/439 useless extension candidates. Maximal degree in co-relation 2146. Up to 362 conditions per place. [2024-06-03 22:18:30,447 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 84 selfloop transitions, 12 changer transitions 0/100 dead transitions. [2024-06-03 22:18:30,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 100 transitions, 915 flow [2024-06-03 22:18:30,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:18:30,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:18:30,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2024-06-03 22:18:30,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2024-06-03 22:18:30,449 INFO L175 Difference]: Start difference. First operand has 94 places, 85 transitions, 675 flow. Second operand 7 states and 108 transitions. [2024-06-03 22:18:30,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 100 transitions, 915 flow [2024-06-03 22:18:30,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 100 transitions, 872 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-03 22:18:30,456 INFO L231 Difference]: Finished difference. Result has 94 places, 86 transitions, 672 flow [2024-06-03 22:18:30,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=672, PETRI_PLACES=94, PETRI_TRANSITIONS=86} [2024-06-03 22:18:30,456 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 62 predicate places. [2024-06-03 22:18:30,456 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 86 transitions, 672 flow [2024-06-03 22:18:30,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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-03 22:18:30,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:30,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:18:30,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 22:18:30,458 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-03 22:18:30,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:30,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1272909201, now seen corresponding path program 1 times [2024-06-03 22:18:30,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:30,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144586574] [2024-06-03 22:18:30,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:30,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:36,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:18:36,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:36,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144586574] [2024-06-03 22:18:36,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144586574] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:36,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:36,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:18:36,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343311638] [2024-06-03 22:18:36,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:36,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:18:36,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:36,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:18:36,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:18:36,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 22:18:36,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 86 transitions, 672 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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-03 22:18:36,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:36,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 22:18:36,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:36,685 INFO L124 PetriNetUnfolderBase]: 220/430 cut-off events. [2024-06-03 22:18:36,686 INFO L125 PetriNetUnfolderBase]: For 5229/5229 co-relation queries the response was YES. [2024-06-03 22:18:36,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2144 conditions, 430 events. 220/430 cut-off events. For 5229/5229 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1898 event pairs, 45 based on Foata normal form. 1/427 useless extension candidates. Maximal degree in co-relation 2097. Up to 288 conditions per place. [2024-06-03 22:18:36,689 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 57 selfloop transitions, 35 changer transitions 0/96 dead transitions. [2024-06-03 22:18:36,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 96 transitions, 899 flow [2024-06-03 22:18:36,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:18:36,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:18:36,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2024-06-03 22:18:36,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41125541125541126 [2024-06-03 22:18:36,691 INFO L175 Difference]: Start difference. First operand has 94 places, 86 transitions, 672 flow. Second operand 7 states and 95 transitions. [2024-06-03 22:18:36,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 96 transitions, 899 flow [2024-06-03 22:18:36,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 96 transitions, 869 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-03 22:18:36,697 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 747 flow [2024-06-03 22:18:36,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=747, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2024-06-03 22:18:36,698 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 64 predicate places. [2024-06-03 22:18:36,698 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 747 flow [2024-06-03 22:18:36,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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-03 22:18:36,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:36,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:18:36,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 22:18:36,699 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-03 22:18:36,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:36,699 INFO L85 PathProgramCache]: Analyzing trace with hash -2122222325, now seen corresponding path program 3 times [2024-06-03 22:18:36,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:36,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970065086] [2024-06-03 22:18:36,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:36,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:42,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:18:42,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:42,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970065086] [2024-06-03 22:18:42,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970065086] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:42,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:42,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:18:42,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319075277] [2024-06-03 22:18:42,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:42,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:18:42,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:42,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:18:42,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:18:42,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:18:42,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 747 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:42,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:42,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:18:42,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:43,022 INFO L124 PetriNetUnfolderBase]: 224/445 cut-off events. [2024-06-03 22:18:43,023 INFO L125 PetriNetUnfolderBase]: For 5924/5924 co-relation queries the response was YES. [2024-06-03 22:18:43,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2273 conditions, 445 events. 224/445 cut-off events. For 5924/5924 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1981 event pairs, 42 based on Foata normal form. 2/446 useless extension candidates. Maximal degree in co-relation 2224. Up to 368 conditions per place. [2024-06-03 22:18:43,026 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 81 selfloop transitions, 16 changer transitions 0/101 dead transitions. [2024-06-03 22:18:43,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 101 transitions, 986 flow [2024-06-03 22:18:43,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:18:43,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:18:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2024-06-03 22:18:43,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2024-06-03 22:18:43,029 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 747 flow. Second operand 8 states and 106 transitions. [2024-06-03 22:18:43,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 101 transitions, 986 flow [2024-06-03 22:18:43,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 101 transitions, 907 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-03 22:18:43,037 INFO L231 Difference]: Finished difference. Result has 99 places, 90 transitions, 731 flow [2024-06-03 22:18:43,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=731, PETRI_PLACES=99, PETRI_TRANSITIONS=90} [2024-06-03 22:18:43,038 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 67 predicate places. [2024-06-03 22:18:43,038 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 90 transitions, 731 flow [2024-06-03 22:18:43,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:43,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:43,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:18:43,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 22:18:43,039 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-03 22:18:43,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:43,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1348093643, now seen corresponding path program 4 times [2024-06-03 22:18:43,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:43,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442793204] [2024-06-03 22:18:43,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:43,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:49,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:18:49,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:49,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442793204] [2024-06-03 22:18:49,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442793204] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:49,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:49,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:18:49,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462516050] [2024-06-03 22:18:49,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:49,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:18:49,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:49,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:18:49,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:18:50,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:18:50,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 90 transitions, 731 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:50,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:50,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:18:50,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:50,420 INFO L124 PetriNetUnfolderBase]: 225/446 cut-off events. [2024-06-03 22:18:50,420 INFO L125 PetriNetUnfolderBase]: For 5957/5957 co-relation queries the response was YES. [2024-06-03 22:18:50,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2212 conditions, 446 events. 225/446 cut-off events. For 5957/5957 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1997 event pairs, 40 based on Foata normal form. 4/447 useless extension candidates. Maximal degree in co-relation 2162. Up to 333 conditions per place. [2024-06-03 22:18:50,423 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 76 selfloop transitions, 22 changer transitions 0/102 dead transitions. [2024-06-03 22:18:50,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 102 transitions, 970 flow [2024-06-03 22:18:50,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:18:50,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:18:50,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2024-06-03 22:18:50,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-03 22:18:50,424 INFO L175 Difference]: Start difference. First operand has 99 places, 90 transitions, 731 flow. Second operand 8 states and 110 transitions. [2024-06-03 22:18:50,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 102 transitions, 970 flow [2024-06-03 22:18:50,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 102 transitions, 929 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-03 22:18:50,432 INFO L231 Difference]: Finished difference. Result has 103 places, 93 transitions, 769 flow [2024-06-03 22:18:50,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=769, PETRI_PLACES=103, PETRI_TRANSITIONS=93} [2024-06-03 22:18:50,433 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 71 predicate places. [2024-06-03 22:18:50,433 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 93 transitions, 769 flow [2024-06-03 22:18:50,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:50,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:50,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:18:50,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 22:18:50,434 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-03 22:18:50,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:50,435 INFO L85 PathProgramCache]: Analyzing trace with hash 726858093, now seen corresponding path program 1 times [2024-06-03 22:18:50,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:50,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32190868] [2024-06-03 22:18:50,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:50,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:57,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:18:57,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:57,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32190868] [2024-06-03 22:18:57,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32190868] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:57,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:57,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:18:57,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376233052] [2024-06-03 22:18:57,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:57,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:18:57,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:57,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:18:57,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:18:57,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:18:57,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 93 transitions, 769 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:57,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:57,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:18:57,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:57,614 INFO L124 PetriNetUnfolderBase]: 228/453 cut-off events. [2024-06-03 22:18:57,614 INFO L125 PetriNetUnfolderBase]: For 5709/5709 co-relation queries the response was YES. [2024-06-03 22:18:57,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2284 conditions, 453 events. 228/453 cut-off events. For 5709/5709 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2041 event pairs, 37 based on Foata normal form. 1/451 useless extension candidates. Maximal degree in co-relation 2232. Up to 341 conditions per place. [2024-06-03 22:18:57,619 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 76 selfloop transitions, 28 changer transitions 0/108 dead transitions. [2024-06-03 22:18:57,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 108 transitions, 1043 flow [2024-06-03 22:18:57,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:18:57,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:18:57,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2024-06-03 22:18:57,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107744107744108 [2024-06-03 22:18:57,622 INFO L175 Difference]: Start difference. First operand has 103 places, 93 transitions, 769 flow. Second operand 9 states and 122 transitions. [2024-06-03 22:18:57,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 108 transitions, 1043 flow [2024-06-03 22:18:57,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 108 transitions, 968 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-03 22:18:57,632 INFO L231 Difference]: Finished difference. Result has 107 places, 98 transitions, 801 flow [2024-06-03 22:18:57,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=801, PETRI_PLACES=107, PETRI_TRANSITIONS=98} [2024-06-03 22:18:57,633 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 75 predicate places. [2024-06-03 22:18:57,633 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 98 transitions, 801 flow [2024-06-03 22:18:57,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:57,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:57,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:18:57,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 22:18:57,634 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-03 22:18:57,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:57,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1011957963, now seen corresponding path program 2 times [2024-06-03 22:18:57,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:57,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92381361] [2024-06-03 22:18:57,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:57,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:04,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:19:04,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:04,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92381361] [2024-06-03 22:19:04,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92381361] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:04,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:04,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:19:04,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679100427] [2024-06-03 22:19:04,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:04,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:19:04,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:04,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:19:04,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:19:04,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:19:04,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 98 transitions, 801 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:04,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:04,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:19:04,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:04,793 INFO L124 PetriNetUnfolderBase]: 231/458 cut-off events. [2024-06-03 22:19:04,793 INFO L125 PetriNetUnfolderBase]: For 5966/5966 co-relation queries the response was YES. [2024-06-03 22:19:04,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2313 conditions, 458 events. 231/458 cut-off events. For 5966/5966 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2070 event pairs, 37 based on Foata normal form. 1/456 useless extension candidates. Maximal degree in co-relation 2260. Up to 346 conditions per place. [2024-06-03 22:19:04,796 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 77 selfloop transitions, 31 changer transitions 0/112 dead transitions. [2024-06-03 22:19:04,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 112 transitions, 1075 flow [2024-06-03 22:19:04,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:19:04,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:19:04,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-03 22:19:04,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2024-06-03 22:19:04,799 INFO L175 Difference]: Start difference. First operand has 107 places, 98 transitions, 801 flow. Second operand 10 states and 134 transitions. [2024-06-03 22:19:04,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 112 transitions, 1075 flow [2024-06-03 22:19:04,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 112 transitions, 993 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-03 22:19:04,808 INFO L231 Difference]: Finished difference. Result has 112 places, 102 transitions, 831 flow [2024-06-03 22:19:04,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=831, PETRI_PLACES=112, PETRI_TRANSITIONS=102} [2024-06-03 22:19:04,808 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 80 predicate places. [2024-06-03 22:19:04,809 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 102 transitions, 831 flow [2024-06-03 22:19:04,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:04,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:04,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:19:04,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 22:19:04,809 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-03 22:19:04,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:04,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1022433483, now seen corresponding path program 3 times [2024-06-03 22:19:04,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:04,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508462532] [2024-06-03 22:19:04,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:04,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:19:11,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:11,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508462532] [2024-06-03 22:19:11,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508462532] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:11,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:11,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:19:11,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026094516] [2024-06-03 22:19:11,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:11,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:19:11,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:11,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:19:11,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:19:11,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:19:11,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 102 transitions, 831 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:11,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:11,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:19:11,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:11,688 INFO L124 PetriNetUnfolderBase]: 234/463 cut-off events. [2024-06-03 22:19:11,688 INFO L125 PetriNetUnfolderBase]: For 6442/6442 co-relation queries the response was YES. [2024-06-03 22:19:11,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2372 conditions, 463 events. 234/463 cut-off events. For 6442/6442 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2093 event pairs, 37 based on Foata normal form. 1/461 useless extension candidates. Maximal degree in co-relation 2318. Up to 341 conditions per place. [2024-06-03 22:19:11,692 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 78 selfloop transitions, 37 changer transitions 0/119 dead transitions. [2024-06-03 22:19:11,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 119 transitions, 1187 flow [2024-06-03 22:19:11,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:19:11,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:19:11,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-03 22:19:11,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022038567493113 [2024-06-03 22:19:11,696 INFO L175 Difference]: Start difference. First operand has 112 places, 102 transitions, 831 flow. Second operand 11 states and 146 transitions. [2024-06-03 22:19:11,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 119 transitions, 1187 flow [2024-06-03 22:19:11,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 119 transitions, 1100 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-03 22:19:11,705 INFO L231 Difference]: Finished difference. Result has 115 places, 107 transitions, 877 flow [2024-06-03 22:19:11,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=877, PETRI_PLACES=115, PETRI_TRANSITIONS=107} [2024-06-03 22:19:11,706 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 83 predicate places. [2024-06-03 22:19:11,706 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 107 transitions, 877 flow [2024-06-03 22:19:11,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:11,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:11,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:19:11,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 22:19:11,706 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-03 22:19:11,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:11,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1022077293, now seen corresponding path program 4 times [2024-06-03 22:19:11,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:11,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405655409] [2024-06-03 22:19:11,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:11,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:19:18,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:18,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405655409] [2024-06-03 22:19:18,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405655409] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:18,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:18,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:19:18,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338031476] [2024-06-03 22:19:18,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:18,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:19:18,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:18,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:19:18,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:19:18,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:19:18,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 107 transitions, 877 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:18,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:18,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:19:18,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:19,208 INFO L124 PetriNetUnfolderBase]: 232/462 cut-off events. [2024-06-03 22:19:19,209 INFO L125 PetriNetUnfolderBase]: For 6633/6633 co-relation queries the response was YES. [2024-06-03 22:19:19,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2361 conditions, 462 events. 232/462 cut-off events. For 6633/6633 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2104 event pairs, 37 based on Foata normal form. 1/460 useless extension candidates. Maximal degree in co-relation 2307. Up to 348 conditions per place. [2024-06-03 22:19:19,215 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 81 selfloop transitions, 32 changer transitions 0/117 dead transitions. [2024-06-03 22:19:19,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 117 transitions, 1127 flow [2024-06-03 22:19:19,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:19:19,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:19:19,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-03 22:19:19,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2024-06-03 22:19:19,216 INFO L175 Difference]: Start difference. First operand has 115 places, 107 transitions, 877 flow. Second operand 10 states and 133 transitions. [2024-06-03 22:19:19,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 117 transitions, 1127 flow [2024-06-03 22:19:19,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 117 transitions, 1078 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-03 22:19:19,226 INFO L231 Difference]: Finished difference. Result has 120 places, 107 transitions, 897 flow [2024-06-03 22:19:19,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=897, PETRI_PLACES=120, PETRI_TRANSITIONS=107} [2024-06-03 22:19:19,228 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 88 predicate places. [2024-06-03 22:19:19,229 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 107 transitions, 897 flow [2024-06-03 22:19:19,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:19,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:19,229 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-03 22:19:19,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 22:19:19,229 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-03 22:19:19,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:19,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1930116050, now seen corresponding path program 1 times [2024-06-03 22:19:19,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:19,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682090232] [2024-06-03 22:19:19,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:19,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:25,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:19:25,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:25,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682090232] [2024-06-03 22:19:25,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682090232] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:25,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:25,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:19:25,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553433885] [2024-06-03 22:19:25,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:25,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:19:25,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:25,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:19:25,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:19:25,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:19:25,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 107 transitions, 897 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:25,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:25,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:19:25,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:25,921 INFO L124 PetriNetUnfolderBase]: 236/467 cut-off events. [2024-06-03 22:19:25,922 INFO L125 PetriNetUnfolderBase]: For 7460/7460 co-relation queries the response was YES. [2024-06-03 22:19:25,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2442 conditions, 467 events. 236/467 cut-off events. For 7460/7460 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2137 event pairs, 20 based on Foata normal form. 2/465 useless extension candidates. Maximal degree in co-relation 2386. Up to 365 conditions per place. [2024-06-03 22:19:25,925 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 104 selfloop transitions, 10 changer transitions 0/118 dead transitions. [2024-06-03 22:19:25,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 118 transitions, 1157 flow [2024-06-03 22:19:25,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:19:25,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:19:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2024-06-03 22:19:25,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4025974025974026 [2024-06-03 22:19:25,927 INFO L175 Difference]: Start difference. First operand has 120 places, 107 transitions, 897 flow. Second operand 7 states and 93 transitions. [2024-06-03 22:19:25,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 118 transitions, 1157 flow [2024-06-03 22:19:25,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 118 transitions, 1083 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-03 22:19:25,942 INFO L231 Difference]: Finished difference. Result has 118 places, 108 transitions, 857 flow [2024-06-03 22:19:25,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=857, PETRI_PLACES=118, PETRI_TRANSITIONS=108} [2024-06-03 22:19:25,942 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 86 predicate places. [2024-06-03 22:19:25,942 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 108 transitions, 857 flow [2024-06-03 22:19:25,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:25,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:25,943 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-03 22:19:25,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 22:19:25,943 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-03 22:19:25,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:25,944 INFO L85 PathProgramCache]: Analyzing trace with hash -631592012, now seen corresponding path program 2 times [2024-06-03 22:19:25,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:25,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207520012] [2024-06-03 22:19:25,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:25,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:32,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:19:32,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:32,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207520012] [2024-06-03 22:19:32,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207520012] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:32,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:32,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:19:32,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025197052] [2024-06-03 22:19:32,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:32,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:19:32,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:32,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:19:32,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:19:32,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:19:32,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 108 transitions, 857 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:32,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:32,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:19:32,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:32,950 INFO L124 PetriNetUnfolderBase]: 240/475 cut-off events. [2024-06-03 22:19:32,950 INFO L125 PetriNetUnfolderBase]: For 7916/7916 co-relation queries the response was YES. [2024-06-03 22:19:32,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2444 conditions, 475 events. 240/475 cut-off events. For 7916/7916 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2189 event pairs, 41 based on Foata normal form. 2/473 useless extension candidates. Maximal degree in co-relation 2387. Up to 370 conditions per place. [2024-06-03 22:19:32,953 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 91 selfloop transitions, 22 changer transitions 0/117 dead transitions. [2024-06-03 22:19:32,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 117 transitions, 1113 flow [2024-06-03 22:19:32,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:19:32,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:19:32,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2024-06-03 22:19:32,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-03 22:19:32,959 INFO L175 Difference]: Start difference. First operand has 118 places, 108 transitions, 857 flow. Second operand 7 states and 99 transitions. [2024-06-03 22:19:32,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 117 transitions, 1113 flow [2024-06-03 22:19:32,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 117 transitions, 1089 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 22:19:32,970 INFO L231 Difference]: Finished difference. Result has 120 places, 109 transitions, 893 flow [2024-06-03 22:19:32,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=893, PETRI_PLACES=120, PETRI_TRANSITIONS=109} [2024-06-03 22:19:32,970 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 88 predicate places. [2024-06-03 22:19:32,970 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 109 transitions, 893 flow [2024-06-03 22:19:32,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:32,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:32,971 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-03 22:19:32,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 22:19:32,971 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-03 22:19:32,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:32,971 INFO L85 PathProgramCache]: Analyzing trace with hash -631739882, now seen corresponding path program 3 times [2024-06-03 22:19:32,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:32,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626597214] [2024-06-03 22:19:32,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:32,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:38,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:19:38,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:38,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626597214] [2024-06-03 22:19:38,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626597214] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:38,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:38,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:19:38,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234190615] [2024-06-03 22:19:38,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:38,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:19:38,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:38,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:19:38,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:19:39,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:19:39,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 109 transitions, 893 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:39,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:39,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:19:39,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:39,418 INFO L124 PetriNetUnfolderBase]: 244/483 cut-off events. [2024-06-03 22:19:39,418 INFO L125 PetriNetUnfolderBase]: For 8638/8638 co-relation queries the response was YES. [2024-06-03 22:19:39,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2527 conditions, 483 events. 244/483 cut-off events. For 8638/8638 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2241 event pairs, 39 based on Foata normal form. 2/481 useless extension candidates. Maximal degree in co-relation 2469. Up to 306 conditions per place. [2024-06-03 22:19:39,421 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 91 selfloop transitions, 25 changer transitions 0/120 dead transitions. [2024-06-03 22:19:39,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 120 transitions, 1217 flow [2024-06-03 22:19:39,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:19:39,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:19:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2024-06-03 22:19:39,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-03 22:19:39,424 INFO L175 Difference]: Start difference. First operand has 120 places, 109 transitions, 893 flow. Second operand 7 states and 99 transitions. [2024-06-03 22:19:39,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 120 transitions, 1217 flow [2024-06-03 22:19:39,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 120 transitions, 1163 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-03 22:19:39,437 INFO L231 Difference]: Finished difference. Result has 122 places, 110 transitions, 907 flow [2024-06-03 22:19:39,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=907, PETRI_PLACES=122, PETRI_TRANSITIONS=110} [2024-06-03 22:19:39,438 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 90 predicate places. [2024-06-03 22:19:39,439 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 110 transitions, 907 flow [2024-06-03 22:19:39,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:39,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:39,439 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-03 22:19:39,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 22:19:39,439 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-03 22:19:39,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:39,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1949200052, now seen corresponding path program 1 times [2024-06-03 22:19:39,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:39,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240657465] [2024-06-03 22:19:39,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:39,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:45,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:19:45,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:45,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240657465] [2024-06-03 22:19:45,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240657465] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:45,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:45,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:19:45,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081519900] [2024-06-03 22:19:45,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:45,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:19:45,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:45,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:19:45,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:19:45,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:19:45,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 110 transitions, 907 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:45,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:45,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:19:45,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:45,918 INFO L124 PetriNetUnfolderBase]: 242/480 cut-off events. [2024-06-03 22:19:45,918 INFO L125 PetriNetUnfolderBase]: For 8447/8447 co-relation queries the response was YES. [2024-06-03 22:19:45,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2504 conditions, 480 events. 242/480 cut-off events. For 8447/8447 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2214 event pairs, 40 based on Foata normal form. 1/477 useless extension candidates. Maximal degree in co-relation 2445. Up to 296 conditions per place. [2024-06-03 22:19:45,921 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 68 selfloop transitions, 48 changer transitions 0/120 dead transitions. [2024-06-03 22:19:45,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 120 transitions, 1181 flow [2024-06-03 22:19:45,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:19:45,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:19:45,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2024-06-03 22:19:45,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-06-03 22:19:45,922 INFO L175 Difference]: Start difference. First operand has 122 places, 110 transitions, 907 flow. Second operand 8 states and 116 transitions. [2024-06-03 22:19:45,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 120 transitions, 1181 flow [2024-06-03 22:19:45,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 120 transitions, 1135 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-03 22:19:45,941 INFO L231 Difference]: Finished difference. Result has 126 places, 112 transitions, 994 flow [2024-06-03 22:19:45,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=994, PETRI_PLACES=126, PETRI_TRANSITIONS=112} [2024-06-03 22:19:45,942 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 94 predicate places. [2024-06-03 22:19:45,942 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 112 transitions, 994 flow [2024-06-03 22:19:45,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:45,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:45,942 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-03 22:19:45,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 22:19:45,942 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-03 22:19:45,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:45,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1358871552, now seen corresponding path program 4 times [2024-06-03 22:19:45,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:45,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207465617] [2024-06-03 22:19:45,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:45,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:51,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:19:51,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:51,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207465617] [2024-06-03 22:19:51,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207465617] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:51,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:51,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:19:51,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404213906] [2024-06-03 22:19:51,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:51,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:19:51,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:51,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:19:51,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:19:51,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:19:51,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 112 transitions, 994 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:51,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:51,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:19:51,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:52,287 INFO L124 PetriNetUnfolderBase]: 249/496 cut-off events. [2024-06-03 22:19:52,287 INFO L125 PetriNetUnfolderBase]: For 9455/9455 co-relation queries the response was YES. [2024-06-03 22:19:52,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2654 conditions, 496 events. 249/496 cut-off events. For 9455/9455 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2303 event pairs, 36 based on Foata normal form. 2/495 useless extension candidates. Maximal degree in co-relation 2594. Up to 384 conditions per place. [2024-06-03 22:19:52,291 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 93 selfloop transitions, 27 changer transitions 0/124 dead transitions. [2024-06-03 22:19:52,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 124 transitions, 1289 flow [2024-06-03 22:19:52,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:19:52,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:19:52,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2024-06-03 22:19:52,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4128787878787879 [2024-06-03 22:19:52,293 INFO L175 Difference]: Start difference. First operand has 126 places, 112 transitions, 994 flow. Second operand 8 states and 109 transitions. [2024-06-03 22:19:52,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 124 transitions, 1289 flow [2024-06-03 22:19:52,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 124 transitions, 1176 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-03 22:19:52,307 INFO L231 Difference]: Finished difference. Result has 127 places, 115 transitions, 974 flow [2024-06-03 22:19:52,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=974, PETRI_PLACES=127, PETRI_TRANSITIONS=115} [2024-06-03 22:19:52,308 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 95 predicate places. [2024-06-03 22:19:52,309 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 115 transitions, 974 flow [2024-06-03 22:19:52,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:52,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:52,309 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-03 22:19:52,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 22:19:52,309 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-03 22:19:52,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:52,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1364233932, now seen corresponding path program 5 times [2024-06-03 22:19:52,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:52,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333848430] [2024-06-03 22:19:52,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:52,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:58,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-03 22:19:58,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:58,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333848430] [2024-06-03 22:19:58,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333848430] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:58,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:58,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:19:58,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043794016] [2024-06-03 22:19:58,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:58,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:19:58,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:58,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:19:58,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:19:58,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:19:58,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 115 transitions, 974 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:58,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:58,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:19:58,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:59,126 INFO L124 PetriNetUnfolderBase]: 246/491 cut-off events. [2024-06-03 22:19:59,126 INFO L125 PetriNetUnfolderBase]: For 8418/8418 co-relation queries the response was YES. [2024-06-03 22:19:59,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2521 conditions, 491 events. 246/491 cut-off events. For 8418/8418 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2282 event pairs, 35 based on Foata normal form. 2/490 useless extension candidates. Maximal degree in co-relation 2461. Up to 379 conditions per place. [2024-06-03 22:19:59,130 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 96 selfloop transitions, 24 changer transitions 0/124 dead transitions. [2024-06-03 22:19:59,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 124 transitions, 1236 flow [2024-06-03 22:19:59,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:19:59,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:19:59,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-03 22:19:59,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4053030303030303 [2024-06-03 22:19:59,132 INFO L175 Difference]: Start difference. First operand has 127 places, 115 transitions, 974 flow. Second operand 8 states and 107 transitions. [2024-06-03 22:19:59,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 124 transitions, 1236 flow [2024-06-03 22:19:59,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 124 transitions, 1172 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-03 22:19:59,147 INFO L231 Difference]: Finished difference. Result has 130 places, 115 transitions, 962 flow [2024-06-03 22:19:59,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=962, PETRI_PLACES=130, PETRI_TRANSITIONS=115} [2024-06-03 22:19:59,147 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 98 predicate places. [2024-06-03 22:19:59,147 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 115 transitions, 962 flow [2024-06-03 22:19:59,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:59,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:59,148 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-03 22:19:59,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 22:19:59,148 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-03 22:19:59,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:59,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1057765360, now seen corresponding path program 1 times [2024-06-03 22:19:59,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:59,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417939002] [2024-06-03 22:19:59,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:59,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:06,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:06,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:06,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417939002] [2024-06-03 22:20:06,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417939002] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:06,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:06,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:20:06,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846015178] [2024-06-03 22:20:06,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:06,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:20:06,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:06,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:20:06,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:20:06,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:20:06,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 115 transitions, 962 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:06,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:06,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:20:06,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:06,747 INFO L124 PetriNetUnfolderBase]: 265/532 cut-off events. [2024-06-03 22:20:06,748 INFO L125 PetriNetUnfolderBase]: For 13037/13037 co-relation queries the response was YES. [2024-06-03 22:20:06,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2701 conditions, 532 events. 265/532 cut-off events. For 13037/13037 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2527 event pairs, 39 based on Foata normal form. 11/540 useless extension candidates. Maximal degree in co-relation 2640. Up to 322 conditions per place. [2024-06-03 22:20:06,751 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 83 selfloop transitions, 39 changer transitions 6/132 dead transitions. [2024-06-03 22:20:06,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 132 transitions, 1320 flow [2024-06-03 22:20:06,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:20:06,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:20:06,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 142 transitions. [2024-06-03 22:20:06,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4303030303030303 [2024-06-03 22:20:06,752 INFO L175 Difference]: Start difference. First operand has 130 places, 115 transitions, 962 flow. Second operand 10 states and 142 transitions. [2024-06-03 22:20:06,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 132 transitions, 1320 flow [2024-06-03 22:20:06,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 132 transitions, 1238 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-03 22:20:06,768 INFO L231 Difference]: Finished difference. Result has 133 places, 115 transitions, 980 flow [2024-06-03 22:20:06,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=980, PETRI_PLACES=133, PETRI_TRANSITIONS=115} [2024-06-03 22:20:06,768 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 101 predicate places. [2024-06-03 22:20:06,768 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 115 transitions, 980 flow [2024-06-03 22:20:06,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:06,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:06,769 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-03 22:20:06,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 22:20:06,769 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-03 22:20:06,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:06,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1305926738, now seen corresponding path program 2 times [2024-06-03 22:20:06,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:06,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879759338] [2024-06-03 22:20:06,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:06,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:13,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:13,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879759338] [2024-06-03 22:20:13,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879759338] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:13,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:13,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:20:13,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862624392] [2024-06-03 22:20:13,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:13,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:20:13,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:13,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:20:13,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:20:13,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:20:13,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 115 transitions, 980 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:13,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:13,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:20:13,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:14,284 INFO L124 PetriNetUnfolderBase]: 252/507 cut-off events. [2024-06-03 22:20:14,285 INFO L125 PetriNetUnfolderBase]: For 10102/10102 co-relation queries the response was YES. [2024-06-03 22:20:14,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2638 conditions, 507 events. 252/507 cut-off events. For 10102/10102 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2405 event pairs, 37 based on Foata normal form. 2/506 useless extension candidates. Maximal degree in co-relation 2576. Up to 385 conditions per place. [2024-06-03 22:20:14,289 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 91 selfloop transitions, 33 changer transitions 0/128 dead transitions. [2024-06-03 22:20:14,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 128 transitions, 1272 flow [2024-06-03 22:20:14,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:20:14,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:20:14,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-03 22:20:14,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39944903581267216 [2024-06-03 22:20:14,294 INFO L175 Difference]: Start difference. First operand has 133 places, 115 transitions, 980 flow. Second operand 11 states and 145 transitions. [2024-06-03 22:20:14,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 128 transitions, 1272 flow [2024-06-03 22:20:14,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 128 transitions, 1184 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-03 22:20:14,313 INFO L231 Difference]: Finished difference. Result has 136 places, 116 transitions, 980 flow [2024-06-03 22:20:14,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=980, PETRI_PLACES=136, PETRI_TRANSITIONS=116} [2024-06-03 22:20:14,313 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 104 predicate places. [2024-06-03 22:20:14,314 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 116 transitions, 980 flow [2024-06-03 22:20:14,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:14,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:14,314 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-03 22:20:14,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 22:20:14,314 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-03 22:20:14,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:14,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1316381620, now seen corresponding path program 3 times [2024-06-03 22:20:14,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:14,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474331375] [2024-06-03 22:20:14,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:14,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:22,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:22,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:22,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474331375] [2024-06-03 22:20:22,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474331375] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:22,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:22,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:20:22,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998881377] [2024-06-03 22:20:22,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:22,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:20:22,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:22,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:20:22,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:20:22,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:20:22,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 116 transitions, 980 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:22,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:22,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:20:22,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:22,655 INFO L124 PetriNetUnfolderBase]: 290/584 cut-off events. [2024-06-03 22:20:22,655 INFO L125 PetriNetUnfolderBase]: For 17215/17215 co-relation queries the response was YES. [2024-06-03 22:20:22,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3339 conditions, 584 events. 290/584 cut-off events. For 17215/17215 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2829 event pairs, 48 based on Foata normal form. 2/583 useless extension candidates. Maximal degree in co-relation 3276. Up to 291 conditions per place. [2024-06-03 22:20:22,659 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 80 selfloop transitions, 55 changer transitions 0/139 dead transitions. [2024-06-03 22:20:22,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 139 transitions, 1516 flow [2024-06-03 22:20:22,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:20:22,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:20:22,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 168 transitions. [2024-06-03 22:20:22,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-03 22:20:22,661 INFO L175 Difference]: Start difference. First operand has 136 places, 116 transitions, 980 flow. Second operand 12 states and 168 transitions. [2024-06-03 22:20:22,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 139 transitions, 1516 flow [2024-06-03 22:20:22,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 139 transitions, 1438 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-03 22:20:22,686 INFO L231 Difference]: Finished difference. Result has 140 places, 119 transitions, 1086 flow [2024-06-03 22:20:22,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1086, PETRI_PLACES=140, PETRI_TRANSITIONS=119} [2024-06-03 22:20:22,686 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 108 predicate places. [2024-06-03 22:20:22,687 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 119 transitions, 1086 flow [2024-06-03 22:20:22,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:22,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:22,687 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-03 22:20:22,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 22:20:22,687 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-03 22:20:22,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:22,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1619625968, now seen corresponding path program 4 times [2024-06-03 22:20:22,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:22,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064879882] [2024-06-03 22:20:22,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:22,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:29,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:29,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064879882] [2024-06-03 22:20:29,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064879882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:29,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:29,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:20:29,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13303204] [2024-06-03 22:20:29,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:29,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:20:29,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:29,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:20:29,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:20:29,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:20:29,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 119 transitions, 1086 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:29,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:29,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:20:29,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:30,103 INFO L124 PetriNetUnfolderBase]: 294/590 cut-off events. [2024-06-03 22:20:30,104 INFO L125 PetriNetUnfolderBase]: For 18350/18350 co-relation queries the response was YES. [2024-06-03 22:20:30,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3505 conditions, 590 events. 294/590 cut-off events. For 18350/18350 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2866 event pairs, 50 based on Foata normal form. 2/589 useless extension candidates. Maximal degree in co-relation 3440. Up to 468 conditions per place. [2024-06-03 22:20:30,108 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 95 selfloop transitions, 33 changer transitions 0/132 dead transitions. [2024-06-03 22:20:30,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 132 transitions, 1390 flow [2024-06-03 22:20:30,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:20:30,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:20:30,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2024-06-03 22:20:30,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39669421487603307 [2024-06-03 22:20:30,110 INFO L175 Difference]: Start difference. First operand has 140 places, 119 transitions, 1086 flow. Second operand 11 states and 144 transitions. [2024-06-03 22:20:30,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 132 transitions, 1390 flow [2024-06-03 22:20:30,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 132 transitions, 1285 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-03 22:20:30,141 INFO L231 Difference]: Finished difference. Result has 143 places, 120 transitions, 1073 flow [2024-06-03 22:20:30,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=982, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1073, PETRI_PLACES=143, PETRI_TRANSITIONS=120} [2024-06-03 22:20:30,141 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 111 predicate places. [2024-06-03 22:20:30,142 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 120 transitions, 1073 flow [2024-06-03 22:20:30,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:30,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:30,142 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-03 22:20:30,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-03 22:20:30,142 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-03 22:20:30,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:30,143 INFO L85 PathProgramCache]: Analyzing trace with hash -74549848, now seen corresponding path program 5 times [2024-06-03 22:20:30,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:30,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105870081] [2024-06-03 22:20:30,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:30,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:36,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:36,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:36,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105870081] [2024-06-03 22:20:36,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105870081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:36,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:36,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:20:36,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259377514] [2024-06-03 22:20:36,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:36,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:20:36,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:36,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:20:36,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:20:36,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:20:36,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 120 transitions, 1073 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:36,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:36,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:20:36,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:37,018 INFO L124 PetriNetUnfolderBase]: 291/585 cut-off events. [2024-06-03 22:20:37,019 INFO L125 PetriNetUnfolderBase]: For 17774/17774 co-relation queries the response was YES. [2024-06-03 22:20:37,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3379 conditions, 585 events. 291/585 cut-off events. For 17774/17774 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2818 event pairs, 49 based on Foata normal form. 2/584 useless extension candidates. Maximal degree in co-relation 3313. Up to 454 conditions per place. [2024-06-03 22:20:37,023 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 91 selfloop transitions, 38 changer transitions 0/133 dead transitions. [2024-06-03 22:20:37,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 133 transitions, 1361 flow [2024-06-03 22:20:37,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:20:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:20:37,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 156 transitions. [2024-06-03 22:20:37,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-03 22:20:37,042 INFO L175 Difference]: Start difference. First operand has 143 places, 120 transitions, 1073 flow. Second operand 12 states and 156 transitions. [2024-06-03 22:20:37,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 133 transitions, 1361 flow [2024-06-03 22:20:37,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 133 transitions, 1281 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-03 22:20:37,073 INFO L231 Difference]: Finished difference. Result has 146 places, 120 transitions, 1073 flow [2024-06-03 22:20:37,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=993, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1073, PETRI_PLACES=146, PETRI_TRANSITIONS=120} [2024-06-03 22:20:37,073 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 114 predicate places. [2024-06-03 22:20:37,074 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 120 transitions, 1073 flow [2024-06-03 22:20:37,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:37,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:37,074 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-03 22:20:37,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-03 22:20:37,074 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-03 22:20:37,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:37,075 INFO L85 PathProgramCache]: Analyzing trace with hash -295943730, now seen corresponding path program 1 times [2024-06-03 22:20:37,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:37,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652739476] [2024-06-03 22:20:37,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:37,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:42,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:42,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:42,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652739476] [2024-06-03 22:20:42,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652739476] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:42,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:42,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:20:42,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536222221] [2024-06-03 22:20:42,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:42,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:20:42,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:42,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:20:42,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:20:43,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:20:43,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 120 transitions, 1073 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:43,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:43,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:20:43,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:43,421 INFO L124 PetriNetUnfolderBase]: 295/590 cut-off events. [2024-06-03 22:20:43,422 INFO L125 PetriNetUnfolderBase]: For 18582/18582 co-relation queries the response was YES. [2024-06-03 22:20:43,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3411 conditions, 590 events. 295/590 cut-off events. For 18582/18582 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2870 event pairs, 33 based on Foata normal form. 2/588 useless extension candidates. Maximal degree in co-relation 3344. Up to 478 conditions per place. [2024-06-03 22:20:43,442 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 118 selfloop transitions, 11 changer transitions 0/133 dead transitions. [2024-06-03 22:20:43,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 133 transitions, 1365 flow [2024-06-03 22:20:43,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:20:43,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:20:43,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-03 22:20:43,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-03 22:20:43,443 INFO L175 Difference]: Start difference. First operand has 146 places, 120 transitions, 1073 flow. Second operand 8 states and 104 transitions. [2024-06-03 22:20:43,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 133 transitions, 1365 flow [2024-06-03 22:20:43,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 133 transitions, 1240 flow, removed 9 selfloop flow, removed 12 redundant places. [2024-06-03 22:20:43,501 INFO L231 Difference]: Finished difference. Result has 142 places, 121 transitions, 982 flow [2024-06-03 22:20:43,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=982, PETRI_PLACES=142, PETRI_TRANSITIONS=121} [2024-06-03 22:20:43,509 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 110 predicate places. [2024-06-03 22:20:43,509 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 121 transitions, 982 flow [2024-06-03 22:20:43,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:43,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:43,510 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-03 22:20:43,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-03 22:20:43,510 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-03 22:20:43,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:43,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1891020972, now seen corresponding path program 2 times [2024-06-03 22:20:43,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:43,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615859107] [2024-06-03 22:20:43,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:43,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:50,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:50,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:50,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615859107] [2024-06-03 22:20:50,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615859107] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:50,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:50,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:20:50,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316527284] [2024-06-03 22:20:50,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:50,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:20:50,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:50,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:20:50,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:20:50,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:20:50,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 121 transitions, 982 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:50,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:50,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:20:50,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:50,634 INFO L124 PetriNetUnfolderBase]: 270/539 cut-off events. [2024-06-03 22:20:50,634 INFO L125 PetriNetUnfolderBase]: For 12082/12082 co-relation queries the response was YES. [2024-06-03 22:20:50,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2694 conditions, 539 events. 270/539 cut-off events. For 12082/12082 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2603 event pairs, 40 based on Foata normal form. 2/537 useless extension candidates. Maximal degree in co-relation 2627. Up to 417 conditions per place. [2024-06-03 22:20:50,639 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 97 selfloop transitions, 30 changer transitions 0/131 dead transitions. [2024-06-03 22:20:50,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 131 transitions, 1266 flow [2024-06-03 22:20:50,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:20:50,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:20:50,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2024-06-03 22:20:50,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42803030303030304 [2024-06-03 22:20:50,663 INFO L175 Difference]: Start difference. First operand has 142 places, 121 transitions, 982 flow. Second operand 8 states and 113 transitions. [2024-06-03 22:20:50,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 131 transitions, 1266 flow [2024-06-03 22:20:50,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 131 transitions, 1233 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-03 22:20:50,684 INFO L231 Difference]: Finished difference. Result has 143 places, 122 transitions, 1023 flow [2024-06-03 22:20:50,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=949, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1023, PETRI_PLACES=143, PETRI_TRANSITIONS=122} [2024-06-03 22:20:50,685 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 111 predicate places. [2024-06-03 22:20:50,685 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 122 transitions, 1023 flow [2024-06-03 22:20:50,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:50,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:50,685 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-03 22:20:50,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-03 22:20:50,686 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-03 22:20:50,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:50,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1895484972, now seen corresponding path program 3 times [2024-06-03 22:20:50,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:50,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732069362] [2024-06-03 22:20:50,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:50,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:56,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:56,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:56,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732069362] [2024-06-03 22:20:56,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732069362] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:56,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:56,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:20:56,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934192512] [2024-06-03 22:20:56,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:56,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:20:56,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:56,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:20:56,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:20:56,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:20:56,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 122 transitions, 1023 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:56,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:56,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:20:56,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:57,109 INFO L124 PetriNetUnfolderBase]: 281/560 cut-off events. [2024-06-03 22:20:57,110 INFO L125 PetriNetUnfolderBase]: For 13713/13713 co-relation queries the response was YES. [2024-06-03 22:20:57,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2882 conditions, 560 events. 281/560 cut-off events. For 13713/13713 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2713 event pairs, 41 based on Foata normal form. 2/558 useless extension candidates. Maximal degree in co-relation 2815. Up to 358 conditions per place. [2024-06-03 22:20:57,117 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 90 selfloop transitions, 41 changer transitions 0/135 dead transitions. [2024-06-03 22:20:57,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 135 transitions, 1407 flow [2024-06-03 22:20:57,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:20:57,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:20:57,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2024-06-03 22:20:57,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2024-06-03 22:20:57,119 INFO L175 Difference]: Start difference. First operand has 143 places, 122 transitions, 1023 flow. Second operand 8 states and 114 transitions. [2024-06-03 22:20:57,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 135 transitions, 1407 flow [2024-06-03 22:20:57,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 135 transitions, 1358 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 22:20:57,144 INFO L231 Difference]: Finished difference. Result has 146 places, 124 transitions, 1084 flow [2024-06-03 22:20:57,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1084, PETRI_PLACES=146, PETRI_TRANSITIONS=124} [2024-06-03 22:20:57,144 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 114 predicate places. [2024-06-03 22:20:57,144 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 124 transitions, 1084 flow [2024-06-03 22:20:57,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:57,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:57,145 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-03 22:20:57,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-03 22:20:57,145 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-03 22:20:57,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:57,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1890901002, now seen corresponding path program 4 times [2024-06-03 22:20:57,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:57,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787539677] [2024-06-03 22:20:57,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:57,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:03,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:03,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:03,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787539677] [2024-06-03 22:21:03,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787539677] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:03,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:03,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:21:03,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749863258] [2024-06-03 22:21:03,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:03,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:21:03,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:03,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:21:03,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:21:03,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:21:03,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 124 transitions, 1084 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:03,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:03,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:21:03,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:03,843 INFO L124 PetriNetUnfolderBase]: 285/568 cut-off events. [2024-06-03 22:21:03,843 INFO L125 PetriNetUnfolderBase]: For 14595/14595 co-relation queries the response was YES. [2024-06-03 22:21:03,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2973 conditions, 568 events. 285/568 cut-off events. For 14595/14595 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2775 event pairs, 41 based on Foata normal form. 2/566 useless extension candidates. Maximal degree in co-relation 2905. Up to 301 conditions per place. [2024-06-03 22:21:03,847 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 99 selfloop transitions, 34 changer transitions 0/137 dead transitions. [2024-06-03 22:21:03,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 137 transitions, 1468 flow [2024-06-03 22:21:03,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:21:03,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:21:03,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2024-06-03 22:21:03,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-03 22:21:03,849 INFO L175 Difference]: Start difference. First operand has 146 places, 124 transitions, 1084 flow. Second operand 8 states and 112 transitions. [2024-06-03 22:21:03,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 137 transitions, 1468 flow [2024-06-03 22:21:03,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 137 transitions, 1408 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-03 22:21:03,875 INFO L231 Difference]: Finished difference. Result has 150 places, 125 transitions, 1108 flow [2024-06-03 22:21:03,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1108, PETRI_PLACES=150, PETRI_TRANSITIONS=125} [2024-06-03 22:21:03,875 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 118 predicate places. [2024-06-03 22:21:03,876 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 125 transitions, 1108 flow [2024-06-03 22:21:03,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:03,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:03,876 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-03 22:21:03,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-03 22:21:03,877 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-03 22:21:03,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:03,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1895669546, now seen corresponding path program 1 times [2024-06-03 22:21:03,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:03,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167489708] [2024-06-03 22:21:03,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:03,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:10,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-03 22:21:10,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:10,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167489708] [2024-06-03 22:21:10,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167489708] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:10,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:10,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:21:10,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507402146] [2024-06-03 22:21:10,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:10,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:21:10,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:10,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:21:10,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:21:10,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:21:10,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 125 transitions, 1108 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:10,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:10,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:21:10,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:10,927 INFO L124 PetriNetUnfolderBase]: 288/575 cut-off events. [2024-06-03 22:21:10,927 INFO L125 PetriNetUnfolderBase]: For 14699/14699 co-relation queries the response was YES. [2024-06-03 22:21:10,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3082 conditions, 575 events. 288/575 cut-off events. For 14699/14699 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2824 event pairs, 42 based on Foata normal form. 1/572 useless extension candidates. Maximal degree in co-relation 3012. Up to 430 conditions per place. [2024-06-03 22:21:10,945 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 89 selfloop transitions, 43 changer transitions 0/136 dead transitions. [2024-06-03 22:21:10,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 136 transitions, 1430 flow [2024-06-03 22:21:10,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:21:10,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:21:10,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 129 transitions. [2024-06-03 22:21:10,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43434343434343436 [2024-06-03 22:21:10,951 INFO L175 Difference]: Start difference. First operand has 150 places, 125 transitions, 1108 flow. Second operand 9 states and 129 transitions. [2024-06-03 22:21:10,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 136 transitions, 1430 flow [2024-06-03 22:21:10,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 136 transitions, 1370 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-03 22:21:10,996 INFO L231 Difference]: Finished difference. Result has 154 places, 127 transitions, 1183 flow [2024-06-03 22:21:10,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1183, PETRI_PLACES=154, PETRI_TRANSITIONS=127} [2024-06-03 22:21:10,997 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 122 predicate places. [2024-06-03 22:21:10,997 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 127 transitions, 1183 flow [2024-06-03 22:21:10,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:10,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:10,998 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-03 22:21:10,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-03 22:21:10,998 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-03 22:21:10,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:10,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1525078390, now seen corresponding path program 5 times [2024-06-03 22:21:10,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:10,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891023291] [2024-06-03 22:21:10,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:10,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:16,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:16,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:16,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891023291] [2024-06-03 22:21:16,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891023291] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:16,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:16,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:21:16,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200464259] [2024-06-03 22:21:16,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:16,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:21:16,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:16,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:21:16,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:21:16,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:21:16,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 127 transitions, 1183 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:16,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:16,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:21:16,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:16,994 INFO L124 PetriNetUnfolderBase]: 295/591 cut-off events. [2024-06-03 22:21:16,994 INFO L125 PetriNetUnfolderBase]: For 16066/16066 co-relation queries the response was YES. [2024-06-03 22:21:16,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3202 conditions, 591 events. 295/591 cut-off events. For 16066/16066 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2898 event pairs, 40 based on Foata normal form. 2/590 useless extension candidates. Maximal degree in co-relation 3131. Up to 447 conditions per place. [2024-06-03 22:21:16,998 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 99 selfloop transitions, 37 changer transitions 0/140 dead transitions. [2024-06-03 22:21:16,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 140 transitions, 1509 flow [2024-06-03 22:21:16,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:21:16,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:21:16,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-03 22:21:16,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-03 22:21:16,999 INFO L175 Difference]: Start difference. First operand has 154 places, 127 transitions, 1183 flow. Second operand 9 states and 123 transitions. [2024-06-03 22:21:16,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 140 transitions, 1509 flow [2024-06-03 22:21:17,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 140 transitions, 1405 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-03 22:21:17,027 INFO L231 Difference]: Finished difference. Result has 156 places, 130 transitions, 1189 flow [2024-06-03 22:21:17,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1080, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1189, PETRI_PLACES=156, PETRI_TRANSITIONS=130} [2024-06-03 22:21:17,027 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 124 predicate places. [2024-06-03 22:21:17,027 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 130 transitions, 1189 flow [2024-06-03 22:21:17,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:17,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:17,028 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-03 22:21:17,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-03 22:21:17,028 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-03 22:21:17,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:17,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1752979540, now seen corresponding path program 6 times [2024-06-03 22:21:17,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:17,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270864110] [2024-06-03 22:21:17,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:17,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:23,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:23,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:23,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270864110] [2024-06-03 22:21:23,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270864110] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:23,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:23,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:21:23,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345112898] [2024-06-03 22:21:23,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:23,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:21:23,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:23,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:21:23,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:21:23,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:21:23,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 130 transitions, 1189 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:23,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:23,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:21:23,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:23,654 INFO L124 PetriNetUnfolderBase]: 302/604 cut-off events. [2024-06-03 22:21:23,655 INFO L125 PetriNetUnfolderBase]: For 16952/16952 co-relation queries the response was YES. [2024-06-03 22:21:23,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3264 conditions, 604 events. 302/604 cut-off events. For 16952/16952 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3002 event pairs, 38 based on Foata normal form. 2/603 useless extension candidates. Maximal degree in co-relation 3192. Up to 459 conditions per place. [2024-06-03 22:21:23,659 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 101 selfloop transitions, 38 changer transitions 0/143 dead transitions. [2024-06-03 22:21:23,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 143 transitions, 1526 flow [2024-06-03 22:21:23,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:21:23,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:21:23,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-03 22:21:23,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-03 22:21:23,661 INFO L175 Difference]: Start difference. First operand has 156 places, 130 transitions, 1189 flow. Second operand 9 states and 123 transitions. [2024-06-03 22:21:23,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 143 transitions, 1526 flow [2024-06-03 22:21:23,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 143 transitions, 1444 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 22:21:23,695 INFO L231 Difference]: Finished difference. Result has 159 places, 133 transitions, 1224 flow [2024-06-03 22:21:23,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1224, PETRI_PLACES=159, PETRI_TRANSITIONS=133} [2024-06-03 22:21:23,695 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 127 predicate places. [2024-06-03 22:21:23,696 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 133 transitions, 1224 flow [2024-06-03 22:21:23,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:23,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:23,696 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-03 22:21:23,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-03 22:21:23,699 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-03 22:21:23,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:23,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1975874800, now seen corresponding path program 7 times [2024-06-03 22:21:23,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:23,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731612142] [2024-06-03 22:21:23,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:23,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:30,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:30,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:30,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731612142] [2024-06-03 22:21:30,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731612142] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:30,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:30,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:21:30,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046782970] [2024-06-03 22:21:30,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:30,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:21:30,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:30,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:21:30,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:21:30,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:21:30,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 133 transitions, 1224 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:30,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:30,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:21:30,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:30,991 INFO L124 PetriNetUnfolderBase]: 299/599 cut-off events. [2024-06-03 22:21:30,991 INFO L125 PetriNetUnfolderBase]: For 15824/15824 co-relation queries the response was YES. [2024-06-03 22:21:30,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3169 conditions, 599 events. 299/599 cut-off events. For 15824/15824 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2976 event pairs, 39 based on Foata normal form. 2/598 useless extension candidates. Maximal degree in co-relation 3096. Up to 454 conditions per place. [2024-06-03 22:21:30,995 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 103 selfloop transitions, 36 changer transitions 0/143 dead transitions. [2024-06-03 22:21:30,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 143 transitions, 1526 flow [2024-06-03 22:21:30,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:21:30,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:21:30,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-03 22:21:30,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40404040404040403 [2024-06-03 22:21:30,997 INFO L175 Difference]: Start difference. First operand has 159 places, 133 transitions, 1224 flow. Second operand 9 states and 120 transitions. [2024-06-03 22:21:30,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 143 transitions, 1526 flow [2024-06-03 22:21:31,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 143 transitions, 1456 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-03 22:21:31,027 INFO L231 Difference]: Finished difference. Result has 163 places, 133 transitions, 1230 flow [2024-06-03 22:21:31,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1154, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1230, PETRI_PLACES=163, PETRI_TRANSITIONS=133} [2024-06-03 22:21:31,027 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 131 predicate places. [2024-06-03 22:21:31,027 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 133 transitions, 1230 flow [2024-06-03 22:21:31,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:31,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:31,028 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-03 22:21:31,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-03 22:21:31,028 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-03 22:21:31,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:31,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1516500566, now seen corresponding path program 2 times [2024-06-03 22:21:31,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:31,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735443106] [2024-06-03 22:21:31,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:31,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:37,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:37,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:37,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735443106] [2024-06-03 22:21:37,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735443106] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:37,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:37,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:21:37,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485669773] [2024-06-03 22:21:37,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:37,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:21:37,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:37,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:21:37,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:21:37,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:21:37,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 133 transitions, 1230 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:37,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:37,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:21:37,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:37,871 INFO L124 PetriNetUnfolderBase]: 302/606 cut-off events. [2024-06-03 22:21:37,872 INFO L125 PetriNetUnfolderBase]: For 15632/15632 co-relation queries the response was YES. [2024-06-03 22:21:37,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3228 conditions, 606 events. 302/606 cut-off events. For 15632/15632 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3019 event pairs, 39 based on Foata normal form. 1/604 useless extension candidates. Maximal degree in co-relation 3154. Up to 416 conditions per place. [2024-06-03 22:21:37,876 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 89 selfloop transitions, 52 changer transitions 0/145 dead transitions. [2024-06-03 22:21:37,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 145 transitions, 1576 flow [2024-06-03 22:21:37,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:21:37,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:21:37,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2024-06-03 22:21:37,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212121212121212 [2024-06-03 22:21:37,888 INFO L175 Difference]: Start difference. First operand has 163 places, 133 transitions, 1230 flow. Second operand 10 states and 139 transitions. [2024-06-03 22:21:37,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 145 transitions, 1576 flow [2024-06-03 22:21:37,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 145 transitions, 1478 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-03 22:21:37,933 INFO L231 Difference]: Finished difference. Result has 163 places, 135 transitions, 1285 flow [2024-06-03 22:21:37,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1285, PETRI_PLACES=163, PETRI_TRANSITIONS=135} [2024-06-03 22:21:37,934 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 131 predicate places. [2024-06-03 22:21:37,934 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 135 transitions, 1285 flow [2024-06-03 22:21:37,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:37,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:37,934 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-03 22:21:37,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-03 22:21:37,934 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-03 22:21:37,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:37,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1805678736, now seen corresponding path program 8 times [2024-06-03 22:21:37,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:37,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746602976] [2024-06-03 22:21:37,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:37,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:44,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:44,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:44,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746602976] [2024-06-03 22:21:44,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746602976] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:44,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:44,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:21:44,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798788315] [2024-06-03 22:21:44,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:44,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:21:44,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:44,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:21:44,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:21:44,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:21:44,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 135 transitions, 1285 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:44,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:44,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:21:44,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:44,777 INFO L124 PetriNetUnfolderBase]: 306/614 cut-off events. [2024-06-03 22:21:44,777 INFO L125 PetriNetUnfolderBase]: For 17454/17454 co-relation queries the response was YES. [2024-06-03 22:21:44,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3278 conditions, 614 events. 306/614 cut-off events. For 17454/17454 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3070 event pairs, 37 based on Foata normal form. 2/613 useless extension candidates. Maximal degree in co-relation 3206. Up to 442 conditions per place. [2024-06-03 22:21:44,781 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 107 selfloop transitions, 37 changer transitions 0/148 dead transitions. [2024-06-03 22:21:44,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 148 transitions, 1702 flow [2024-06-03 22:21:44,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:21:44,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:21:44,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2024-06-03 22:21:44,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-03 22:21:44,783 INFO L175 Difference]: Start difference. First operand has 163 places, 135 transitions, 1285 flow. Second operand 9 states and 126 transitions. [2024-06-03 22:21:44,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 148 transitions, 1702 flow [2024-06-03 22:21:44,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 148 transitions, 1565 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-03 22:21:44,817 INFO L231 Difference]: Finished difference. Result has 164 places, 136 transitions, 1237 flow [2024-06-03 22:21:44,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1237, PETRI_PLACES=164, PETRI_TRANSITIONS=136} [2024-06-03 22:21:44,818 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 132 predicate places. [2024-06-03 22:21:44,818 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 136 transitions, 1237 flow [2024-06-03 22:21:44,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:44,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:44,818 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-03 22:21:44,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-03 22:21:44,819 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-03 22:21:44,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:44,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1805501106, now seen corresponding path program 9 times [2024-06-03 22:21:44,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:44,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115615840] [2024-06-03 22:21:44,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:44,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:51,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:51,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:51,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115615840] [2024-06-03 22:21:51,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115615840] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:51,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:51,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:21:51,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157478101] [2024-06-03 22:21:51,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:51,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:21:51,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:51,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:21:51,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:21:51,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:21:51,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 136 transitions, 1237 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:51,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:51,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:21:51,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:51,478 INFO L124 PetriNetUnfolderBase]: 313/629 cut-off events. [2024-06-03 22:21:51,479 INFO L125 PetriNetUnfolderBase]: For 18149/18149 co-relation queries the response was YES. [2024-06-03 22:21:51,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3309 conditions, 629 events. 313/629 cut-off events. For 18149/18149 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3151 event pairs, 39 based on Foata normal form. 2/628 useless extension candidates. Maximal degree in co-relation 3236. Up to 479 conditions per place. [2024-06-03 22:21:51,483 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 108 selfloop transitions, 37 changer transitions 0/149 dead transitions. [2024-06-03 22:21:51,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 149 transitions, 1586 flow [2024-06-03 22:21:51,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:21:51,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:21:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-03 22:21:51,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-03 22:21:51,486 INFO L175 Difference]: Start difference. First operand has 164 places, 136 transitions, 1237 flow. Second operand 9 states and 123 transitions. [2024-06-03 22:21:51,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 149 transitions, 1586 flow [2024-06-03 22:21:51,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 149 transitions, 1405 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-03 22:21:51,530 INFO L231 Difference]: Finished difference. Result has 163 places, 139 transitions, 1171 flow [2024-06-03 22:21:51,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1171, PETRI_PLACES=163, PETRI_TRANSITIONS=139} [2024-06-03 22:21:51,531 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 131 predicate places. [2024-06-03 22:21:51,531 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 139 transitions, 1171 flow [2024-06-03 22:21:51,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:51,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:51,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-03 22:21:51,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-03 22:21:51,532 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-03 22:21:51,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:51,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1820435466, now seen corresponding path program 10 times [2024-06-03 22:21:51,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:51,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406140557] [2024-06-03 22:21:51,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:51,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:57,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:57,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:57,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406140557] [2024-06-03 22:21:57,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406140557] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:57,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:57,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:21:57,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992480438] [2024-06-03 22:21:57,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:57,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:21:57,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:57,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:21:57,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:21:57,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 22:21:57,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 139 transitions, 1171 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:57,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:57,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 22:21:57,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:58,103 INFO L124 PetriNetUnfolderBase]: 317/637 cut-off events. [2024-06-03 22:21:58,104 INFO L125 PetriNetUnfolderBase]: For 18667/18667 co-relation queries the response was YES. [2024-06-03 22:21:58,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3214 conditions, 637 events. 317/637 cut-off events. For 18667/18667 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3205 event pairs, 39 based on Foata normal form. 2/636 useless extension candidates. Maximal degree in co-relation 3141. Up to 487 conditions per place. [2024-06-03 22:21:58,108 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 106 selfloop transitions, 41 changer transitions 0/151 dead transitions. [2024-06-03 22:21:58,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 151 transitions, 1502 flow [2024-06-03 22:21:58,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:21:58,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:21:58,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-03 22:21:58,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2024-06-03 22:21:58,117 INFO L175 Difference]: Start difference. First operand has 163 places, 139 transitions, 1171 flow. Second operand 10 states and 124 transitions. [2024-06-03 22:21:58,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 151 transitions, 1502 flow [2024-06-03 22:21:58,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 151 transitions, 1426 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-03 22:21:58,161 INFO L231 Difference]: Finished difference. Result has 167 places, 140 transitions, 1194 flow [2024-06-03 22:21:58,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1194, PETRI_PLACES=167, PETRI_TRANSITIONS=140} [2024-06-03 22:21:58,162 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 135 predicate places. [2024-06-03 22:21:58,162 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 140 transitions, 1194 flow [2024-06-03 22:21:58,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:58,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:58,162 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-03 22:21:58,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-03 22:21:58,162 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-03 22:21:58,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:58,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1577599956, now seen corresponding path program 11 times [2024-06-03 22:21:58,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:58,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039185844] [2024-06-03 22:21:58,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:58,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:04,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-03 22:22:04,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:04,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039185844] [2024-06-03 22:22:04,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039185844] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:04,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:04,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:22:04,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256163689] [2024-06-03 22:22:04,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:04,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:22:04,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:04,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:22:04,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:22:04,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:22:04,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 140 transitions, 1194 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:04,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:04,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:22:04,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:05,094 INFO L124 PetriNetUnfolderBase]: 314/630 cut-off events. [2024-06-03 22:22:05,094 INFO L125 PetriNetUnfolderBase]: For 17081/17081 co-relation queries the response was YES. [2024-06-03 22:22:05,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3121 conditions, 630 events. 314/630 cut-off events. For 17081/17081 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3176 event pairs, 38 based on Foata normal form. 2/629 useless extension candidates. Maximal degree in co-relation 3047. Up to 482 conditions per place. [2024-06-03 22:22:05,099 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 110 selfloop transitions, 36 changer transitions 0/150 dead transitions. [2024-06-03 22:22:05,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 150 transitions, 1510 flow [2024-06-03 22:22:05,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:22:05,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:22:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-03 22:22:05,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-03 22:22:05,100 INFO L175 Difference]: Start difference. First operand has 167 places, 140 transitions, 1194 flow. Second operand 9 states and 123 transitions. [2024-06-03 22:22:05,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 150 transitions, 1510 flow [2024-06-03 22:22:05,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 150 transitions, 1403 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-03 22:22:05,139 INFO L231 Difference]: Finished difference. Result has 167 places, 140 transitions, 1163 flow [2024-06-03 22:22:05,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1087, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1163, PETRI_PLACES=167, PETRI_TRANSITIONS=140} [2024-06-03 22:22:05,140 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 135 predicate places. [2024-06-03 22:22:05,140 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 140 transitions, 1163 flow [2024-06-03 22:22:05,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:05,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:05,140 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-03 22:22:05,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-03 22:22:05,141 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-03 22:22:05,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:05,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1828716620, now seen corresponding path program 3 times [2024-06-03 22:22:05,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:05,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408811596] [2024-06-03 22:22:05,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:05,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:13,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-03 22:22:13,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:13,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408811596] [2024-06-03 22:22:13,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408811596] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:13,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:13,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:22:13,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443676830] [2024-06-03 22:22:13,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:13,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:22:13,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:13,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:22:13,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:22:13,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:22:13,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 140 transitions, 1163 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:13,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:13,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:22:13,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:13,543 INFO L124 PetriNetUnfolderBase]: 320/639 cut-off events. [2024-06-03 22:22:13,543 INFO L125 PetriNetUnfolderBase]: For 16633/16633 co-relation queries the response was YES. [2024-06-03 22:22:13,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3161 conditions, 639 events. 320/639 cut-off events. For 16633/16633 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3252 event pairs, 42 based on Foata normal form. 1/636 useless extension candidates. Maximal degree in co-relation 3086. Up to 431 conditions per place. [2024-06-03 22:22:13,548 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 95 selfloop transitions, 56 changer transitions 0/155 dead transitions. [2024-06-03 22:22:13,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 155 transitions, 1547 flow [2024-06-03 22:22:13,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:22:13,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:22:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 151 transitions. [2024-06-03 22:22:13,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41597796143250687 [2024-06-03 22:22:13,549 INFO L175 Difference]: Start difference. First operand has 167 places, 140 transitions, 1163 flow. Second operand 11 states and 151 transitions. [2024-06-03 22:22:13,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 155 transitions, 1547 flow [2024-06-03 22:22:13,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 155 transitions, 1417 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-03 22:22:13,589 INFO L231 Difference]: Finished difference. Result has 168 places, 144 transitions, 1210 flow [2024-06-03 22:22:13,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1210, PETRI_PLACES=168, PETRI_TRANSITIONS=144} [2024-06-03 22:22:13,590 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 136 predicate places. [2024-06-03 22:22:13,590 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 144 transitions, 1210 flow [2024-06-03 22:22:13,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:13,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:13,591 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-03 22:22:13,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-03 22:22:13,591 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-03 22:22:13,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:13,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1829013290, now seen corresponding path program 4 times [2024-06-03 22:22:13,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:13,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82339653] [2024-06-03 22:22:13,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:13,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:19,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-03 22:22:19,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:19,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82339653] [2024-06-03 22:22:19,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82339653] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:19,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:19,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:22:19,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474623971] [2024-06-03 22:22:19,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:19,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:22:19,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:19,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:22:19,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:22:19,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:22:19,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 144 transitions, 1210 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:19,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:19,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:22:19,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:19,978 INFO L124 PetriNetUnfolderBase]: 328/654 cut-off events. [2024-06-03 22:22:19,978 INFO L125 PetriNetUnfolderBase]: For 18962/18962 co-relation queries the response was YES. [2024-06-03 22:22:19,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3359 conditions, 654 events. 328/654 cut-off events. For 18962/18962 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3348 event pairs, 42 based on Foata normal form. 1/651 useless extension candidates. Maximal degree in co-relation 3283. Up to 434 conditions per place. [2024-06-03 22:22:19,983 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 95 selfloop transitions, 61 changer transitions 0/160 dead transitions. [2024-06-03 22:22:19,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 160 transitions, 1746 flow [2024-06-03 22:22:19,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:22:19,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:22:19,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 153 transitions. [2024-06-03 22:22:19,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4214876033057851 [2024-06-03 22:22:19,984 INFO L175 Difference]: Start difference. First operand has 168 places, 144 transitions, 1210 flow. Second operand 11 states and 153 transitions. [2024-06-03 22:22:19,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 160 transitions, 1746 flow [2024-06-03 22:22:20,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 160 transitions, 1597 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-03 22:22:20,026 INFO L231 Difference]: Finished difference. Result has 171 places, 148 transitions, 1288 flow [2024-06-03 22:22:20,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1288, PETRI_PLACES=171, PETRI_TRANSITIONS=148} [2024-06-03 22:22:20,027 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 139 predicate places. [2024-06-03 22:22:20,027 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 148 transitions, 1288 flow [2024-06-03 22:22:20,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:20,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:20,028 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-03 22:22:20,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-03 22:22:20,028 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-03 22:22:20,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:20,028 INFO L85 PathProgramCache]: Analyzing trace with hash -988913878, now seen corresponding path program 5 times [2024-06-03 22:22:20,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:20,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456814149] [2024-06-03 22:22:20,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:20,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:25,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-03 22:22:25,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:25,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456814149] [2024-06-03 22:22:25,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456814149] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:25,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:25,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:22:25,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199374580] [2024-06-03 22:22:25,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:25,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:22:25,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:25,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:22:25,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:22:26,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:22:26,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 148 transitions, 1288 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:26,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:26,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:22:26,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:26,382 INFO L124 PetriNetUnfolderBase]: 336/671 cut-off events. [2024-06-03 22:22:26,383 INFO L125 PetriNetUnfolderBase]: For 21554/21554 co-relation queries the response was YES. [2024-06-03 22:22:26,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3570 conditions, 671 events. 336/671 cut-off events. For 21554/21554 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3463 event pairs, 42 based on Foata normal form. 1/668 useless extension candidates. Maximal degree in co-relation 3493. Up to 428 conditions per place. [2024-06-03 22:22:26,388 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 88 selfloop transitions, 73 changer transitions 0/165 dead transitions. [2024-06-03 22:22:26,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 165 transitions, 1846 flow [2024-06-03 22:22:26,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:22:26,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:22:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 164 transitions. [2024-06-03 22:22:26,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-03 22:22:26,389 INFO L175 Difference]: Start difference. First operand has 171 places, 148 transitions, 1288 flow. Second operand 12 states and 164 transitions. [2024-06-03 22:22:26,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 165 transitions, 1846 flow [2024-06-03 22:22:26,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 165 transitions, 1703 flow, removed 34 selfloop flow, removed 7 redundant places. [2024-06-03 22:22:26,437 INFO L231 Difference]: Finished difference. Result has 176 places, 152 transitions, 1404 flow [2024-06-03 22:22:26,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1404, PETRI_PLACES=176, PETRI_TRANSITIONS=152} [2024-06-03 22:22:26,438 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 144 predicate places. [2024-06-03 22:22:26,438 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 152 transitions, 1404 flow [2024-06-03 22:22:26,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:26,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:26,438 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-03 22:22:26,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-03 22:22:26,438 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-03 22:22:26,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:26,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1569022132, now seen corresponding path program 6 times [2024-06-03 22:22:26,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:26,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480237190] [2024-06-03 22:22:26,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:26,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:32,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:32,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480237190] [2024-06-03 22:22:32,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480237190] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:32,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:32,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:22:32,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332879553] [2024-06-03 22:22:32,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:32,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:22:32,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:32,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:22:32,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:22:33,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:22:33,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 152 transitions, 1404 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:33,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:33,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:22:33,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:33,297 INFO L124 PetriNetUnfolderBase]: 334/668 cut-off events. [2024-06-03 22:22:33,297 INFO L125 PetriNetUnfolderBase]: For 20455/20455 co-relation queries the response was YES. [2024-06-03 22:22:33,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3551 conditions, 668 events. 334/668 cut-off events. For 20455/20455 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3454 event pairs, 42 based on Foata normal form. 1/665 useless extension candidates. Maximal degree in co-relation 3472. Up to 451 conditions per place. [2024-06-03 22:22:33,302 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 109 selfloop transitions, 51 changer transitions 0/164 dead transitions. [2024-06-03 22:22:33,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 164 transitions, 1800 flow [2024-06-03 22:22:33,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:22:33,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:22:33,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-06-03 22:22:33,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-06-03 22:22:33,303 INFO L175 Difference]: Start difference. First operand has 176 places, 152 transitions, 1404 flow. Second operand 10 states and 138 transitions. [2024-06-03 22:22:33,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 164 transitions, 1800 flow [2024-06-03 22:22:33,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 164 transitions, 1654 flow, removed 31 selfloop flow, removed 8 redundant places. [2024-06-03 22:22:33,348 INFO L231 Difference]: Finished difference. Result has 178 places, 154 transitions, 1421 flow [2024-06-03 22:22:33,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1421, PETRI_PLACES=178, PETRI_TRANSITIONS=154} [2024-06-03 22:22:33,349 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 146 predicate places. [2024-06-03 22:22:33,349 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 154 transitions, 1421 flow [2024-06-03 22:22:33,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:33,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:33,349 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-03 22:22:33,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-03 22:22:33,350 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-03 22:22:33,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:33,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1857310462, now seen corresponding path program 7 times [2024-06-03 22:22:33,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:33,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938533171] [2024-06-03 22:22:33,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:33,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:39,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-03 22:22:39,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:39,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938533171] [2024-06-03 22:22:39,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938533171] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:39,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:39,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:22:39,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321074517] [2024-06-03 22:22:39,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:39,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:22:39,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:39,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:22:39,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:22:40,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:22:40,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 154 transitions, 1421 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:40,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:40,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:22:40,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:40,602 INFO L124 PetriNetUnfolderBase]: 332/665 cut-off events. [2024-06-03 22:22:40,602 INFO L125 PetriNetUnfolderBase]: For 19326/19326 co-relation queries the response was YES. [2024-06-03 22:22:40,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3479 conditions, 665 events. 332/665 cut-off events. For 19326/19326 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3451 event pairs, 42 based on Foata normal form. 1/662 useless extension candidates. Maximal degree in co-relation 3398. Up to 451 conditions per place. [2024-06-03 22:22:40,607 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 104 selfloop transitions, 57 changer transitions 0/165 dead transitions. [2024-06-03 22:22:40,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 165 transitions, 1769 flow [2024-06-03 22:22:40,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:22:40,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:22:40,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 150 transitions. [2024-06-03 22:22:40,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4132231404958678 [2024-06-03 22:22:40,608 INFO L175 Difference]: Start difference. First operand has 178 places, 154 transitions, 1421 flow. Second operand 11 states and 150 transitions. [2024-06-03 22:22:40,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 165 transitions, 1769 flow [2024-06-03 22:22:40,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 165 transitions, 1602 flow, removed 34 selfloop flow, removed 8 redundant places. [2024-06-03 22:22:40,651 INFO L231 Difference]: Finished difference. Result has 181 places, 154 transitions, 1373 flow [2024-06-03 22:22:40,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1254, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1373, PETRI_PLACES=181, PETRI_TRANSITIONS=154} [2024-06-03 22:22:40,651 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 149 predicate places. [2024-06-03 22:22:40,651 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 154 transitions, 1373 flow [2024-06-03 22:22:40,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:40,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:40,652 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-03 22:22:40,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-03 22:22:40,652 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-03 22:22:40,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:40,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1767965896, now seen corresponding path program 8 times [2024-06-03 22:22:40,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:40,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674389547] [2024-06-03 22:22:40,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:40,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:46,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:46,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:46,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674389547] [2024-06-03 22:22:46,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674389547] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:46,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:46,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:22:46,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050070874] [2024-06-03 22:22:46,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:46,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:22:46,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:46,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:22:46,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:22:46,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:22:46,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 154 transitions, 1373 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:46,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:46,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:22:46,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:47,224 INFO L124 PetriNetUnfolderBase]: 330/665 cut-off events. [2024-06-03 22:22:47,225 INFO L125 PetriNetUnfolderBase]: For 18139/18139 co-relation queries the response was YES. [2024-06-03 22:22:47,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3366 conditions, 665 events. 330/665 cut-off events. For 18139/18139 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3429 event pairs, 38 based on Foata normal form. 1/663 useless extension candidates. Maximal degree in co-relation 3284. Up to 465 conditions per place. [2024-06-03 22:22:47,230 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 108 selfloop transitions, 54 changer transitions 0/166 dead transitions. [2024-06-03 22:22:47,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 166 transitions, 1833 flow [2024-06-03 22:22:47,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:22:47,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:22:47,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 151 transitions. [2024-06-03 22:22:47,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41597796143250687 [2024-06-03 22:22:47,234 INFO L175 Difference]: Start difference. First operand has 181 places, 154 transitions, 1373 flow. Second operand 11 states and 151 transitions. [2024-06-03 22:22:47,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 166 transitions, 1833 flow [2024-06-03 22:22:47,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 166 transitions, 1689 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-03 22:22:47,277 INFO L231 Difference]: Finished difference. Result has 182 places, 154 transitions, 1342 flow [2024-06-03 22:22:47,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1229, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1342, PETRI_PLACES=182, PETRI_TRANSITIONS=154} [2024-06-03 22:22:47,278 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 150 predicate places. [2024-06-03 22:22:47,278 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 154 transitions, 1342 flow [2024-06-03 22:22:47,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:47,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:47,278 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-03 22:22:47,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-03 22:22:47,278 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-03 22:22:47,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:47,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1459909806, now seen corresponding path program 9 times [2024-06-03 22:22:47,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:47,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79535085] [2024-06-03 22:22:47,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:47,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:53,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:53,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:53,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79535085] [2024-06-03 22:22:53,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79535085] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:53,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:53,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:22:53,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387331381] [2024-06-03 22:22:53,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:53,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:22:53,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:53,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:22:53,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:22:53,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:22:53,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 154 transitions, 1342 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:53,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:53,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:22:53,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:53,654 INFO L124 PetriNetUnfolderBase]: 328/662 cut-off events. [2024-06-03 22:22:53,654 INFO L125 PetriNetUnfolderBase]: For 17271/17271 co-relation queries the response was YES. [2024-06-03 22:22:53,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3260 conditions, 662 events. 328/662 cut-off events. For 17271/17271 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3424 event pairs, 38 based on Foata normal form. 1/660 useless extension candidates. Maximal degree in co-relation 3178. Up to 469 conditions per place. [2024-06-03 22:22:53,659 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 110 selfloop transitions, 51 changer transitions 0/165 dead transitions. [2024-06-03 22:22:53,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 165 transitions, 1690 flow [2024-06-03 22:22:53,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:22:53,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:22:53,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2024-06-03 22:22:53,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40771349862258954 [2024-06-03 22:22:53,660 INFO L175 Difference]: Start difference. First operand has 182 places, 154 transitions, 1342 flow. Second operand 11 states and 148 transitions. [2024-06-03 22:22:53,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 165 transitions, 1690 flow [2024-06-03 22:22:53,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 165 transitions, 1501 flow, removed 29 selfloop flow, removed 10 redundant places. [2024-06-03 22:22:53,697 INFO L231 Difference]: Finished difference. Result has 183 places, 154 transitions, 1260 flow [2024-06-03 22:22:53,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1260, PETRI_PLACES=183, PETRI_TRANSITIONS=154} [2024-06-03 22:22:53,699 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 151 predicate places. [2024-06-03 22:22:53,699 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 154 transitions, 1260 flow [2024-06-03 22:22:53,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:53,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:53,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:22:53,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-03 22:22:53,699 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-03 22:22:53,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:53,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1208260559, now seen corresponding path program 1 times [2024-06-03 22:22:53,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:53,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709615416] [2024-06-03 22:22:53,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:53,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:59,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:59,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709615416] [2024-06-03 22:22:59,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709615416] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:59,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:59,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:22:59,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195012703] [2024-06-03 22:22:59,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:59,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:22:59,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:59,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:22:59,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:23:00,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:23:00,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 154 transitions, 1260 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:00,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:00,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:23:00,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:00,307 INFO L124 PetriNetUnfolderBase]: 332/667 cut-off events. [2024-06-03 22:23:00,308 INFO L125 PetriNetUnfolderBase]: For 19104/19104 co-relation queries the response was YES. [2024-06-03 22:23:00,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3216 conditions, 667 events. 332/667 cut-off events. For 19104/19104 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3469 event pairs, 25 based on Foata normal form. 2/665 useless extension candidates. Maximal degree in co-relation 3133. Up to 535 conditions per place. [2024-06-03 22:23:00,312 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 153 selfloop transitions, 12 changer transitions 0/169 dead transitions. [2024-06-03 22:23:00,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 169 transitions, 1628 flow [2024-06-03 22:23:00,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:23:00,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:23:00,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-03 22:23:00,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3872053872053872 [2024-06-03 22:23:00,313 INFO L175 Difference]: Start difference. First operand has 183 places, 154 transitions, 1260 flow. Second operand 9 states and 115 transitions. [2024-06-03 22:23:00,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 169 transitions, 1628 flow [2024-06-03 22:23:00,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 169 transitions, 1511 flow, removed 1 selfloop flow, removed 11 redundant places. [2024-06-03 22:23:00,354 INFO L231 Difference]: Finished difference. Result has 181 places, 155 transitions, 1179 flow [2024-06-03 22:23:00,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1143, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1179, PETRI_PLACES=181, PETRI_TRANSITIONS=155} [2024-06-03 22:23:00,355 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 149 predicate places. [2024-06-03 22:23:00,355 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 155 transitions, 1179 flow [2024-06-03 22:23:00,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:00,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:00,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:00,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-03 22:23:00,356 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-03 22:23:00,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:00,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1364000587, now seen corresponding path program 2 times [2024-06-03 22:23:00,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:00,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164521925] [2024-06-03 22:23:00,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:00,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:07,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:07,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:07,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164521925] [2024-06-03 22:23:07,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164521925] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:07,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:07,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:23:07,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445742905] [2024-06-03 22:23:07,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:07,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:23:07,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:07,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:23:07,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:23:07,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:23:07,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 155 transitions, 1179 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:07,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:07,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:23:07,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:08,172 INFO L124 PetriNetUnfolderBase]: 373/760 cut-off events. [2024-06-03 22:23:08,172 INFO L125 PetriNetUnfolderBase]: For 44682/44682 co-relation queries the response was YES. [2024-06-03 22:23:08,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4104 conditions, 760 events. 373/760 cut-off events. For 44682/44682 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4050 event pairs, 52 based on Foata normal form. 8/764 useless extension candidates. Maximal degree in co-relation 4020. Up to 472 conditions per place. [2024-06-03 22:23:08,178 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 118 selfloop transitions, 45 changer transitions 7/174 dead transitions. [2024-06-03 22:23:08,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 174 transitions, 1751 flow [2024-06-03 22:23:08,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:23:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:23:08,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2024-06-03 22:23:08,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45791245791245794 [2024-06-03 22:23:08,182 INFO L175 Difference]: Start difference. First operand has 181 places, 155 transitions, 1179 flow. Second operand 9 states and 136 transitions. [2024-06-03 22:23:08,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 174 transitions, 1751 flow [2024-06-03 22:23:08,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 174 transitions, 1725 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-03 22:23:08,243 INFO L231 Difference]: Finished difference. Result has 183 places, 153 transitions, 1230 flow [2024-06-03 22:23:08,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1230, PETRI_PLACES=183, PETRI_TRANSITIONS=153} [2024-06-03 22:23:08,244 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 151 predicate places. [2024-06-03 22:23:08,244 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 153 transitions, 1230 flow [2024-06-03 22:23:08,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:08,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:08,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:08,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-03 22:23:08,245 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-03 22:23:08,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:08,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1363793197, now seen corresponding path program 3 times [2024-06-03 22:23:08,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:08,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184762819] [2024-06-03 22:23:08,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:08,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:14,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:14,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:14,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184762819] [2024-06-03 22:23:14,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184762819] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:14,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:14,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:23:14,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397278159] [2024-06-03 22:23:14,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:14,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:23:14,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:14,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:23:14,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:23:15,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:23:15,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 153 transitions, 1230 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:15,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:15,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:23:15,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:15,361 INFO L124 PetriNetUnfolderBase]: 346/707 cut-off events. [2024-06-03 22:23:15,361 INFO L125 PetriNetUnfolderBase]: For 33287/33287 co-relation queries the response was YES. [2024-06-03 22:23:15,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3619 conditions, 707 events. 346/707 cut-off events. For 33287/33287 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3709 event pairs, 41 based on Foata normal form. 6/709 useless extension candidates. Maximal degree in co-relation 3534. Up to 500 conditions per place. [2024-06-03 22:23:15,367 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 114 selfloop transitions, 49 changer transitions 0/167 dead transitions. [2024-06-03 22:23:15,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 167 transitions, 1640 flow [2024-06-03 22:23:15,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:23:15,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:23:15,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2024-06-03 22:23:15,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-03 22:23:15,368 INFO L175 Difference]: Start difference. First operand has 183 places, 153 transitions, 1230 flow. Second operand 9 states and 132 transitions. [2024-06-03 22:23:15,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 167 transitions, 1640 flow [2024-06-03 22:23:15,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 167 transitions, 1546 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-03 22:23:15,429 INFO L231 Difference]: Finished difference. Result has 181 places, 155 transitions, 1298 flow [2024-06-03 22:23:15,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1298, PETRI_PLACES=181, PETRI_TRANSITIONS=155} [2024-06-03 22:23:15,430 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 149 predicate places. [2024-06-03 22:23:15,430 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 155 transitions, 1298 flow [2024-06-03 22:23:15,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:15,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:15,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:15,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-03 22:23:15,431 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-03 22:23:15,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:15,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1369507117, now seen corresponding path program 4 times [2024-06-03 22:23:15,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:15,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096089707] [2024-06-03 22:23:15,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:15,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:22,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:22,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:22,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096089707] [2024-06-03 22:23:22,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096089707] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:22,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:22,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:23:22,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242188898] [2024-06-03 22:23:22,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:22,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:23:22,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:22,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:23:22,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:23:22,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:23:22,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 155 transitions, 1298 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:22,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:22,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:23:22,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:23,281 INFO L124 PetriNetUnfolderBase]: 362/743 cut-off events. [2024-06-03 22:23:23,282 INFO L125 PetriNetUnfolderBase]: For 34999/34999 co-relation queries the response was YES. [2024-06-03 22:23:23,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3774 conditions, 743 events. 362/743 cut-off events. For 34999/34999 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3967 event pairs, 47 based on Foata normal form. 8/747 useless extension candidates. Maximal degree in co-relation 3690. Up to 462 conditions per place. [2024-06-03 22:23:23,287 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 118 selfloop transitions, 42 changer transitions 10/174 dead transitions. [2024-06-03 22:23:23,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 174 transitions, 1827 flow [2024-06-03 22:23:23,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:23:23,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:23:23,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2024-06-03 22:23:23,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-03 22:23:23,289 INFO L175 Difference]: Start difference. First operand has 181 places, 155 transitions, 1298 flow. Second operand 9 states and 135 transitions. [2024-06-03 22:23:23,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 174 transitions, 1827 flow [2024-06-03 22:23:23,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 174 transitions, 1688 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-03 22:23:23,354 INFO L231 Difference]: Finished difference. Result has 183 places, 153 transitions, 1230 flow [2024-06-03 22:23:23,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1230, PETRI_PLACES=183, PETRI_TRANSITIONS=153} [2024-06-03 22:23:23,356 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 151 predicate places. [2024-06-03 22:23:23,356 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 153 transitions, 1230 flow [2024-06-03 22:23:23,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:23,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:23,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:23,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-03 22:23:23,357 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-03 22:23:23,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:23,357 INFO L85 PathProgramCache]: Analyzing trace with hash 427713653, now seen corresponding path program 5 times [2024-06-03 22:23:23,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:23,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908838203] [2024-06-03 22:23:23,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:23,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:30,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:30,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:30,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908838203] [2024-06-03 22:23:30,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908838203] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:30,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:30,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:23:30,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752145499] [2024-06-03 22:23:30,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:30,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:23:30,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:30,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:23:30,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:23:30,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:23:30,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 153 transitions, 1230 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:30,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:30,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:23:30,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:31,016 INFO L124 PetriNetUnfolderBase]: 360/741 cut-off events. [2024-06-03 22:23:31,017 INFO L125 PetriNetUnfolderBase]: For 35402/35402 co-relation queries the response was YES. [2024-06-03 22:23:31,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3657 conditions, 741 events. 360/741 cut-off events. For 35402/35402 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3962 event pairs, 49 based on Foata normal form. 8/745 useless extension candidates. Maximal degree in co-relation 3572. Up to 420 conditions per place. [2024-06-03 22:23:31,022 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 121 selfloop transitions, 36 changer transitions 13/174 dead transitions. [2024-06-03 22:23:31,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 174 transitions, 1766 flow [2024-06-03 22:23:31,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:23:31,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:23:31,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 129 transitions. [2024-06-03 22:23:31,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43434343434343436 [2024-06-03 22:23:31,025 INFO L175 Difference]: Start difference. First operand has 183 places, 153 transitions, 1230 flow. Second operand 9 states and 129 transitions. [2024-06-03 22:23:31,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 174 transitions, 1766 flow [2024-06-03 22:23:31,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 174 transitions, 1672 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-03 22:23:31,077 INFO L231 Difference]: Finished difference. Result has 182 places, 151 transitions, 1204 flow [2024-06-03 22:23:31,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1204, PETRI_PLACES=182, PETRI_TRANSITIONS=151} [2024-06-03 22:23:31,078 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 150 predicate places. [2024-06-03 22:23:31,078 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 151 transitions, 1204 flow [2024-06-03 22:23:31,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:31,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:31,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:31,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-03 22:23:31,079 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-03 22:23:31,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:31,079 INFO L85 PathProgramCache]: Analyzing trace with hash -480288197, now seen corresponding path program 6 times [2024-06-03 22:23:31,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:31,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780339531] [2024-06-03 22:23:31,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:31,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:36,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:36,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:36,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780339531] [2024-06-03 22:23:36,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780339531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:36,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:36,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:23:36,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297715802] [2024-06-03 22:23:36,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:36,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:23:36,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:36,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:23:36,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:23:36,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 22:23:36,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 151 transitions, 1204 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:36,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:36,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 22:23:36,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:36,634 INFO L124 PetriNetUnfolderBase]: 341/703 cut-off events. [2024-06-03 22:23:36,635 INFO L125 PetriNetUnfolderBase]: For 25559/25559 co-relation queries the response was YES. [2024-06-03 22:23:36,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3518 conditions, 703 events. 341/703 cut-off events. For 25559/25559 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3676 event pairs, 46 based on Foata normal form. 2/702 useless extension candidates. Maximal degree in co-relation 3433. Up to 500 conditions per place. [2024-06-03 22:23:36,639 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 109 selfloop transitions, 52 changer transitions 0/165 dead transitions. [2024-06-03 22:23:36,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 165 transitions, 1578 flow [2024-06-03 22:23:36,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:23:36,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:23:36,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 147 transitions. [2024-06-03 22:23:36,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44545454545454544 [2024-06-03 22:23:36,640 INFO L175 Difference]: Start difference. First operand has 182 places, 151 transitions, 1204 flow. Second operand 10 states and 147 transitions. [2024-06-03 22:23:36,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 165 transitions, 1578 flow [2024-06-03 22:23:36,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 165 transitions, 1498 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-03 22:23:36,688 INFO L231 Difference]: Finished difference. Result has 179 places, 154 transitions, 1260 flow [2024-06-03 22:23:36,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1260, PETRI_PLACES=179, PETRI_TRANSITIONS=154} [2024-06-03 22:23:36,688 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 147 predicate places. [2024-06-03 22:23:36,688 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 154 transitions, 1260 flow [2024-06-03 22:23:36,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:36,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:36,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:36,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-03 22:23:36,689 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-03 22:23:36,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:36,689 INFO L85 PathProgramCache]: Analyzing trace with hash -736788707, now seen corresponding path program 7 times [2024-06-03 22:23:36,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:36,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045067294] [2024-06-03 22:23:36,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:36,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:44,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-03 22:23:44,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:44,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045067294] [2024-06-03 22:23:44,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045067294] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:44,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:44,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:23:44,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213475214] [2024-06-03 22:23:44,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:44,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:23:44,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:44,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:23:44,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:23:44,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:23:44,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 154 transitions, 1260 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:44,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:44,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:23:44,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:44,973 INFO L124 PetriNetUnfolderBase]: 340/696 cut-off events. [2024-06-03 22:23:44,974 INFO L125 PetriNetUnfolderBase]: For 18648/18648 co-relation queries the response was YES. [2024-06-03 22:23:44,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3336 conditions, 696 events. 340/696 cut-off events. For 18648/18648 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3675 event pairs, 40 based on Foata normal form. 2/695 useless extension candidates. Maximal degree in co-relation 3254. Up to 492 conditions per place. [2024-06-03 22:23:44,979 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 112 selfloop transitions, 52 changer transitions 0/168 dead transitions. [2024-06-03 22:23:44,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 168 transitions, 1646 flow [2024-06-03 22:23:44,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:23:44,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:23:44,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-03 22:23:44,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2024-06-03 22:23:44,980 INFO L175 Difference]: Start difference. First operand has 179 places, 154 transitions, 1260 flow. Second operand 10 states and 137 transitions. [2024-06-03 22:23:44,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 168 transitions, 1646 flow [2024-06-03 22:23:45,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 168 transitions, 1534 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-03 22:23:45,020 INFO L231 Difference]: Finished difference. Result has 182 places, 157 transitions, 1290 flow [2024-06-03 22:23:45,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1152, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1290, PETRI_PLACES=182, PETRI_TRANSITIONS=157} [2024-06-03 22:23:45,020 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 150 predicate places. [2024-06-03 22:23:45,020 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 157 transitions, 1290 flow [2024-06-03 22:23:45,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:45,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:45,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:45,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-03 22:23:45,021 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-03 22:23:45,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:45,021 INFO L85 PathProgramCache]: Analyzing trace with hash -736996097, now seen corresponding path program 8 times [2024-06-03 22:23:45,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:45,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601790037] [2024-06-03 22:23:45,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:45,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:51,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:51,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:51,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601790037] [2024-06-03 22:23:51,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601790037] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:51,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:51,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:23:51,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416831532] [2024-06-03 22:23:51,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:51,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:23:51,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:51,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:23:51,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:23:51,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:23:51,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 157 transitions, 1290 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:51,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:51,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:23:51,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:51,727 INFO L124 PetriNetUnfolderBase]: 344/704 cut-off events. [2024-06-03 22:23:51,727 INFO L125 PetriNetUnfolderBase]: For 19327/19327 co-relation queries the response was YES. [2024-06-03 22:23:51,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3381 conditions, 704 events. 344/704 cut-off events. For 19327/19327 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3742 event pairs, 40 based on Foata normal form. 2/703 useless extension candidates. Maximal degree in co-relation 3298. Up to 480 conditions per place. [2024-06-03 22:23:51,732 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 112 selfloop transitions, 54 changer transitions 0/170 dead transitions. [2024-06-03 22:23:51,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 170 transitions, 1662 flow [2024-06-03 22:23:51,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:23:51,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:23:51,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-06-03 22:23:51,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-06-03 22:23:51,733 INFO L175 Difference]: Start difference. First operand has 182 places, 157 transitions, 1290 flow. Second operand 10 states and 138 transitions. [2024-06-03 22:23:51,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 170 transitions, 1662 flow [2024-06-03 22:23:51,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 170 transitions, 1565 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-03 22:23:51,771 INFO L231 Difference]: Finished difference. Result has 186 places, 158 transitions, 1319 flow [2024-06-03 22:23:51,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1193, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1319, PETRI_PLACES=186, PETRI_TRANSITIONS=158} [2024-06-03 22:23:51,772 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 154 predicate places. [2024-06-03 22:23:51,772 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 158 transitions, 1319 flow [2024-06-03 22:23:51,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:51,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:51,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:51,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-03 22:23:51,773 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-03 22:23:51,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:51,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1389351917, now seen corresponding path program 9 times [2024-06-03 22:23:51,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:51,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535300572] [2024-06-03 22:23:51,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:51,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:57,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:57,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:57,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535300572] [2024-06-03 22:23:57,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535300572] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:57,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:57,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:23:57,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96034329] [2024-06-03 22:23:57,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:57,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:23:57,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:57,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:23:57,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:23:58,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:23:58,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 158 transitions, 1319 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:58,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:58,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:23:58,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:58,550 INFO L124 PetriNetUnfolderBase]: 362/738 cut-off events. [2024-06-03 22:23:58,550 INFO L125 PetriNetUnfolderBase]: For 23452/23452 co-relation queries the response was YES. [2024-06-03 22:23:58,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3678 conditions, 738 events. 362/738 cut-off events. For 23452/23452 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3960 event pairs, 43 based on Foata normal form. 2/737 useless extension candidates. Maximal degree in co-relation 3594. Up to 498 conditions per place. [2024-06-03 22:23:58,557 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 119 selfloop transitions, 54 changer transitions 0/177 dead transitions. [2024-06-03 22:23:58,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 177 transitions, 1866 flow [2024-06-03 22:23:58,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:23:58,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:23:58,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-06-03 22:23:58,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-06-03 22:23:58,559 INFO L175 Difference]: Start difference. First operand has 186 places, 158 transitions, 1319 flow. Second operand 10 states and 138 transitions. [2024-06-03 22:23:58,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 177 transitions, 1866 flow [2024-06-03 22:23:58,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 177 transitions, 1746 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-03 22:23:58,618 INFO L231 Difference]: Finished difference. Result has 189 places, 163 transitions, 1372 flow [2024-06-03 22:23:58,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1203, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1372, PETRI_PLACES=189, PETRI_TRANSITIONS=163} [2024-06-03 22:23:58,619 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 157 predicate places. [2024-06-03 22:23:58,619 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 163 transitions, 1372 flow [2024-06-03 22:23:58,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:58,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:58,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:58,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-03 22:23:58,619 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-03 22:23:58,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:58,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1383637997, now seen corresponding path program 10 times [2024-06-03 22:23:58,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:58,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700415797] [2024-06-03 22:23:58,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:58,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:05,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:05,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:05,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700415797] [2024-06-03 22:24:05,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700415797] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:05,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:05,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:24:05,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766492915] [2024-06-03 22:24:05,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:05,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:24:05,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:05,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:24:05,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:24:05,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:24:05,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 163 transitions, 1372 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:05,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:05,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:24:05,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:05,471 INFO L124 PetriNetUnfolderBase]: 366/746 cut-off events. [2024-06-03 22:24:05,471 INFO L125 PetriNetUnfolderBase]: For 24359/24359 co-relation queries the response was YES. [2024-06-03 22:24:05,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3742 conditions, 746 events. 366/746 cut-off events. For 24359/24359 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4017 event pairs, 49 based on Foata normal form. 2/745 useless extension candidates. Maximal degree in co-relation 3656. Up to 541 conditions per place. [2024-06-03 22:24:05,477 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 118 selfloop transitions, 53 changer transitions 0/175 dead transitions. [2024-06-03 22:24:05,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 175 transitions, 1756 flow [2024-06-03 22:24:05,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:05,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:05,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-03 22:24:05,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2024-06-03 22:24:05,478 INFO L175 Difference]: Start difference. First operand has 189 places, 163 transitions, 1372 flow. Second operand 10 states and 133 transitions. [2024-06-03 22:24:05,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 175 transitions, 1756 flow [2024-06-03 22:24:05,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 175 transitions, 1707 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-03 22:24:05,540 INFO L231 Difference]: Finished difference. Result has 195 places, 164 transitions, 1451 flow [2024-06-03 22:24:05,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1325, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1451, PETRI_PLACES=195, PETRI_TRANSITIONS=164} [2024-06-03 22:24:05,541 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 163 predicate places. [2024-06-03 22:24:05,541 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 164 transitions, 1451 flow [2024-06-03 22:24:05,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:05,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:05,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:05,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-03 22:24:05,542 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-03 22:24:05,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:05,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1492210003, now seen corresponding path program 11 times [2024-06-03 22:24:05,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:05,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567331853] [2024-06-03 22:24:05,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:05,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:12,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-03 22:24:12,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:12,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567331853] [2024-06-03 22:24:12,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567331853] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:12,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:12,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:24:12,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901774711] [2024-06-03 22:24:12,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:12,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:24:12,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:12,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:24:12,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:24:12,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:24:12,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 164 transitions, 1451 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:12,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:12,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:24:12,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:12,462 INFO L124 PetriNetUnfolderBase]: 377/767 cut-off events. [2024-06-03 22:24:12,462 INFO L125 PetriNetUnfolderBase]: For 28808/28808 co-relation queries the response was YES. [2024-06-03 22:24:12,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4059 conditions, 767 events. 377/767 cut-off events. For 28808/28808 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4141 event pairs, 50 based on Foata normal form. 2/766 useless extension candidates. Maximal degree in co-relation 3972. Up to 545 conditions per place. [2024-06-03 22:24:12,467 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 121 selfloop transitions, 54 changer transitions 0/179 dead transitions. [2024-06-03 22:24:12,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 179 transitions, 1981 flow [2024-06-03 22:24:12,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:12,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:12,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 140 transitions. [2024-06-03 22:24:12,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-03 22:24:12,470 INFO L175 Difference]: Start difference. First operand has 195 places, 164 transitions, 1451 flow. Second operand 10 states and 140 transitions. [2024-06-03 22:24:12,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 179 transitions, 1981 flow [2024-06-03 22:24:12,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 179 transitions, 1863 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-03 22:24:12,523 INFO L231 Difference]: Finished difference. Result has 197 places, 166 transitions, 1479 flow [2024-06-03 22:24:12,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1333, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1479, PETRI_PLACES=197, PETRI_TRANSITIONS=166} [2024-06-03 22:24:12,525 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 165 predicate places. [2024-06-03 22:24:12,525 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 166 transitions, 1479 flow [2024-06-03 22:24:12,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:12,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:12,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:12,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-03 22:24:12,526 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-03 22:24:12,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:12,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1492417393, now seen corresponding path program 12 times [2024-06-03 22:24:12,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:12,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804910021] [2024-06-03 22:24:12,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:12,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:18,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:18,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:18,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804910021] [2024-06-03 22:24:18,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804910021] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:18,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:18,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:24:18,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511895444] [2024-06-03 22:24:18,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:18,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:24:18,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:18,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:24:18,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:24:18,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:24:18,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 166 transitions, 1479 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:18,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:18,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:24:18,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:19,189 INFO L124 PetriNetUnfolderBase]: 374/762 cut-off events. [2024-06-03 22:24:19,190 INFO L125 PetriNetUnfolderBase]: For 26213/26213 co-relation queries the response was YES. [2024-06-03 22:24:19,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3924 conditions, 762 events. 374/762 cut-off events. For 26213/26213 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4135 event pairs, 51 based on Foata normal form. 2/761 useless extension candidates. Maximal degree in co-relation 3836. Up to 557 conditions per place. [2024-06-03 22:24:19,195 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 120 selfloop transitions, 53 changer transitions 0/177 dead transitions. [2024-06-03 22:24:19,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 177 transitions, 1851 flow [2024-06-03 22:24:19,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:19,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:19,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-03 22:24:19,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2024-06-03 22:24:19,196 INFO L175 Difference]: Start difference. First operand has 197 places, 166 transitions, 1479 flow. Second operand 10 states and 137 transitions. [2024-06-03 22:24:19,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 177 transitions, 1851 flow [2024-06-03 22:24:19,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 177 transitions, 1744 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-03 22:24:19,258 INFO L231 Difference]: Finished difference. Result has 201 places, 166 transitions, 1482 flow [2024-06-03 22:24:19,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1372, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1482, PETRI_PLACES=201, PETRI_TRANSITIONS=166} [2024-06-03 22:24:19,258 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 169 predicate places. [2024-06-03 22:24:19,258 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 166 transitions, 1482 flow [2024-06-03 22:24:19,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:19,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:19,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:19,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-03 22:24:19,259 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-03 22:24:19,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:19,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1486703473, now seen corresponding path program 13 times [2024-06-03 22:24:19,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:19,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824936561] [2024-06-03 22:24:19,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:19,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:25,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:25,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:25,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824936561] [2024-06-03 22:24:25,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824936561] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:25,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:25,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:24:25,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584665324] [2024-06-03 22:24:25,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:25,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:24:25,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:25,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:24:25,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:24:25,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:24:25,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 166 transitions, 1482 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:25,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:25,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:24:25,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:25,962 INFO L124 PetriNetUnfolderBase]: 378/770 cut-off events. [2024-06-03 22:24:25,963 INFO L125 PetriNetUnfolderBase]: For 26873/26873 co-relation queries the response was YES. [2024-06-03 22:24:25,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4006 conditions, 770 events. 378/770 cut-off events. For 26873/26873 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4194 event pairs, 49 based on Foata normal form. 2/769 useless extension candidates. Maximal degree in co-relation 3916. Up to 503 conditions per place. [2024-06-03 22:24:25,968 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 118 selfloop transitions, 58 changer transitions 0/180 dead transitions. [2024-06-03 22:24:25,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 180 transitions, 1882 flow [2024-06-03 22:24:25,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:25,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:25,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2024-06-03 22:24:25,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212121212121212 [2024-06-03 22:24:25,969 INFO L175 Difference]: Start difference. First operand has 201 places, 166 transitions, 1482 flow. Second operand 10 states and 139 transitions. [2024-06-03 22:24:25,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 180 transitions, 1882 flow [2024-06-03 22:24:26,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 180 transitions, 1760 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-03 22:24:26,028 INFO L231 Difference]: Finished difference. Result has 201 places, 167 transitions, 1500 flow [2024-06-03 22:24:26,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1360, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1500, PETRI_PLACES=201, PETRI_TRANSITIONS=167} [2024-06-03 22:24:26,028 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 169 predicate places. [2024-06-03 22:24:26,029 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 167 transitions, 1500 flow [2024-06-03 22:24:26,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:26,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:26,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:26,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-03 22:24:26,029 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-03 22:24:26,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:26,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1058249163, now seen corresponding path program 14 times [2024-06-03 22:24:26,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:26,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234528939] [2024-06-03 22:24:26,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:26,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:31,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:31,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:31,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234528939] [2024-06-03 22:24:31,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234528939] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:31,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:31,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:24:31,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268489324] [2024-06-03 22:24:31,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:31,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:24:31,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:31,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:24:31,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:24:32,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:24:32,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 167 transitions, 1500 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:32,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:32,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:24:32,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:32,371 INFO L124 PetriNetUnfolderBase]: 375/765 cut-off events. [2024-06-03 22:24:32,371 INFO L125 PetriNetUnfolderBase]: For 24015/24015 co-relation queries the response was YES. [2024-06-03 22:24:32,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3897 conditions, 765 events. 375/765 cut-off events. For 24015/24015 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4176 event pairs, 50 based on Foata normal form. 2/764 useless extension candidates. Maximal degree in co-relation 3806. Up to 546 conditions per place. [2024-06-03 22:24:32,377 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 121 selfloop transitions, 54 changer transitions 0/179 dead transitions. [2024-06-03 22:24:32,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 179 transitions, 1878 flow [2024-06-03 22:24:32,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:32,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:32,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2024-06-03 22:24:32,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-03 22:24:32,379 INFO L175 Difference]: Start difference. First operand has 201 places, 167 transitions, 1500 flow. Second operand 10 states and 135 transitions. [2024-06-03 22:24:32,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 179 transitions, 1878 flow [2024-06-03 22:24:32,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 179 transitions, 1732 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-03 22:24:32,423 INFO L231 Difference]: Finished difference. Result has 202 places, 167 transitions, 1466 flow [2024-06-03 22:24:32,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1466, PETRI_PLACES=202, PETRI_TRANSITIONS=167} [2024-06-03 22:24:32,424 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 170 predicate places. [2024-06-03 22:24:32,424 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 167 transitions, 1466 flow [2024-06-03 22:24:32,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:32,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:32,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:32,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-03 22:24:32,424 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-03 22:24:32,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:32,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1205858763, now seen corresponding path program 15 times [2024-06-03 22:24:32,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:32,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860609961] [2024-06-03 22:24:32,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:32,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:38,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:38,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:38,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860609961] [2024-06-03 22:24:38,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860609961] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:38,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:38,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:24:38,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611736479] [2024-06-03 22:24:38,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:38,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:24:38,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:38,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:24:38,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:24:38,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:24:38,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 167 transitions, 1466 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:38,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:38,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:24:38,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:39,126 INFO L124 PetriNetUnfolderBase]: 379/773 cut-off events. [2024-06-03 22:24:39,126 INFO L125 PetriNetUnfolderBase]: For 24665/24665 co-relation queries the response was YES. [2024-06-03 22:24:39,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3889 conditions, 773 events. 379/773 cut-off events. For 24665/24665 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4224 event pairs, 48 based on Foata normal form. 2/772 useless extension candidates. Maximal degree in co-relation 3798. Up to 359 conditions per place. [2024-06-03 22:24:39,132 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 118 selfloop transitions, 62 changer transitions 0/184 dead transitions. [2024-06-03 22:24:39,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 184 transitions, 2026 flow [2024-06-03 22:24:39,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:39,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-03 22:24:39,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2024-06-03 22:24:39,133 INFO L175 Difference]: Start difference. First operand has 202 places, 167 transitions, 1466 flow. Second operand 10 states and 137 transitions. [2024-06-03 22:24:39,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 184 transitions, 2026 flow [2024-06-03 22:24:39,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 184 transitions, 1912 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-03 22:24:39,184 INFO L231 Difference]: Finished difference. Result has 203 places, 169 transitions, 1522 flow [2024-06-03 22:24:39,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1352, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1522, PETRI_PLACES=203, PETRI_TRANSITIONS=169} [2024-06-03 22:24:39,185 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 171 predicate places. [2024-06-03 22:24:39,185 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 169 transitions, 1522 flow [2024-06-03 22:24:39,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:39,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:39,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:39,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-03 22:24:39,185 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-03 22:24:39,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:39,186 INFO L85 PathProgramCache]: Analyzing trace with hash 233450097, now seen corresponding path program 1 times [2024-06-03 22:24:39,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:39,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877057501] [2024-06-03 22:24:39,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:39,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:46,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:46,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:46,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877057501] [2024-06-03 22:24:46,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877057501] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:46,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:46,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:24:46,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290000625] [2024-06-03 22:24:46,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:46,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:24:46,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:46,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:24:46,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:24:46,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:24:46,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 169 transitions, 1522 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:46,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:46,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:24:46,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:46,579 INFO L124 PetriNetUnfolderBase]: 413/846 cut-off events. [2024-06-03 22:24:46,579 INFO L125 PetriNetUnfolderBase]: For 50023/50023 co-relation queries the response was YES. [2024-06-03 22:24:46,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4817 conditions, 846 events. 413/846 cut-off events. For 50023/50023 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4705 event pairs, 68 based on Foata normal form. 6/848 useless extension candidates. Maximal degree in co-relation 4725. Up to 493 conditions per place. [2024-06-03 22:24:46,586 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 112 selfloop transitions, 68 changer transitions 5/189 dead transitions. [2024-06-03 22:24:46,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 189 transitions, 2146 flow [2024-06-03 22:24:46,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:24:46,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:24:46,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 156 transitions. [2024-06-03 22:24:46,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4297520661157025 [2024-06-03 22:24:46,587 INFO L175 Difference]: Start difference. First operand has 203 places, 169 transitions, 1522 flow. Second operand 11 states and 156 transitions. [2024-06-03 22:24:46,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 189 transitions, 2146 flow [2024-06-03 22:24:46,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 189 transitions, 2056 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-03 22:24:46,679 INFO L231 Difference]: Finished difference. Result has 208 places, 168 transitions, 1565 flow [2024-06-03 22:24:46,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1432, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1565, PETRI_PLACES=208, PETRI_TRANSITIONS=168} [2024-06-03 22:24:46,680 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 176 predicate places. [2024-06-03 22:24:46,680 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 168 transitions, 1565 flow [2024-06-03 22:24:46,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:46,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:46,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:46,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-03 22:24:46,681 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-03 22:24:46,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:46,681 INFO L85 PathProgramCache]: Analyzing trace with hash 233123667, now seen corresponding path program 2 times [2024-06-03 22:24:46,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:46,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884709618] [2024-06-03 22:24:46,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:46,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:52,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:52,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884709618] [2024-06-03 22:24:52,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884709618] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:52,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:52,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:24:52,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916301303] [2024-06-03 22:24:52,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:52,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:24:52,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:52,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:24:52,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:24:52,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:24:52,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 168 transitions, 1565 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:52,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:52,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:24:52,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:53,159 INFO L124 PetriNetUnfolderBase]: 413/846 cut-off events. [2024-06-03 22:24:53,159 INFO L125 PetriNetUnfolderBase]: For 55397/55397 co-relation queries the response was YES. [2024-06-03 22:24:53,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4932 conditions, 846 events. 413/846 cut-off events. For 55397/55397 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4691 event pairs, 74 based on Foata normal form. 8/850 useless extension candidates. Maximal degree in co-relation 4838. Up to 575 conditions per place. [2024-06-03 22:24:53,166 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 105 selfloop transitions, 65 changer transitions 9/183 dead transitions. [2024-06-03 22:24:53,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 183 transitions, 2007 flow [2024-06-03 22:24:53,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:24:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:24:53,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 153 transitions. [2024-06-03 22:24:53,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4214876033057851 [2024-06-03 22:24:53,167 INFO L175 Difference]: Start difference. First operand has 208 places, 168 transitions, 1565 flow. Second operand 11 states and 153 transitions. [2024-06-03 22:24:53,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 183 transitions, 2007 flow [2024-06-03 22:24:53,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 183 transitions, 1869 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-03 22:24:53,258 INFO L231 Difference]: Finished difference. Result has 208 places, 165 transitions, 1537 flow [2024-06-03 22:24:53,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1427, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1537, PETRI_PLACES=208, PETRI_TRANSITIONS=165} [2024-06-03 22:24:53,259 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 176 predicate places. [2024-06-03 22:24:53,259 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 165 transitions, 1537 flow [2024-06-03 22:24:53,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:53,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:53,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:53,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-03 22:24:53,260 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-03 22:24:53,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:53,260 INFO L85 PathProgramCache]: Analyzing trace with hash -101669327, now seen corresponding path program 3 times [2024-06-03 22:24:53,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:53,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049182358] [2024-06-03 22:24:53,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:53,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:59,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-03 22:24:59,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:59,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049182358] [2024-06-03 22:24:59,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049182358] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:59,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:59,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:24:59,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112196167] [2024-06-03 22:24:59,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:59,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:24:59,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:59,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:24:59,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:25:00,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:25:00,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 165 transitions, 1537 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:00,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:00,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:25:00,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:00,446 INFO L124 PetriNetUnfolderBase]: 385/789 cut-off events. [2024-06-03 22:25:00,446 INFO L125 PetriNetUnfolderBase]: For 38922/38922 co-relation queries the response was YES. [2024-06-03 22:25:00,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4135 conditions, 789 events. 385/789 cut-off events. For 38922/38922 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4334 event pairs, 56 based on Foata normal form. 8/794 useless extension candidates. Maximal degree in co-relation 4041. Up to 561 conditions per place. [2024-06-03 22:25:00,451 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 115 selfloop transitions, 54 changer transitions 9/182 dead transitions. [2024-06-03 22:25:00,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 182 transitions, 1995 flow [2024-06-03 22:25:00,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:25:00,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:25:00,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 150 transitions. [2024-06-03 22:25:00,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4132231404958678 [2024-06-03 22:25:00,453 INFO L175 Difference]: Start difference. First operand has 208 places, 165 transitions, 1537 flow. Second operand 11 states and 150 transitions. [2024-06-03 22:25:00,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 182 transitions, 1995 flow [2024-06-03 22:25:00,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 182 transitions, 1849 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-03 22:25:00,504 INFO L231 Difference]: Finished difference. Result has 207 places, 164 transitions, 1500 flow [2024-06-03 22:25:00,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1399, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1500, PETRI_PLACES=207, PETRI_TRANSITIONS=164} [2024-06-03 22:25:00,505 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 175 predicate places. [2024-06-03 22:25:00,505 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 164 transitions, 1500 flow [2024-06-03 22:25:00,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:00,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:00,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:00,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-03 22:25:00,505 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-03 22:25:00,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:00,506 INFO L85 PathProgramCache]: Analyzing trace with hash -358169837, now seen corresponding path program 4 times [2024-06-03 22:25:00,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:00,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254624365] [2024-06-03 22:25:00,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:00,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:07,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:07,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:07,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254624365] [2024-06-03 22:25:07,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254624365] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:07,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:07,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:25:07,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888311713] [2024-06-03 22:25:07,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:07,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:25:07,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:07,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:25:07,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:25:07,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:25:07,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 164 transitions, 1500 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:07,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:07,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:25:07,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:08,186 INFO L124 PetriNetUnfolderBase]: 383/787 cut-off events. [2024-06-03 22:25:08,187 INFO L125 PetriNetUnfolderBase]: For 37548/37548 co-relation queries the response was YES. [2024-06-03 22:25:08,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4068 conditions, 787 events. 383/787 cut-off events. For 37548/37548 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4338 event pairs, 56 based on Foata normal form. 8/792 useless extension candidates. Maximal degree in co-relation 3974. Up to 549 conditions per place. [2024-06-03 22:25:08,192 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 115 selfloop transitions, 49 changer transitions 13/181 dead transitions. [2024-06-03 22:25:08,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 181 transitions, 1952 flow [2024-06-03 22:25:08,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:25:08,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:25:08,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 150 transitions. [2024-06-03 22:25:08,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4132231404958678 [2024-06-03 22:25:08,194 INFO L175 Difference]: Start difference. First operand has 207 places, 164 transitions, 1500 flow. Second operand 11 states and 150 transitions. [2024-06-03 22:25:08,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 181 transitions, 1952 flow [2024-06-03 22:25:08,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 181 transitions, 1834 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-03 22:25:08,253 INFO L231 Difference]: Finished difference. Result has 207 places, 160 transitions, 1452 flow [2024-06-03 22:25:08,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1386, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1452, PETRI_PLACES=207, PETRI_TRANSITIONS=160} [2024-06-03 22:25:08,254 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 175 predicate places. [2024-06-03 22:25:08,254 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 160 transitions, 1452 flow [2024-06-03 22:25:08,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:08,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:08,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:08,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-03 22:25:08,254 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-03 22:25:08,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:08,255 INFO L85 PathProgramCache]: Analyzing trace with hash 788218171, now seen corresponding path program 5 times [2024-06-03 22:25:08,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:08,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516044848] [2024-06-03 22:25:08,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:08,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:15,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:15,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516044848] [2024-06-03 22:25:15,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516044848] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:15,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:15,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:25:15,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876474488] [2024-06-03 22:25:15,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:15,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:25:15,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:15,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:25:15,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:25:15,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:25:15,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 160 transitions, 1452 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:15,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:15,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:25:15,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:15,655 INFO L124 PetriNetUnfolderBase]: 374/769 cut-off events. [2024-06-03 22:25:15,655 INFO L125 PetriNetUnfolderBase]: For 37796/37796 co-relation queries the response was YES. [2024-06-03 22:25:15,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3979 conditions, 769 events. 374/769 cut-off events. For 37796/37796 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4220 event pairs, 60 based on Foata normal form. 8/773 useless extension candidates. Maximal degree in co-relation 3885. Up to 523 conditions per place. [2024-06-03 22:25:15,661 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 113 selfloop transitions, 51 changer transitions 9/177 dead transitions. [2024-06-03 22:25:15,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 177 transitions, 1896 flow [2024-06-03 22:25:15,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:25:15,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:25:15,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2024-06-03 22:25:15,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41046831955922863 [2024-06-03 22:25:15,663 INFO L175 Difference]: Start difference. First operand has 207 places, 160 transitions, 1452 flow. Second operand 11 states and 149 transitions. [2024-06-03 22:25:15,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 177 transitions, 1896 flow [2024-06-03 22:25:15,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 177 transitions, 1782 flow, removed 8 selfloop flow, removed 10 redundant places. [2024-06-03 22:25:15,714 INFO L231 Difference]: Finished difference. Result has 204 places, 159 transitions, 1437 flow [2024-06-03 22:25:15,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1342, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1437, PETRI_PLACES=204, PETRI_TRANSITIONS=159} [2024-06-03 22:25:15,715 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 172 predicate places. [2024-06-03 22:25:15,715 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 159 transitions, 1437 flow [2024-06-03 22:25:15,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:15,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:15,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:15,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-03 22:25:15,715 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-03 22:25:15,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:15,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1762240995, now seen corresponding path program 6 times [2024-06-03 22:25:15,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:15,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335176279] [2024-06-03 22:25:15,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:15,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:21,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:21,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:21,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335176279] [2024-06-03 22:25:21,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335176279] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:21,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:21,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:25:21,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889404101] [2024-06-03 22:25:21,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:21,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:25:21,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:21,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:25:21,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:25:21,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:25:21,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 159 transitions, 1437 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:21,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:21,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:25:21,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:22,229 INFO L124 PetriNetUnfolderBase]: 369/769 cut-off events. [2024-06-03 22:25:22,229 INFO L125 PetriNetUnfolderBase]: For 36589/36589 co-relation queries the response was YES. [2024-06-03 22:25:22,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3920 conditions, 769 events. 369/769 cut-off events. For 36589/36589 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4234 event pairs, 58 based on Foata normal form. 8/774 useless extension candidates. Maximal degree in co-relation 3827. Up to 540 conditions per place. [2024-06-03 22:25:22,236 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 114 selfloop transitions, 47 changer transitions 9/174 dead transitions. [2024-06-03 22:25:22,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 174 transitions, 1857 flow [2024-06-03 22:25:22,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:25:22,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:25:22,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-03 22:25:22,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022038567493113 [2024-06-03 22:25:22,237 INFO L175 Difference]: Start difference. First operand has 204 places, 159 transitions, 1437 flow. Second operand 11 states and 146 transitions. [2024-06-03 22:25:22,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 174 transitions, 1857 flow [2024-06-03 22:25:22,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 174 transitions, 1749 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-03 22:25:22,298 INFO L231 Difference]: Finished difference. Result has 203 places, 156 transitions, 1399 flow [2024-06-03 22:25:22,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1329, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1399, PETRI_PLACES=203, PETRI_TRANSITIONS=156} [2024-06-03 22:25:22,298 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 171 predicate places. [2024-06-03 22:25:22,299 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 156 transitions, 1399 flow [2024-06-03 22:25:22,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:22,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:22,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:22,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-03 22:25:22,299 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-03 22:25:22,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:22,299 INFO L85 PathProgramCache]: Analyzing trace with hash -141465073, now seen corresponding path program 16 times [2024-06-03 22:25:22,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:22,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965895087] [2024-06-03 22:25:22,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:22,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:28,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:28,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:28,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965895087] [2024-06-03 22:25:28,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965895087] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:28,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:28,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:25:28,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038934809] [2024-06-03 22:25:28,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:28,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:25:28,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:28,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:25:28,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:25:28,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:25:28,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 156 transitions, 1399 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:28,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:28,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:25:28,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:28,593 INFO L124 PetriNetUnfolderBase]: 356/742 cut-off events. [2024-06-03 22:25:28,593 INFO L125 PetriNetUnfolderBase]: For 24546/24546 co-relation queries the response was YES. [2024-06-03 22:25:28,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3770 conditions, 742 events. 356/742 cut-off events. For 24546/24546 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4051 event pairs, 50 based on Foata normal form. 2/741 useless extension candidates. Maximal degree in co-relation 3678. Up to 475 conditions per place. [2024-06-03 22:25:28,599 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 118 selfloop transitions, 49 changer transitions 0/171 dead transitions. [2024-06-03 22:25:28,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 171 transitions, 1909 flow [2024-06-03 22:25:28,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:25:28,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:25:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2024-06-03 22:25:28,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42727272727272725 [2024-06-03 22:25:28,600 INFO L175 Difference]: Start difference. First operand has 203 places, 156 transitions, 1399 flow. Second operand 10 states and 141 transitions. [2024-06-03 22:25:28,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 171 transitions, 1909 flow [2024-06-03 22:25:28,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 171 transitions, 1797 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-03 22:25:28,666 INFO L231 Difference]: Finished difference. Result has 200 places, 157 transitions, 1411 flow [2024-06-03 22:25:28,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1291, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1411, PETRI_PLACES=200, PETRI_TRANSITIONS=157} [2024-06-03 22:25:28,666 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 168 predicate places. [2024-06-03 22:25:28,666 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 157 transitions, 1411 flow [2024-06-03 22:25:28,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:28,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:28,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:28,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-03 22:25:28,667 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-03 22:25:28,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:28,667 INFO L85 PathProgramCache]: Analyzing trace with hash -135751153, now seen corresponding path program 17 times [2024-06-03 22:25:28,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:28,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173924767] [2024-06-03 22:25:28,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:28,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:34,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:34,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:34,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173924767] [2024-06-03 22:25:34,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173924767] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:34,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:34,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:25:34,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511830724] [2024-06-03 22:25:34,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:34,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:25:34,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:34,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:25:34,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:25:34,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:25:34,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 157 transitions, 1411 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:34,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:34,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:25:34,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:35,151 INFO L124 PetriNetUnfolderBase]: 361/749 cut-off events. [2024-06-03 22:25:35,151 INFO L125 PetriNetUnfolderBase]: For 24071/24071 co-relation queries the response was YES. [2024-06-03 22:25:35,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3825 conditions, 749 events. 361/749 cut-off events. For 24071/24071 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4102 event pairs, 52 based on Foata normal form. 2/748 useless extension candidates. Maximal degree in co-relation 3734. Up to 552 conditions per place. [2024-06-03 22:25:35,157 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 118 selfloop transitions, 48 changer transitions 0/170 dead transitions. [2024-06-03 22:25:35,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 170 transitions, 1802 flow [2024-06-03 22:25:35,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:25:35,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:25:35,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-03 22:25:35,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2024-06-03 22:25:35,159 INFO L175 Difference]: Start difference. First operand has 200 places, 157 transitions, 1411 flow. Second operand 10 states and 136 transitions. [2024-06-03 22:25:35,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 170 transitions, 1802 flow [2024-06-03 22:25:35,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 170 transitions, 1583 flow, removed 13 selfloop flow, removed 11 redundant places. [2024-06-03 22:25:35,213 INFO L231 Difference]: Finished difference. Result has 199 places, 159 transitions, 1327 flow [2024-06-03 22:25:35,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1327, PETRI_PLACES=199, PETRI_TRANSITIONS=159} [2024-06-03 22:25:35,214 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 167 predicate places. [2024-06-03 22:25:35,214 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 159 transitions, 1327 flow [2024-06-03 22:25:35,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:35,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:35,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:35,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-03 22:25:35,215 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-03 22:25:35,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:35,215 INFO L85 PathProgramCache]: Analyzing trace with hash 855633393, now seen corresponding path program 18 times [2024-06-03 22:25:35,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:35,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223478567] [2024-06-03 22:25:35,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:35,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:41,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:41,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:41,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223478567] [2024-06-03 22:25:41,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223478567] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:41,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:41,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:25:41,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546657494] [2024-06-03 22:25:41,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:41,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:25:41,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:41,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:25:41,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:25:41,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:25:41,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 159 transitions, 1327 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:41,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:41,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:25:41,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:41,888 INFO L124 PetriNetUnfolderBase]: 365/761 cut-off events. [2024-06-03 22:25:41,889 INFO L125 PetriNetUnfolderBase]: For 24597/24597 co-relation queries the response was YES. [2024-06-03 22:25:41,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3651 conditions, 761 events. 365/761 cut-off events. For 24597/24597 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4199 event pairs, 54 based on Foata normal form. 2/760 useless extension candidates. Maximal degree in co-relation 3562. Up to 560 conditions per place. [2024-06-03 22:25:41,894 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 118 selfloop transitions, 50 changer transitions 0/172 dead transitions. [2024-06-03 22:25:41,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 172 transitions, 1707 flow [2024-06-03 22:25:41,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:25:41,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:25:41,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 150 transitions. [2024-06-03 22:25:41,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4132231404958678 [2024-06-03 22:25:41,896 INFO L175 Difference]: Start difference. First operand has 199 places, 159 transitions, 1327 flow. Second operand 11 states and 150 transitions. [2024-06-03 22:25:41,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 172 transitions, 1707 flow [2024-06-03 22:25:41,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 172 transitions, 1604 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-03 22:25:41,955 INFO L231 Difference]: Finished difference. Result has 203 places, 160 transitions, 1346 flow [2024-06-03 22:25:41,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1346, PETRI_PLACES=203, PETRI_TRANSITIONS=160} [2024-06-03 22:25:41,956 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 171 predicate places. [2024-06-03 22:25:41,956 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 160 transitions, 1346 flow [2024-06-03 22:25:41,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:41,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:41,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, 1] [2024-06-03 22:25:41,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-03 22:25:41,956 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-03 22:25:41,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:41,957 INFO L85 PathProgramCache]: Analyzing trace with hash 599132883, now seen corresponding path program 19 times [2024-06-03 22:25:41,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:41,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930567557] [2024-06-03 22:25:41,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:41,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:48,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:48,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:48,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930567557] [2024-06-03 22:25:48,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930567557] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:48,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:48,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:25:48,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822776047] [2024-06-03 22:25:48,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:48,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:25:48,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:48,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:25:48,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:25:48,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:25:48,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 160 transitions, 1346 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:48,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:48,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:25:48,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:48,776 INFO L124 PetriNetUnfolderBase]: 369/771 cut-off events. [2024-06-03 22:25:48,776 INFO L125 PetriNetUnfolderBase]: For 25435/25435 co-relation queries the response was YES. [2024-06-03 22:25:48,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3710 conditions, 771 events. 369/771 cut-off events. For 25435/25435 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4293 event pairs, 54 based on Foata normal form. 2/770 useless extension candidates. Maximal degree in co-relation 3620. Up to 568 conditions per place. [2024-06-03 22:25:48,782 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 118 selfloop transitions, 51 changer transitions 0/173 dead transitions. [2024-06-03 22:25:48,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 173 transitions, 1730 flow [2024-06-03 22:25:48,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:25:48,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:25:48,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2024-06-03 22:25:48,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41046831955922863 [2024-06-03 22:25:48,784 INFO L175 Difference]: Start difference. First operand has 203 places, 160 transitions, 1346 flow. Second operand 11 states and 149 transitions. [2024-06-03 22:25:48,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 173 transitions, 1730 flow [2024-06-03 22:25:48,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 173 transitions, 1620 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-03 22:25:48,846 INFO L231 Difference]: Finished difference. Result has 205 places, 161 transitions, 1362 flow [2024-06-03 22:25:48,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1236, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1362, PETRI_PLACES=205, PETRI_TRANSITIONS=161} [2024-06-03 22:25:48,847 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 173 predicate places. [2024-06-03 22:25:48,847 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 161 transitions, 1362 flow [2024-06-03 22:25:48,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:48,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:48,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:48,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-03 22:25:48,848 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-03 22:25:48,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:48,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1672882703, now seen corresponding path program 20 times [2024-06-03 22:25:48,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:48,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105118403] [2024-06-03 22:25:48,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:48,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:54,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:54,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:54,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105118403] [2024-06-03 22:25:54,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105118403] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:54,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:54,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:25:54,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911978988] [2024-06-03 22:25:54,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:54,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:25:54,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:54,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:25:54,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:25:54,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:25:54,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 161 transitions, 1362 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:54,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:54,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:25:54,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:54,989 INFO L124 PetriNetUnfolderBase]: 373/779 cut-off events. [2024-06-03 22:25:54,989 INFO L125 PetriNetUnfolderBase]: For 26228/26228 co-relation queries the response was YES. [2024-06-03 22:25:54,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3763 conditions, 779 events. 373/779 cut-off events. For 26228/26228 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4346 event pairs, 56 based on Foata normal form. 2/778 useless extension candidates. Maximal degree in co-relation 3672. Up to 576 conditions per place. [2024-06-03 22:25:54,995 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 119 selfloop transitions, 51 changer transitions 0/174 dead transitions. [2024-06-03 22:25:54,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 174 transitions, 1750 flow [2024-06-03 22:25:54,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:25:54,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:25:54,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2024-06-03 22:25:54,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40771349862258954 [2024-06-03 22:25:54,996 INFO L175 Difference]: Start difference. First operand has 205 places, 161 transitions, 1362 flow. Second operand 11 states and 148 transitions. [2024-06-03 22:25:54,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 174 transitions, 1750 flow [2024-06-03 22:25:55,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 174 transitions, 1636 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-03 22:25:55,065 INFO L231 Difference]: Finished difference. Result has 207 places, 162 transitions, 1376 flow [2024-06-03 22:25:55,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1376, PETRI_PLACES=207, PETRI_TRANSITIONS=162} [2024-06-03 22:25:55,066 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 175 predicate places. [2024-06-03 22:25:55,066 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 162 transitions, 1376 flow [2024-06-03 22:25:55,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:55,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:55,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:55,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-03 22:25:55,067 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-03 22:25:55,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:55,067 INFO L85 PathProgramCache]: Analyzing trace with hash 598925493, now seen corresponding path program 21 times [2024-06-03 22:25:55,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:55,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586579195] [2024-06-03 22:25:55,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:55,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:01,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-03 22:26:01,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:01,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586579195] [2024-06-03 22:26:01,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586579195] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:01,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:01,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:26:01,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241956635] [2024-06-03 22:26:01,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:01,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:26:01,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:01,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:26:01,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:26:01,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:26:01,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 162 transitions, 1376 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:01,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:01,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:26:01,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:01,820 INFO L124 PetriNetUnfolderBase]: 377/787 cut-off events. [2024-06-03 22:26:01,821 INFO L125 PetriNetUnfolderBase]: For 27027/27027 co-relation queries the response was YES. [2024-06-03 22:26:01,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3816 conditions, 787 events. 377/787 cut-off events. For 27027/27027 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4402 event pairs, 56 based on Foata normal form. 2/786 useless extension candidates. Maximal degree in co-relation 3724. Up to 558 conditions per place. [2024-06-03 22:26:01,826 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 118 selfloop transitions, 54 changer transitions 0/176 dead transitions. [2024-06-03 22:26:01,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 176 transitions, 1772 flow [2024-06-03 22:26:01,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:26:01,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:26:01,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 150 transitions. [2024-06-03 22:26:01,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4132231404958678 [2024-06-03 22:26:01,827 INFO L175 Difference]: Start difference. First operand has 207 places, 162 transitions, 1376 flow. Second operand 11 states and 150 transitions. [2024-06-03 22:26:01,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 176 transitions, 1772 flow [2024-06-03 22:26:01,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 176 transitions, 1656 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-03 22:26:01,889 INFO L231 Difference]: Finished difference. Result has 209 places, 163 transitions, 1396 flow [2024-06-03 22:26:01,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1260, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1396, PETRI_PLACES=209, PETRI_TRANSITIONS=163} [2024-06-03 22:26:01,890 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 177 predicate places. [2024-06-03 22:26:01,890 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 163 transitions, 1396 flow [2024-06-03 22:26:01,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:01,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:01,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:01,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-03 22:26:01,891 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-03 22:26:01,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:01,891 INFO L85 PathProgramCache]: Analyzing trace with hash -141320923, now seen corresponding path program 22 times [2024-06-03 22:26:01,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:01,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225844212] [2024-06-03 22:26:01,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:01,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:08,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:08,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:08,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225844212] [2024-06-03 22:26:08,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225844212] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:08,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:08,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:26:08,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702137029] [2024-06-03 22:26:08,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:08,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:26:08,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:08,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:26:08,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:26:08,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:26:08,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 163 transitions, 1396 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:08,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:08,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:26:08,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:08,494 INFO L124 PetriNetUnfolderBase]: 381/795 cut-off events. [2024-06-03 22:26:08,494 INFO L125 PetriNetUnfolderBase]: For 28030/28030 co-relation queries the response was YES. [2024-06-03 22:26:08,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3879 conditions, 795 events. 381/795 cut-off events. For 28030/28030 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4436 event pairs, 56 based on Foata normal form. 2/794 useless extension candidates. Maximal degree in co-relation 3786. Up to 578 conditions per place. [2024-06-03 22:26:08,502 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 123 selfloop transitions, 49 changer transitions 0/176 dead transitions. [2024-06-03 22:26:08,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 176 transitions, 1792 flow [2024-06-03 22:26:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:26:08,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:26:08,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-06-03 22:26:08,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-06-03 22:26:08,503 INFO L175 Difference]: Start difference. First operand has 209 places, 163 transitions, 1396 flow. Second operand 10 states and 138 transitions. [2024-06-03 22:26:08,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 176 transitions, 1792 flow [2024-06-03 22:26:08,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 176 transitions, 1668 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-03 22:26:08,569 INFO L231 Difference]: Finished difference. Result has 210 places, 164 transitions, 1400 flow [2024-06-03 22:26:08,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1400, PETRI_PLACES=210, PETRI_TRANSITIONS=164} [2024-06-03 22:26:08,570 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 178 predicate places. [2024-06-03 22:26:08,570 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 164 transitions, 1400 flow [2024-06-03 22:26:08,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:08,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:08,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:08,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-03 22:26:08,570 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-03 22:26:08,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:08,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1404249585, now seen corresponding path program 23 times [2024-06-03 22:26:08,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:08,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647299139] [2024-06-03 22:26:08,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:08,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:14,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:14,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:14,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647299139] [2024-06-03 22:26:14,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647299139] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:14,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:14,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:26:14,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129342353] [2024-06-03 22:26:14,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:14,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:26:14,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:14,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:26:14,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:26:14,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:26:14,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 164 transitions, 1400 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:14,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:14,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:26:14,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:14,678 INFO L124 PetriNetUnfolderBase]: 386/806 cut-off events. [2024-06-03 22:26:14,678 INFO L125 PetriNetUnfolderBase]: For 29049/29049 co-relation queries the response was YES. [2024-06-03 22:26:14,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3936 conditions, 806 events. 386/806 cut-off events. For 29049/29049 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4532 event pairs, 58 based on Foata normal form. 2/805 useless extension candidates. Maximal degree in co-relation 3842. Up to 602 conditions per place. [2024-06-03 22:26:14,684 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 126 selfloop transitions, 47 changer transitions 0/177 dead transitions. [2024-06-03 22:26:14,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 177 transitions, 1809 flow [2024-06-03 22:26:14,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:26:14,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:26:14,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-03 22:26:14,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2024-06-03 22:26:14,686 INFO L175 Difference]: Start difference. First operand has 210 places, 164 transitions, 1400 flow. Second operand 10 states and 136 transitions. [2024-06-03 22:26:14,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 177 transitions, 1809 flow [2024-06-03 22:26:14,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 177 transitions, 1691 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-03 22:26:14,760 INFO L231 Difference]: Finished difference. Result has 212 places, 166 transitions, 1419 flow [2024-06-03 22:26:14,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1284, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1419, PETRI_PLACES=212, PETRI_TRANSITIONS=166} [2024-06-03 22:26:14,760 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 180 predicate places. [2024-06-03 22:26:14,761 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 166 transitions, 1419 flow [2024-06-03 22:26:14,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:14,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:14,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:14,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-03 22:26:14,761 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-03 22:26:14,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:14,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1660750095, now seen corresponding path program 24 times [2024-06-03 22:26:14,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:14,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742804603] [2024-06-03 22:26:14,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:14,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:21,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:21,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:21,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742804603] [2024-06-03 22:26:21,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742804603] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:21,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:21,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:26:21,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564028094] [2024-06-03 22:26:21,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:21,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:26:21,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:21,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:26:21,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:26:21,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:26:21,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 166 transitions, 1419 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:21,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:21,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:26:21,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:21,593 INFO L124 PetriNetUnfolderBase]: 390/814 cut-off events. [2024-06-03 22:26:21,593 INFO L125 PetriNetUnfolderBase]: For 29944/29944 co-relation queries the response was YES. [2024-06-03 22:26:21,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3977 conditions, 814 events. 390/814 cut-off events. For 29944/29944 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4586 event pairs, 60 based on Foata normal form. 2/813 useless extension candidates. Maximal degree in co-relation 3882. Up to 610 conditions per place. [2024-06-03 22:26:21,599 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 128 selfloop transitions, 46 changer transitions 0/178 dead transitions. [2024-06-03 22:26:21,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 178 transitions, 1821 flow [2024-06-03 22:26:21,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:26:21,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:26:21,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-03 22:26:21,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2024-06-03 22:26:21,601 INFO L175 Difference]: Start difference. First operand has 212 places, 166 transitions, 1419 flow. Second operand 10 states and 136 transitions. [2024-06-03 22:26:21,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 178 transitions, 1821 flow [2024-06-03 22:26:21,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 178 transitions, 1709 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-03 22:26:21,667 INFO L231 Difference]: Finished difference. Result has 215 places, 167 transitions, 1433 flow [2024-06-03 22:26:21,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1307, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1433, PETRI_PLACES=215, PETRI_TRANSITIONS=167} [2024-06-03 22:26:21,667 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 183 predicate places. [2024-06-03 22:26:21,668 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 167 transitions, 1433 flow [2024-06-03 22:26:21,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:21,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:21,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:21,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-03 22:26:21,668 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-03 22:26:21,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:21,668 INFO L85 PathProgramCache]: Analyzing trace with hash 57980867, now seen corresponding path program 25 times [2024-06-03 22:26:21,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:21,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778121582] [2024-06-03 22:26:21,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:21,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:27,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:27,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:27,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778121582] [2024-06-03 22:26:27,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778121582] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:27,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:27,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:26:27,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626417306] [2024-06-03 22:26:27,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:27,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:26:27,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:27,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:26:27,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:26:27,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:26:27,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 167 transitions, 1433 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:27,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:27,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:26:27,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:27,653 INFO L124 PetriNetUnfolderBase]: 387/806 cut-off events. [2024-06-03 22:26:27,653 INFO L125 PetriNetUnfolderBase]: For 25649/25649 co-relation queries the response was YES. [2024-06-03 22:26:27,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3775 conditions, 806 events. 387/806 cut-off events. For 25649/25649 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4555 event pairs, 61 based on Foata normal form. 2/804 useless extension candidates. Maximal degree in co-relation 3679. Up to 561 conditions per place. [2024-06-03 22:26:27,659 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 125 selfloop transitions, 50 changer transitions 0/179 dead transitions. [2024-06-03 22:26:27,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 179 transitions, 1811 flow [2024-06-03 22:26:27,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:26:27,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:26:27,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2024-06-03 22:26:27,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212121212121212 [2024-06-03 22:26:27,661 INFO L175 Difference]: Start difference. First operand has 215 places, 167 transitions, 1433 flow. Second operand 10 states and 139 transitions. [2024-06-03 22:26:27,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 179 transitions, 1811 flow [2024-06-03 22:26:27,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 179 transitions, 1663 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-06-03 22:26:27,720 INFO L231 Difference]: Finished difference. Result has 216 places, 167 transitions, 1389 flow [2024-06-03 22:26:27,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1285, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1389, PETRI_PLACES=216, PETRI_TRANSITIONS=167} [2024-06-03 22:26:27,721 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 184 predicate places. [2024-06-03 22:26:27,721 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 167 transitions, 1389 flow [2024-06-03 22:26:27,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:27,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:27,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:27,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-03 22:26:27,721 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-03 22:26:27,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:27,722 INFO L85 PathProgramCache]: Analyzing trace with hash -830757029, now seen corresponding path program 7 times [2024-06-03 22:26:27,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:27,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880292052] [2024-06-03 22:26:27,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:27,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:33,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:33,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880292052] [2024-06-03 22:26:33,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880292052] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:33,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:33,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:26:33,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291019078] [2024-06-03 22:26:33,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:33,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:26:33,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:33,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:26:33,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:26:33,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:26:33,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 167 transitions, 1389 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:33,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:33,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:26:33,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:34,178 INFO L124 PetriNetUnfolderBase]: 417/876 cut-off events. [2024-06-03 22:26:34,178 INFO L125 PetriNetUnfolderBase]: For 54472/54472 co-relation queries the response was YES. [2024-06-03 22:26:34,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4599 conditions, 876 events. 417/876 cut-off events. For 54472/54472 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5016 event pairs, 75 based on Foata normal form. 6/878 useless extension candidates. Maximal degree in co-relation 4502. Up to 567 conditions per place. [2024-06-03 22:26:34,184 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 127 selfloop transitions, 49 changer transitions 6/186 dead transitions. [2024-06-03 22:26:34,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 186 transitions, 2005 flow [2024-06-03 22:26:34,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:26:34,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:26:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2024-06-03 22:26:34,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42699724517906334 [2024-06-03 22:26:34,185 INFO L175 Difference]: Start difference. First operand has 216 places, 167 transitions, 1389 flow. Second operand 11 states and 155 transitions. [2024-06-03 22:26:34,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 186 transitions, 2005 flow [2024-06-03 22:26:34,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 186 transitions, 1870 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-03 22:26:34,287 INFO L231 Difference]: Finished difference. Result has 218 places, 165 transitions, 1344 flow [2024-06-03 22:26:34,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1254, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1344, PETRI_PLACES=218, PETRI_TRANSITIONS=165} [2024-06-03 22:26:34,288 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 186 predicate places. [2024-06-03 22:26:34,288 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 165 transitions, 1344 flow [2024-06-03 22:26:34,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:34,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:34,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:34,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-03 22:26:34,288 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-03 22:26:34,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:34,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1372059847, now seen corresponding path program 8 times [2024-06-03 22:26:34,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:34,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911300846] [2024-06-03 22:26:34,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:34,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:40,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:40,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:40,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911300846] [2024-06-03 22:26:40,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911300846] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:40,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:40,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:26:40,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076368888] [2024-06-03 22:26:40,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:40,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:26:40,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:40,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:26:40,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:26:40,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 22:26:40,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 165 transitions, 1344 flow. Second operand has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:40,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:40,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 22:26:40,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:40,772 INFO L124 PetriNetUnfolderBase]: 421/883 cut-off events. [2024-06-03 22:26:40,773 INFO L125 PetriNetUnfolderBase]: For 57478/57478 co-relation queries the response was YES. [2024-06-03 22:26:40,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4973 conditions, 883 events. 421/883 cut-off events. For 57478/57478 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5059 event pairs, 73 based on Foata normal form. 2/882 useless extension candidates. Maximal degree in co-relation 4875. Up to 628 conditions per place. [2024-06-03 22:26:40,780 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 117 selfloop transitions, 64 changer transitions 0/185 dead transitions. [2024-06-03 22:26:40,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 185 transitions, 1962 flow [2024-06-03 22:26:40,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-03 22:26:40,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-03 22:26:40,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 191 transitions. [2024-06-03 22:26:40,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44522144522144524 [2024-06-03 22:26:40,781 INFO L175 Difference]: Start difference. First operand has 218 places, 165 transitions, 1344 flow. Second operand 13 states and 191 transitions. [2024-06-03 22:26:40,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 185 transitions, 1962 flow [2024-06-03 22:26:40,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 185 transitions, 1858 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-03 22:26:40,889 INFO L231 Difference]: Finished difference. Result has 220 places, 168 transitions, 1460 flow [2024-06-03 22:26:40,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1244, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1460, PETRI_PLACES=220, PETRI_TRANSITIONS=168} [2024-06-03 22:26:40,889 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 188 predicate places. [2024-06-03 22:26:40,889 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 168 transitions, 1460 flow [2024-06-03 22:26:40,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:40,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:40,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:40,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-03 22:26:40,890 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-03 22:26:40,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:40,890 INFO L85 PathProgramCache]: Analyzing trace with hash -760403535, now seen corresponding path program 9 times [2024-06-03 22:26:40,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:40,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51652302] [2024-06-03 22:26:40,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:40,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:46,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:46,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:46,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51652302] [2024-06-03 22:26:46,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51652302] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:46,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:46,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:26:46,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496694874] [2024-06-03 22:26:46,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:46,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:26:46,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:46,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:26:46,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:26:47,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 22:26:47,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 168 transitions, 1460 flow. Second operand has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 11 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:47,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:47,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 22:26:47,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:47,455 INFO L124 PetriNetUnfolderBase]: 411/862 cut-off events. [2024-06-03 22:26:47,455 INFO L125 PetriNetUnfolderBase]: For 51239/51239 co-relation queries the response was YES. [2024-06-03 22:26:47,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4397 conditions, 862 events. 411/862 cut-off events. For 51239/51239 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4945 event pairs, 71 based on Foata normal form. 8/866 useless extension candidates. Maximal degree in co-relation 4299. Up to 601 conditions per place. [2024-06-03 22:26:47,462 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 122 selfloop transitions, 46 changer transitions 11/183 dead transitions. [2024-06-03 22:26:47,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 183 transitions, 1898 flow [2024-06-03 22:26:47,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:26:47,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:26:47,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 161 transitions. [2024-06-03 22:26:47,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44352617079889806 [2024-06-03 22:26:47,463 INFO L175 Difference]: Start difference. First operand has 220 places, 168 transitions, 1460 flow. Second operand 11 states and 161 transitions. [2024-06-03 22:26:47,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 183 transitions, 1898 flow [2024-06-03 22:26:47,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 183 transitions, 1778 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-03 22:26:47,551 INFO L231 Difference]: Finished difference. Result has 222 places, 164 transitions, 1406 flow [2024-06-03 22:26:47,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1406, PETRI_PLACES=222, PETRI_TRANSITIONS=164} [2024-06-03 22:26:47,551 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 190 predicate places. [2024-06-03 22:26:47,552 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 164 transitions, 1406 flow [2024-06-03 22:26:47,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 11 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:47,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:47,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:47,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-03 22:26:47,552 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-03 22:26:47,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:47,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1977912113, now seen corresponding path program 10 times [2024-06-03 22:26:47,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:47,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82184644] [2024-06-03 22:26:47,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:47,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:53,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:53,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:53,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82184644] [2024-06-03 22:26:53,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82184644] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:53,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:53,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:26:53,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399139561] [2024-06-03 22:26:53,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:53,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:26:53,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:53,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:26:53,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:26:53,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:26:53,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 164 transitions, 1406 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:53,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:53,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:26:53,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:54,481 INFO L124 PetriNetUnfolderBase]: 411/860 cut-off events. [2024-06-03 22:26:54,481 INFO L125 PetriNetUnfolderBase]: For 48438/48438 co-relation queries the response was YES. [2024-06-03 22:26:54,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4728 conditions, 860 events. 411/860 cut-off events. For 48438/48438 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4963 event pairs, 69 based on Foata normal form. 2/858 useless extension candidates. Maximal degree in co-relation 4628. Up to 590 conditions per place. [2024-06-03 22:26:54,488 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 116 selfloop transitions, 63 changer transitions 0/183 dead transitions. [2024-06-03 22:26:54,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 183 transitions, 2024 flow [2024-06-03 22:26:54,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:26:54,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:26:54,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 166 transitions. [2024-06-03 22:26:54,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41919191919191917 [2024-06-03 22:26:54,489 INFO L175 Difference]: Start difference. First operand has 222 places, 164 transitions, 1406 flow. Second operand 12 states and 166 transitions. [2024-06-03 22:26:54,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 183 transitions, 2024 flow [2024-06-03 22:26:54,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 183 transitions, 1892 flow, removed 20 selfloop flow, removed 10 redundant places. [2024-06-03 22:26:54,584 INFO L231 Difference]: Finished difference. Result has 219 places, 167 transitions, 1502 flow [2024-06-03 22:26:54,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1292, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1502, PETRI_PLACES=219, PETRI_TRANSITIONS=167} [2024-06-03 22:26:54,584 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 187 predicate places. [2024-06-03 22:26:54,584 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 167 transitions, 1502 flow [2024-06-03 22:26:54,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:54,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:54,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:54,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-03 22:26:54,585 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-03 22:26:54,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:54,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1978238543, now seen corresponding path program 11 times [2024-06-03 22:26:54,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:54,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814209959] [2024-06-03 22:26:54,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:54,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:01,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:01,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814209959] [2024-06-03 22:27:01,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814209959] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:01,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:01,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:27:01,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298945602] [2024-06-03 22:27:01,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:01,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:27:01,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:01,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:27:01,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:27:01,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:27:01,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 167 transitions, 1502 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:01,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:01,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:27:01,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:01,736 INFO L124 PetriNetUnfolderBase]: 423/888 cut-off events. [2024-06-03 22:27:01,736 INFO L125 PetriNetUnfolderBase]: For 60033/60033 co-relation queries the response was YES. [2024-06-03 22:27:01,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4845 conditions, 888 events. 423/888 cut-off events. For 60033/60033 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5135 event pairs, 75 based on Foata normal form. 8/892 useless extension candidates. Maximal degree in co-relation 4746. Up to 622 conditions per place. [2024-06-03 22:27:01,743 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 113 selfloop transitions, 57 changer transitions 9/183 dead transitions. [2024-06-03 22:27:01,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 183 transitions, 1940 flow [2024-06-03 22:27:01,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:27:01,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:27:01,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 164 transitions. [2024-06-03 22:27:01,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-03 22:27:01,760 INFO L175 Difference]: Start difference. First operand has 219 places, 167 transitions, 1502 flow. Second operand 12 states and 164 transitions. [2024-06-03 22:27:01,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 183 transitions, 1940 flow [2024-06-03 22:27:01,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 183 transitions, 1803 flow, removed 26 selfloop flow, removed 8 redundant places. [2024-06-03 22:27:01,865 INFO L231 Difference]: Finished difference. Result has 223 places, 164 transitions, 1471 flow [2024-06-03 22:27:01,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1379, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1471, PETRI_PLACES=223, PETRI_TRANSITIONS=164} [2024-06-03 22:27:01,866 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 191 predicate places. [2024-06-03 22:27:01,866 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 164 transitions, 1471 flow [2024-06-03 22:27:01,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:01,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:01,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:01,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-03 22:27:01,866 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-03 22:27:01,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:01,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1987435313, now seen corresponding path program 12 times [2024-06-03 22:27:01,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:01,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944514294] [2024-06-03 22:27:01,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:01,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:08,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:08,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:08,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944514294] [2024-06-03 22:27:08,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944514294] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:08,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:08,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:27:08,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755061053] [2024-06-03 22:27:08,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:08,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:27:08,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:08,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:27:08,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:27:09,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:27:09,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 164 transitions, 1471 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:09,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:09,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:27:09,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:09,588 INFO L124 PetriNetUnfolderBase]: 404/856 cut-off events. [2024-06-03 22:27:09,588 INFO L125 PetriNetUnfolderBase]: For 51107/51107 co-relation queries the response was YES. [2024-06-03 22:27:09,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4343 conditions, 856 events. 404/856 cut-off events. For 51107/51107 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4944 event pairs, 71 based on Foata normal form. 8/861 useless extension candidates. Maximal degree in co-relation 4242. Up to 619 conditions per place. [2024-06-03 22:27:09,595 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 116 selfloop transitions, 49 changer transitions 9/178 dead transitions. [2024-06-03 22:27:09,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 178 transitions, 1851 flow [2024-06-03 22:27:09,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:27:09,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:27:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2024-06-03 22:27:09,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065656565656566 [2024-06-03 22:27:09,596 INFO L175 Difference]: Start difference. First operand has 223 places, 164 transitions, 1471 flow. Second operand 12 states and 161 transitions. [2024-06-03 22:27:09,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 178 transitions, 1851 flow [2024-06-03 22:27:09,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 178 transitions, 1709 flow, removed 14 selfloop flow, removed 11 redundant places. [2024-06-03 22:27:09,675 INFO L231 Difference]: Finished difference. Result has 221 places, 159 transitions, 1391 flow [2024-06-03 22:27:09,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1329, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1391, PETRI_PLACES=221, PETRI_TRANSITIONS=159} [2024-06-03 22:27:09,676 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 189 predicate places. [2024-06-03 22:27:09,676 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 159 transitions, 1391 flow [2024-06-03 22:27:09,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:09,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:09,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:09,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-03 22:27:09,677 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-03 22:27:09,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:09,677 INFO L85 PathProgramCache]: Analyzing trace with hash 43083155, now seen corresponding path program 13 times [2024-06-03 22:27:09,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:09,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147505353] [2024-06-03 22:27:09,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:09,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:15,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:15,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:15,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147505353] [2024-06-03 22:27:15,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147505353] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:15,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:15,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:27:15,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748449463] [2024-06-03 22:27:15,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:15,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:27:15,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:15,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:27:15,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:27:15,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:27:15,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 159 transitions, 1391 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:15,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:15,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:27:15,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:16,431 INFO L124 PetriNetUnfolderBase]: 385/823 cut-off events. [2024-06-03 22:27:16,432 INFO L125 PetriNetUnfolderBase]: For 39175/39175 co-relation queries the response was YES. [2024-06-03 22:27:16,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3843 conditions, 823 events. 385/823 cut-off events. For 39175/39175 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4724 event pairs, 67 based on Foata normal form. 8/828 useless extension candidates. Maximal degree in co-relation 3743. Up to 574 conditions per place. [2024-06-03 22:27:16,438 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 109 selfloop transitions, 52 changer transitions 9/174 dead transitions. [2024-06-03 22:27:16,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 174 transitions, 1765 flow [2024-06-03 22:27:16,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-03 22:27:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-03 22:27:16,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 173 transitions. [2024-06-03 22:27:16,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40326340326340326 [2024-06-03 22:27:16,439 INFO L175 Difference]: Start difference. First operand has 221 places, 159 transitions, 1391 flow. Second operand 13 states and 173 transitions. [2024-06-03 22:27:16,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 174 transitions, 1765 flow [2024-06-03 22:27:16,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 174 transitions, 1633 flow, removed 15 selfloop flow, removed 13 redundant places. [2024-06-03 22:27:16,515 INFO L231 Difference]: Finished difference. Result has 218 places, 154 transitions, 1333 flow [2024-06-03 22:27:16,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1333, PETRI_PLACES=218, PETRI_TRANSITIONS=154} [2024-06-03 22:27:16,515 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 186 predicate places. [2024-06-03 22:27:16,516 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 154 transitions, 1333 flow [2024-06-03 22:27:16,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:16,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:16,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:16,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-03 22:27:16,516 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-03 22:27:16,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:16,517 INFO L85 PathProgramCache]: Analyzing trace with hash 54134345, now seen corresponding path program 14 times [2024-06-03 22:27:16,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:16,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57856112] [2024-06-03 22:27:16,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:16,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:22,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:22,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:22,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57856112] [2024-06-03 22:27:22,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57856112] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:22,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:22,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:27:22,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215139450] [2024-06-03 22:27:22,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:22,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:27:22,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:22,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:27:22,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:27:22,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:27:22,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 154 transitions, 1333 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:22,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:22,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:27:22,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:23,095 INFO L124 PetriNetUnfolderBase]: 388/833 cut-off events. [2024-06-03 22:27:23,095 INFO L125 PetriNetUnfolderBase]: For 42940/42940 co-relation queries the response was YES. [2024-06-03 22:27:23,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4100 conditions, 833 events. 388/833 cut-off events. For 42940/42940 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4791 event pairs, 75 based on Foata normal form. 6/835 useless extension candidates. Maximal degree in co-relation 4002. Up to 475 conditions per place. [2024-06-03 22:27:23,101 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 105 selfloop transitions, 57 changer transitions 9/175 dead transitions. [2024-06-03 22:27:23,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 175 transitions, 1887 flow [2024-06-03 22:27:23,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-03 22:27:23,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-03 22:27:23,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 178 transitions. [2024-06-03 22:27:23,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4149184149184149 [2024-06-03 22:27:23,104 INFO L175 Difference]: Start difference. First operand has 218 places, 154 transitions, 1333 flow. Second operand 13 states and 178 transitions. [2024-06-03 22:27:23,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 175 transitions, 1887 flow [2024-06-03 22:27:23,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 175 transitions, 1769 flow, removed 5 selfloop flow, removed 14 redundant places. [2024-06-03 22:27:23,199 INFO L231 Difference]: Finished difference. Result has 214 places, 151 transitions, 1312 flow [2024-06-03 22:27:23,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1219, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1312, PETRI_PLACES=214, PETRI_TRANSITIONS=151} [2024-06-03 22:27:23,200 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 182 predicate places. [2024-06-03 22:27:23,200 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 151 transitions, 1312 flow [2024-06-03 22:27:23,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:23,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:23,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:23,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-03 22:27:23,201 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-03 22:27:23,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:23,201 INFO L85 PathProgramCache]: Analyzing trace with hash 350413037, now seen corresponding path program 15 times [2024-06-03 22:27:23,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:23,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184276766] [2024-06-03 22:27:23,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:23,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:29,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:29,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:29,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184276766] [2024-06-03 22:27:29,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184276766] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:29,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:29,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:27:29,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535906850] [2024-06-03 22:27:29,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:29,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:27:29,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:29,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:27:29,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:27:29,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:27:29,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 151 transitions, 1312 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:29,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:29,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:27:29,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:30,393 INFO L124 PetriNetUnfolderBase]: 379/804 cut-off events. [2024-06-03 22:27:30,394 INFO L125 PetriNetUnfolderBase]: For 37881/37881 co-relation queries the response was YES. [2024-06-03 22:27:30,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4161 conditions, 804 events. 379/804 cut-off events. For 37881/37881 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4532 event pairs, 74 based on Foata normal form. 2/802 useless extension candidates. Maximal degree in co-relation 4065. Up to 535 conditions per place. [2024-06-03 22:27:30,400 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 103 selfloop transitions, 62 changer transitions 0/169 dead transitions. [2024-06-03 22:27:30,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 169 transitions, 1856 flow [2024-06-03 22:27:30,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:27:30,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:27:30,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 166 transitions. [2024-06-03 22:27:30,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41919191919191917 [2024-06-03 22:27:30,401 INFO L175 Difference]: Start difference. First operand has 214 places, 151 transitions, 1312 flow. Second operand 12 states and 166 transitions. [2024-06-03 22:27:30,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 169 transitions, 1856 flow [2024-06-03 22:27:30,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 169 transitions, 1738 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-03 22:27:30,479 INFO L231 Difference]: Finished difference. Result has 212 places, 153 transitions, 1380 flow [2024-06-03 22:27:30,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1380, PETRI_PLACES=212, PETRI_TRANSITIONS=153} [2024-06-03 22:27:30,480 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 180 predicate places. [2024-06-03 22:27:30,480 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 153 transitions, 1380 flow [2024-06-03 22:27:30,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:30,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:30,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:30,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-03 22:27:30,481 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-03 22:27:30,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:30,481 INFO L85 PathProgramCache]: Analyzing trace with hash 864838099, now seen corresponding path program 16 times [2024-06-03 22:27:30,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:30,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835066974] [2024-06-03 22:27:30,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:30,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:37,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:37,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:37,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835066974] [2024-06-03 22:27:37,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835066974] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:37,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:37,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:27:37,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859474258] [2024-06-03 22:27:37,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:37,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:27:37,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:37,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:27:37,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:27:37,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:27:37,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 153 transitions, 1380 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:37,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:37,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:27:37,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:38,182 INFO L124 PetriNetUnfolderBase]: 391/830 cut-off events. [2024-06-03 22:27:38,182 INFO L125 PetriNetUnfolderBase]: For 50195/50195 co-relation queries the response was YES. [2024-06-03 22:27:38,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4347 conditions, 830 events. 391/830 cut-off events. For 50195/50195 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4690 event pairs, 80 based on Foata normal form. 8/834 useless extension candidates. Maximal degree in co-relation 4251. Up to 571 conditions per place. [2024-06-03 22:27:38,189 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 100 selfloop transitions, 56 changer transitions 9/169 dead transitions. [2024-06-03 22:27:38,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 169 transitions, 1790 flow [2024-06-03 22:27:38,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:27:38,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:27:38,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 164 transitions. [2024-06-03 22:27:38,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-03 22:27:38,190 INFO L175 Difference]: Start difference. First operand has 212 places, 153 transitions, 1380 flow. Second operand 12 states and 164 transitions. [2024-06-03 22:27:38,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 169 transitions, 1790 flow [2024-06-03 22:27:38,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 169 transitions, 1565 flow, removed 27 selfloop flow, removed 11 redundant places. [2024-06-03 22:27:38,277 INFO L231 Difference]: Finished difference. Result has 213 places, 150 transitions, 1265 flow [2024-06-03 22:27:38,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1171, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1265, PETRI_PLACES=213, PETRI_TRANSITIONS=150} [2024-06-03 22:27:38,278 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 181 predicate places. [2024-06-03 22:27:38,278 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 150 transitions, 1265 flow [2024-06-03 22:27:38,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:38,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:38,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:38,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-03 22:27:38,278 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-03 22:27:38,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:38,279 INFO L85 PathProgramCache]: Analyzing trace with hash 606290659, now seen corresponding path program 17 times [2024-06-03 22:27:38,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:38,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448153807] [2024-06-03 22:27:38,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:38,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:44,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:44,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:44,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448153807] [2024-06-03 22:27:44,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448153807] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:44,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:44,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:27:44,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880794151] [2024-06-03 22:27:44,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:44,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:27:44,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:44,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:27:44,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:27:44,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:27:44,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 150 transitions, 1265 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:44,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:44,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:27:44,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:45,302 INFO L124 PetriNetUnfolderBase]: 386/826 cut-off events. [2024-06-03 22:27:45,303 INFO L125 PetriNetUnfolderBase]: For 51213/51213 co-relation queries the response was YES. [2024-06-03 22:27:45,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4070 conditions, 826 events. 386/826 cut-off events. For 51213/51213 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4670 event pairs, 76 based on Foata normal form. 8/831 useless extension candidates. Maximal degree in co-relation 3975. Up to 597 conditions per place. [2024-06-03 22:27:45,309 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 106 selfloop transitions, 47 changer transitions 9/166 dead transitions. [2024-06-03 22:27:45,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 166 transitions, 1653 flow [2024-06-03 22:27:45,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:27:45,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:27:45,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 162 transitions. [2024-06-03 22:27:45,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-03 22:27:45,310 INFO L175 Difference]: Start difference. First operand has 213 places, 150 transitions, 1265 flow. Second operand 12 states and 162 transitions. [2024-06-03 22:27:45,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 166 transitions, 1653 flow [2024-06-03 22:27:45,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 166 transitions, 1537 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-03 22:27:45,387 INFO L231 Difference]: Finished difference. Result has 211 places, 147 transitions, 1222 flow [2024-06-03 22:27:45,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1149, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1222, PETRI_PLACES=211, PETRI_TRANSITIONS=147} [2024-06-03 22:27:45,387 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 179 predicate places. [2024-06-03 22:27:45,387 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 147 transitions, 1222 flow [2024-06-03 22:27:45,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:45,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:45,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:45,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-03 22:27:45,388 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-03 22:27:45,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:45,388 INFO L85 PathProgramCache]: Analyzing trace with hash 599140819, now seen corresponding path program 18 times [2024-06-03 22:27:45,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:45,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005666546] [2024-06-03 22:27:45,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:45,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:52,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:52,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005666546] [2024-06-03 22:27:52,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005666546] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:52,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:52,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:27:52,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860325124] [2024-06-03 22:27:52,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:52,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:27:52,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:52,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:27:52,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:27:52,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:27:52,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 147 transitions, 1222 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:52,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:52,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:27:52,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:52,793 INFO L124 PetriNetUnfolderBase]: 367/788 cut-off events. [2024-06-03 22:27:52,794 INFO L125 PetriNetUnfolderBase]: For 40807/40807 co-relation queries the response was YES. [2024-06-03 22:27:52,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3593 conditions, 788 events. 367/788 cut-off events. For 40807/40807 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4409 event pairs, 78 based on Foata normal form. 8/792 useless extension candidates. Maximal degree in co-relation 3499. Up to 540 conditions per place. [2024-06-03 22:27:52,799 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 97 selfloop transitions, 51 changer transitions 9/161 dead transitions. [2024-06-03 22:27:52,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 161 transitions, 1568 flow [2024-06-03 22:27:52,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:27:52,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:27:52,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2024-06-03 22:27:52,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065656565656566 [2024-06-03 22:27:52,801 INFO L175 Difference]: Start difference. First operand has 211 places, 147 transitions, 1222 flow. Second operand 12 states and 161 transitions. [2024-06-03 22:27:52,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 161 transitions, 1568 flow [2024-06-03 22:27:52,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 161 transitions, 1444 flow, removed 15 selfloop flow, removed 11 redundant places. [2024-06-03 22:27:52,869 INFO L231 Difference]: Finished difference. Result has 209 places, 142 transitions, 1171 flow [2024-06-03 22:27:52,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1098, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1171, PETRI_PLACES=209, PETRI_TRANSITIONS=142} [2024-06-03 22:27:52,869 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 177 predicate places. [2024-06-03 22:27:52,869 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 142 transitions, 1171 flow [2024-06-03 22:27:52,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:52,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:52,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:52,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-03 22:27:52,870 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-03 22:27:52,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:52,870 INFO L85 PathProgramCache]: Analyzing trace with hash -978414135, now seen corresponding path program 1 times [2024-06-03 22:27:52,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:52,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477316179] [2024-06-03 22:27:52,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:52,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:00,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:00,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:00,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477316179] [2024-06-03 22:28:00,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477316179] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:00,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:00,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:28:00,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838540400] [2024-06-03 22:28:00,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:00,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:28:00,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:00,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:28:00,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:28:00,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:28:00,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 142 transitions, 1171 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:00,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:00,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:28:00,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:00,959 INFO L124 PetriNetUnfolderBase]: 358/773 cut-off events. [2024-06-03 22:28:00,959 INFO L125 PetriNetUnfolderBase]: For 35289/35289 co-relation queries the response was YES. [2024-06-03 22:28:00,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3499 conditions, 773 events. 358/773 cut-off events. For 35289/35289 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4348 event pairs, 64 based on Foata normal form. 6/775 useless extension candidates. Maximal degree in co-relation 3406. Up to 617 conditions per place. [2024-06-03 22:28:00,968 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 127 selfloop transitions, 6 changer transitions 21/158 dead transitions. [2024-06-03 22:28:00,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 158 transitions, 1527 flow [2024-06-03 22:28:00,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:28:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:28:00,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-03 22:28:00,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-03 22:28:00,969 INFO L175 Difference]: Start difference. First operand has 209 places, 142 transitions, 1171 flow. Second operand 9 states and 117 transitions. [2024-06-03 22:28:00,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 158 transitions, 1527 flow [2024-06-03 22:28:01,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 158 transitions, 1413 flow, removed 4 selfloop flow, removed 13 redundant places. [2024-06-03 22:28:01,038 INFO L231 Difference]: Finished difference. Result has 202 places, 136 transitions, 1039 flow [2024-06-03 22:28:01,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1039, PETRI_PLACES=202, PETRI_TRANSITIONS=136} [2024-06-03 22:28:01,039 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 170 predicate places. [2024-06-03 22:28:01,039 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 136 transitions, 1039 flow [2024-06-03 22:28:01,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:01,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:01,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:28:01,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-03 22:28:01,040 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-03 22:28:01,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:01,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1648445875, now seen corresponding path program 2 times [2024-06-03 22:28:01,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:01,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762859013] [2024-06-03 22:28:01,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:01,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:07,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:07,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:07,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762859013] [2024-06-03 22:28:07,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762859013] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:07,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:07,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:28:07,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831247602] [2024-06-03 22:28:07,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:07,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:28:07,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:07,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:28:07,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:28:07,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:28:07,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 136 transitions, 1039 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:07,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:07,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:28:07,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:08,234 INFO L124 PetriNetUnfolderBase]: 330/722 cut-off events. [2024-06-03 22:28:08,234 INFO L125 PetriNetUnfolderBase]: For 33993/33993 co-relation queries the response was YES. [2024-06-03 22:28:08,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3209 conditions, 722 events. 330/722 cut-off events. For 33993/33993 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4016 event pairs, 60 based on Foata normal form. 6/725 useless extension candidates. Maximal degree in co-relation 3118. Up to 500 conditions per place. [2024-06-03 22:28:08,240 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 92 selfloop transitions, 45 changer transitions 10/151 dead transitions. [2024-06-03 22:28:08,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 151 transitions, 1377 flow [2024-06-03 22:28:08,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:28:08,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:28:08,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2024-06-03 22:28:08,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40771349862258954 [2024-06-03 22:28:08,241 INFO L175 Difference]: Start difference. First operand has 202 places, 136 transitions, 1039 flow. Second operand 11 states and 148 transitions. [2024-06-03 22:28:08,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 151 transitions, 1377 flow [2024-06-03 22:28:08,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 151 transitions, 1351 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-03 22:28:08,310 INFO L231 Difference]: Finished difference. Result has 194 places, 133 transitions, 1085 flow [2024-06-03 22:28:08,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1013, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1085, PETRI_PLACES=194, PETRI_TRANSITIONS=133} [2024-06-03 22:28:08,311 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 162 predicate places. [2024-06-03 22:28:08,311 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 133 transitions, 1085 flow [2024-06-03 22:28:08,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:08,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:08,311 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:28:08,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-03 22:28:08,312 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-03 22:28:08,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:08,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1774962761, now seen corresponding path program 3 times [2024-06-03 22:28:08,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:08,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061172680] [2024-06-03 22:28:08,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:08,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:15,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-03 22:28:15,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:15,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061172680] [2024-06-03 22:28:15,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061172680] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:15,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:15,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:28:15,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799778026] [2024-06-03 22:28:15,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:15,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:28:15,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:15,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:28:15,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:28:15,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:28:15,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 133 transitions, 1085 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:15,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:15,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:28:15,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:15,658 INFO L124 PetriNetUnfolderBase]: 323/709 cut-off events. [2024-06-03 22:28:15,658 INFO L125 PetriNetUnfolderBase]: For 29122/29122 co-relation queries the response was YES. [2024-06-03 22:28:15,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3192 conditions, 709 events. 323/709 cut-off events. For 29122/29122 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3902 event pairs, 58 based on Foata normal form. 6/712 useless extension candidates. Maximal degree in co-relation 3106. Up to 482 conditions per place. [2024-06-03 22:28:15,663 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 91 selfloop transitions, 41 changer transitions 13/149 dead transitions. [2024-06-03 22:28:15,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 149 transitions, 1421 flow [2024-06-03 22:28:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:28:15,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:28:15,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-03 22:28:15,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4049586776859504 [2024-06-03 22:28:15,664 INFO L175 Difference]: Start difference. First operand has 194 places, 133 transitions, 1085 flow. Second operand 11 states and 147 transitions. [2024-06-03 22:28:15,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 149 transitions, 1421 flow [2024-06-03 22:28:15,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 149 transitions, 1325 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-03 22:28:15,749 INFO L231 Difference]: Finished difference. Result has 191 places, 129 transitions, 1047 flow [2024-06-03 22:28:15,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=989, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1047, PETRI_PLACES=191, PETRI_TRANSITIONS=129} [2024-06-03 22:28:15,750 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 159 predicate places. [2024-06-03 22:28:15,750 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 129 transitions, 1047 flow [2024-06-03 22:28:15,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:15,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:15,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:28:15,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-03 22:28:15,751 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-03 22:28:15,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:15,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1383312811, now seen corresponding path program 4 times [2024-06-03 22:28:15,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:15,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770562399] [2024-06-03 22:28:15,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:15,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:22,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:22,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:22,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770562399] [2024-06-03 22:28:22,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770562399] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:22,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:22,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:28:22,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040347833] [2024-06-03 22:28:22,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:22,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:28:22,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:22,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:28:22,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:28:22,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:28:22,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 129 transitions, 1047 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:22,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:22,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:28:22,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:23,229 INFO L124 PetriNetUnfolderBase]: 312/684 cut-off events. [2024-06-03 22:28:23,229 INFO L125 PetriNetUnfolderBase]: For 28231/28231 co-relation queries the response was YES. [2024-06-03 22:28:23,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3089 conditions, 684 events. 312/684 cut-off events. For 28231/28231 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3703 event pairs, 52 based on Foata normal form. 6/687 useless extension candidates. Maximal degree in co-relation 3004. Up to 436 conditions per place. [2024-06-03 22:28:23,234 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 90 selfloop transitions, 40 changer transitions 12/146 dead transitions. [2024-06-03 22:28:23,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 146 transitions, 1379 flow [2024-06-03 22:28:23,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:28:23,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:28:23,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-03 22:28:23,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4049586776859504 [2024-06-03 22:28:23,235 INFO L175 Difference]: Start difference. First operand has 191 places, 129 transitions, 1047 flow. Second operand 11 states and 147 transitions. [2024-06-03 22:28:23,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 146 transitions, 1379 flow [2024-06-03 22:28:23,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 146 transitions, 1289 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-03 22:28:23,288 INFO L231 Difference]: Finished difference. Result has 186 places, 125 transitions, 1013 flow [2024-06-03 22:28:23,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1013, PETRI_PLACES=186, PETRI_TRANSITIONS=125} [2024-06-03 22:28:23,289 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 154 predicate places. [2024-06-03 22:28:23,289 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 125 transitions, 1013 flow [2024-06-03 22:28:23,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:23,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:23,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:28:23,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-03 22:28:23,290 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-03 22:28:23,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:23,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1560444331, now seen corresponding path program 5 times [2024-06-03 22:28:23,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:23,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154913706] [2024-06-03 22:28:23,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:23,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:30,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:30,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:30,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154913706] [2024-06-03 22:28:30,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154913706] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:30,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:30,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:28:30,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541071787] [2024-06-03 22:28:30,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:30,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:28:30,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:30,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:28:30,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:28:30,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:28:30,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 125 transitions, 1013 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:30,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:30,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:28:30,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:30,865 INFO L124 PetriNetUnfolderBase]: 298/660 cut-off events. [2024-06-03 22:28:30,865 INFO L125 PetriNetUnfolderBase]: For 26306/26306 co-relation queries the response was YES. [2024-06-03 22:28:30,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2983 conditions, 660 events. 298/660 cut-off events. For 26306/26306 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3567 event pairs, 54 based on Foata normal form. 6/663 useless extension candidates. Maximal degree in co-relation 2900. Up to 446 conditions per place. [2024-06-03 22:28:30,870 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 88 selfloop transitions, 38 changer transitions 10/140 dead transitions. [2024-06-03 22:28:30,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 140 transitions, 1329 flow [2024-06-03 22:28:30,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:28:30,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:28:30,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-03 22:28:30,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39118457300275483 [2024-06-03 22:28:30,874 INFO L175 Difference]: Start difference. First operand has 186 places, 125 transitions, 1013 flow. Second operand 11 states and 142 transitions. [2024-06-03 22:28:30,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 140 transitions, 1329 flow [2024-06-03 22:28:30,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 140 transitions, 1243 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-03 22:28:30,935 INFO L231 Difference]: Finished difference. Result has 181 places, 122 transitions, 985 flow [2024-06-03 22:28:30,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=985, PETRI_PLACES=181, PETRI_TRANSITIONS=122} [2024-06-03 22:28:30,935 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 149 predicate places. [2024-06-03 22:28:30,935 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 122 transitions, 985 flow [2024-06-03 22:28:30,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:30,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:30,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:28:30,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-03 22:28:30,936 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-03 22:28:30,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:30,936 INFO L85 PathProgramCache]: Analyzing trace with hash -979700147, now seen corresponding path program 6 times [2024-06-03 22:28:30,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:30,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002883409] [2024-06-03 22:28:30,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:30,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:37,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:37,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:37,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002883409] [2024-06-03 22:28:37,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002883409] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:37,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:37,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:28:37,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472380083] [2024-06-03 22:28:37,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:37,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:28:37,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:37,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:28:37,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:28:37,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:28:37,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 122 transitions, 985 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:37,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:37,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:28:37,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:37,923 INFO L124 PetriNetUnfolderBase]: 291/647 cut-off events. [2024-06-03 22:28:37,923 INFO L125 PetriNetUnfolderBase]: For 24510/24510 co-relation queries the response was YES. [2024-06-03 22:28:37,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2903 conditions, 647 events. 291/647 cut-off events. For 24510/24510 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3478 event pairs, 54 based on Foata normal form. 6/650 useless extension candidates. Maximal degree in co-relation 2822. Up to 436 conditions per place. [2024-06-03 22:28:37,927 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 86 selfloop transitions, 37 changer transitions 10/137 dead transitions. [2024-06-03 22:28:37,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 137 transitions, 1295 flow [2024-06-03 22:28:37,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:28:37,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:28:37,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-03 22:28:37,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022038567493113 [2024-06-03 22:28:37,928 INFO L175 Difference]: Start difference. First operand has 181 places, 122 transitions, 985 flow. Second operand 11 states and 146 transitions. [2024-06-03 22:28:37,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 137 transitions, 1295 flow [2024-06-03 22:28:37,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 137 transitions, 1215 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-03 22:28:37,974 INFO L231 Difference]: Finished difference. Result has 178 places, 119 transitions, 961 flow [2024-06-03 22:28:37,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=961, PETRI_PLACES=178, PETRI_TRANSITIONS=119} [2024-06-03 22:28:37,975 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 146 predicate places. [2024-06-03 22:28:37,975 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 119 transitions, 961 flow [2024-06-03 22:28:37,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:37,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:37,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:28:37,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-03 22:28:37,976 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-03 22:28:37,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:37,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1805289707, now seen corresponding path program 7 times [2024-06-03 22:28:37,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:37,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15905552] [2024-06-03 22:28:37,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:37,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:45,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:45,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15905552] [2024-06-03 22:28:45,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15905552] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:45,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:45,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:28:45,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908212200] [2024-06-03 22:28:45,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:45,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:28:45,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:45,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:28:45,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:28:45,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-03 22:28:45,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 119 transitions, 961 flow. Second operand has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:45,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:45,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-03 22:28:45,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:46,146 INFO L124 PetriNetUnfolderBase]: 284/632 cut-off events. [2024-06-03 22:28:46,147 INFO L125 PetriNetUnfolderBase]: For 23634/23634 co-relation queries the response was YES. [2024-06-03 22:28:46,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2834 conditions, 632 events. 284/632 cut-off events. For 23634/23634 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3375 event pairs, 52 based on Foata normal form. 6/635 useless extension candidates. Maximal degree in co-relation 2754. Up to 418 conditions per place. [2024-06-03 22:28:46,151 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 83 selfloop transitions, 35 changer transitions 13/135 dead transitions. [2024-06-03 22:28:46,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 135 transitions, 1269 flow [2024-06-03 22:28:46,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:28:46,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:28:46,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-03 22:28:46,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.371900826446281 [2024-06-03 22:28:46,152 INFO L175 Difference]: Start difference. First operand has 178 places, 119 transitions, 961 flow. Second operand 11 states and 135 transitions. [2024-06-03 22:28:46,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 135 transitions, 1269 flow [2024-06-03 22:28:46,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 135 transitions, 1191 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-03 22:28:46,201 INFO L231 Difference]: Finished difference. Result has 175 places, 115 transitions, 929 flow [2024-06-03 22:28:46,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=929, PETRI_PLACES=175, PETRI_TRANSITIONS=115} [2024-06-03 22:28:46,201 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 143 predicate places. [2024-06-03 22:28:46,201 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 115 transitions, 929 flow [2024-06-03 22:28:46,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:46,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:46,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:28:46,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-03 22:28:46,202 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-03 22:28:46,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:46,202 INFO L85 PathProgramCache]: Analyzing trace with hash 50466889, now seen corresponding path program 8 times [2024-06-03 22:28:46,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:46,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491333375] [2024-06-03 22:28:46,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:46,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:53,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:53,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:53,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491333375] [2024-06-03 22:28:53,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491333375] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:53,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:53,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:28:53,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554932520] [2024-06-03 22:28:53,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:53,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:28:53,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:53,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:28:53,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:28:53,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:28:53,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 115 transitions, 929 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:53,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:53,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:28:53,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:54,040 INFO L124 PetriNetUnfolderBase]: 273/611 cut-off events. [2024-06-03 22:28:54,040 INFO L125 PetriNetUnfolderBase]: For 22778/22778 co-relation queries the response was YES. [2024-06-03 22:28:54,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2745 conditions, 611 events. 273/611 cut-off events. For 22778/22778 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3231 event pairs, 50 based on Foata normal form. 6/614 useless extension candidates. Maximal degree in co-relation 2666. Up to 400 conditions per place. [2024-06-03 22:28:54,044 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 79 selfloop transitions, 31 changer transitions 17/131 dead transitions. [2024-06-03 22:28:54,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 131 transitions, 1229 flow [2024-06-03 22:28:54,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:28:54,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:28:54,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-03 22:28:54,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39118457300275483 [2024-06-03 22:28:54,045 INFO L175 Difference]: Start difference. First operand has 175 places, 115 transitions, 929 flow. Second operand 11 states and 142 transitions. [2024-06-03 22:28:54,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 131 transitions, 1229 flow [2024-06-03 22:28:54,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 131 transitions, 1153 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-03 22:28:54,092 INFO L231 Difference]: Finished difference. Result has 170 places, 108 transitions, 869 flow [2024-06-03 22:28:54,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=869, PETRI_PLACES=170, PETRI_TRANSITIONS=108} [2024-06-03 22:28:54,093 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 138 predicate places. [2024-06-03 22:28:54,093 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 108 transitions, 869 flow [2024-06-03 22:28:54,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:54,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:54,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:28:54,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-03 22:28:54,094 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-03 22:28:54,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:54,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1512417085, now seen corresponding path program 9 times [2024-06-03 22:28:54,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:54,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573573041] [2024-06-03 22:28:54,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:54,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:01,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:01,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:01,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573573041] [2024-06-03 22:29:01,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573573041] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:01,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:01,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:29:01,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438161141] [2024-06-03 22:29:01,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:01,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:29:01,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:01,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:29:01,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:29:01,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:29:01,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 108 transitions, 869 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:01,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:01,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:29:01,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:02,226 INFO L124 PetriNetUnfolderBase]: 257/585 cut-off events. [2024-06-03 22:29:02,227 INFO L125 PetriNetUnfolderBase]: For 21106/21106 co-relation queries the response was YES. [2024-06-03 22:29:02,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2617 conditions, 585 events. 257/585 cut-off events. For 21106/21106 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3090 event pairs, 46 based on Foata normal form. 6/588 useless extension candidates. Maximal degree in co-relation 2540. Up to 374 conditions per place. [2024-06-03 22:29:02,230 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 76 selfloop transitions, 26 changer transitions 19/125 dead transitions. [2024-06-03 22:29:02,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 125 transitions, 1159 flow [2024-06-03 22:29:02,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:29:02,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:29:02,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-03 22:29:02,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39944903581267216 [2024-06-03 22:29:02,231 INFO L175 Difference]: Start difference. First operand has 170 places, 108 transitions, 869 flow. Second operand 11 states and 145 transitions. [2024-06-03 22:29:02,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 125 transitions, 1159 flow [2024-06-03 22:29:02,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 125 transitions, 1091 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-03 22:29:02,272 INFO L231 Difference]: Finished difference. Result has 164 places, 100 transitions, 798 flow [2024-06-03 22:29:02,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=798, PETRI_PLACES=164, PETRI_TRANSITIONS=100} [2024-06-03 22:29:02,272 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 132 predicate places. [2024-06-03 22:29:02,272 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 100 transitions, 798 flow [2024-06-03 22:29:02,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:02,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:02,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:02,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-03 22:29:02,273 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-03 22:29:02,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:02,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1273084937, now seen corresponding path program 10 times [2024-06-03 22:29:02,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:02,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957213065] [2024-06-03 22:29:02,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:02,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:10,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:10,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:10,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957213065] [2024-06-03 22:29:10,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957213065] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:10,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:10,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:29:10,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983384493] [2024-06-03 22:29:10,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:10,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:29:10,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:10,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:29:10,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:29:10,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:29:10,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 100 transitions, 798 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:10,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:10,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:29:10,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:10,603 INFO L124 PetriNetUnfolderBase]: 234/538 cut-off events. [2024-06-03 22:29:10,603 INFO L125 PetriNetUnfolderBase]: For 19468/19468 co-relation queries the response was YES. [2024-06-03 22:29:10,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2401 conditions, 538 events. 234/538 cut-off events. For 19468/19468 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2799 event pairs, 37 based on Foata normal form. 6/541 useless extension candidates. Maximal degree in co-relation 2326. Up to 225 conditions per place. [2024-06-03 22:29:10,607 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 59 selfloop transitions, 34 changer transitions 21/118 dead transitions. [2024-06-03 22:29:10,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 118 transitions, 1076 flow [2024-06-03 22:29:10,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:29:10,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:29:10,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-03 22:29:10,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022038567493113 [2024-06-03 22:29:10,608 INFO L175 Difference]: Start difference. First operand has 164 places, 100 transitions, 798 flow. Second operand 11 states and 146 transitions. [2024-06-03 22:29:10,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 118 transitions, 1076 flow [2024-06-03 22:29:10,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 118 transitions, 1014 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-03 22:29:10,646 INFO L231 Difference]: Finished difference. Result has 157 places, 89 transitions, 727 flow [2024-06-03 22:29:10,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=727, PETRI_PLACES=157, PETRI_TRANSITIONS=89} [2024-06-03 22:29:10,647 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 125 predicate places. [2024-06-03 22:29:10,647 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 89 transitions, 727 flow [2024-06-03 22:29:10,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:10,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:10,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:10,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-03 22:29:10,648 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-03 22:29:10,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:10,648 INFO L85 PathProgramCache]: Analyzing trace with hash -90449041, now seen corresponding path program 11 times [2024-06-03 22:29:10,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:10,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905803861] [2024-06-03 22:29:10,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:10,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:18,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:18,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:18,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905803861] [2024-06-03 22:29:18,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905803861] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:18,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:18,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:29:18,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334408484] [2024-06-03 22:29:18,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:18,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:29:18,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:18,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:29:18,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:29:18,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:29:18,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 89 transitions, 727 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:18,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:18,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:29:18,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:18,519 INFO L124 PetriNetUnfolderBase]: 202/466 cut-off events. [2024-06-03 22:29:18,519 INFO L125 PetriNetUnfolderBase]: For 17128/17128 co-relation queries the response was YES. [2024-06-03 22:29:18,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2152 conditions, 466 events. 202/466 cut-off events. For 17128/17128 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2321 event pairs, 33 based on Foata normal form. 6/469 useless extension candidates. Maximal degree in co-relation 2093. Up to 221 conditions per place. [2024-06-03 22:29:18,522 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 55 selfloop transitions, 35 changer transitions 12/106 dead transitions. [2024-06-03 22:29:18,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 106 transitions, 979 flow [2024-06-03 22:29:18,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:29:18,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:29:18,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-03 22:29:18,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022038567493113 [2024-06-03 22:29:18,524 INFO L175 Difference]: Start difference. First operand has 157 places, 89 transitions, 727 flow. Second operand 11 states and 146 transitions. [2024-06-03 22:29:18,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 106 transitions, 979 flow [2024-06-03 22:29:18,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 106 transitions, 888 flow, removed 6 selfloop flow, removed 14 redundant places. [2024-06-03 22:29:18,548 INFO L231 Difference]: Finished difference. Result has 143 places, 85 transitions, 683 flow [2024-06-03 22:29:18,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=683, PETRI_PLACES=143, PETRI_TRANSITIONS=85} [2024-06-03 22:29:18,549 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 111 predicate places. [2024-06-03 22:29:18,549 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 85 transitions, 683 flow [2024-06-03 22:29:18,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:18,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:18,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:18,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-03 22:29:18,550 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-03 22:29:18,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:18,550 INFO L85 PathProgramCache]: Analyzing trace with hash 50099423, now seen corresponding path program 12 times [2024-06-03 22:29:18,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:18,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965106312] [2024-06-03 22:29:18,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:18,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:26,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:26,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:26,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965106312] [2024-06-03 22:29:26,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965106312] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:26,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:26,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:29:26,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445360693] [2024-06-03 22:29:26,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:26,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:29:26,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:26,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:29:26,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:29:26,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:29:26,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 85 transitions, 683 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:26,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:26,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:29:26,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:27,251 INFO L124 PetriNetUnfolderBase]: 188/440 cut-off events. [2024-06-03 22:29:27,251 INFO L125 PetriNetUnfolderBase]: For 13660/13660 co-relation queries the response was YES. [2024-06-03 22:29:27,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2003 conditions, 440 events. 188/440 cut-off events. For 13660/13660 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2162 event pairs, 36 based on Foata normal form. 6/443 useless extension candidates. Maximal degree in co-relation 1949. Up to 289 conditions per place. [2024-06-03 22:29:27,254 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 63 selfloop transitions, 23 changer transitions 10/100 dead transitions. [2024-06-03 22:29:27,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 100 transitions, 919 flow [2024-06-03 22:29:27,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:29:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:29:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2024-06-03 22:29:27,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39669421487603307 [2024-06-03 22:29:27,255 INFO L175 Difference]: Start difference. First operand has 143 places, 85 transitions, 683 flow. Second operand 11 states and 144 transitions. [2024-06-03 22:29:27,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 100 transitions, 919 flow [2024-06-03 22:29:27,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 100 transitions, 841 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-03 22:29:27,273 INFO L231 Difference]: Finished difference. Result has 137 places, 82 transitions, 633 flow [2024-06-03 22:29:27,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=633, PETRI_PLACES=137, PETRI_TRANSITIONS=82} [2024-06-03 22:29:27,273 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 105 predicate places. [2024-06-03 22:29:27,273 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 82 transitions, 633 flow [2024-06-03 22:29:27,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:27,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:27,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:27,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-03 22:29:27,274 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-03 22:29:27,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:27,274 INFO L85 PathProgramCache]: Analyzing trace with hash 352861279, now seen corresponding path program 13 times [2024-06-03 22:29:27,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:27,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576957300] [2024-06-03 22:29:27,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:27,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:35,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:35,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:35,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576957300] [2024-06-03 22:29:35,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576957300] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:35,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:35,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:29:35,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709042576] [2024-06-03 22:29:35,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:35,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:29:35,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:35,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:29:35,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:29:35,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:29:35,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 82 transitions, 633 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:35,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:35,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:29:35,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:35,659 INFO L124 PetriNetUnfolderBase]: 181/425 cut-off events. [2024-06-03 22:29:35,660 INFO L125 PetriNetUnfolderBase]: For 11734/11734 co-relation queries the response was YES. [2024-06-03 22:29:35,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1876 conditions, 425 events. 181/425 cut-off events. For 11734/11734 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2061 event pairs, 31 based on Foata normal form. 6/428 useless extension candidates. Maximal degree in co-relation 1825. Up to 265 conditions per place. [2024-06-03 22:29:35,662 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 62 selfloop transitions, 22 changer transitions 10/98 dead transitions. [2024-06-03 22:29:35,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 98 transitions, 867 flow [2024-06-03 22:29:35,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:29:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:29:35,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-03 22:29:35,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39944903581267216 [2024-06-03 22:29:35,663 INFO L175 Difference]: Start difference. First operand has 137 places, 82 transitions, 633 flow. Second operand 11 states and 145 transitions. [2024-06-03 22:29:35,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 98 transitions, 867 flow [2024-06-03 22:29:35,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 98 transitions, 817 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-03 22:29:35,679 INFO L231 Difference]: Finished difference. Result has 134 places, 78 transitions, 604 flow [2024-06-03 22:29:35,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=604, PETRI_PLACES=134, PETRI_TRANSITIONS=78} [2024-06-03 22:29:35,679 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 102 predicate places. [2024-06-03 22:29:35,679 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 78 transitions, 604 flow [2024-06-03 22:29:35,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:35,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:35,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:35,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-03 22:29:35,680 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-03 22:29:35,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:35,680 INFO L85 PathProgramCache]: Analyzing trace with hash 936975549, now seen corresponding path program 14 times [2024-06-03 22:29:35,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:35,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924419382] [2024-06-03 22:29:35,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:35,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:42,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-03 22:29:42,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:42,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924419382] [2024-06-03 22:29:42,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924419382] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:42,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:42,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:29:42,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948599702] [2024-06-03 22:29:42,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:42,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:29:42,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:42,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:29:42,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:29:42,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:29:42,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 78 transitions, 604 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:42,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:42,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:29:42,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:42,592 INFO L124 PetriNetUnfolderBase]: 166/390 cut-off events. [2024-06-03 22:29:42,592 INFO L125 PetriNetUnfolderBase]: For 8532/8532 co-relation queries the response was YES. [2024-06-03 22:29:42,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1765 conditions, 390 events. 166/390 cut-off events. For 8532/8532 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1849 event pairs, 34 based on Foata normal form. 2/389 useless extension candidates. Maximal degree in co-relation 1715. Up to 265 conditions per place. [2024-06-03 22:29:42,594 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 63 selfloop transitions, 25 changer transitions 0/92 dead transitions. [2024-06-03 22:29:42,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 92 transitions, 822 flow [2024-06-03 22:29:42,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:29:42,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:29:42,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-03 22:29:42,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39118457300275483 [2024-06-03 22:29:42,595 INFO L175 Difference]: Start difference. First operand has 134 places, 78 transitions, 604 flow. Second operand 11 states and 142 transitions. [2024-06-03 22:29:42,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 92 transitions, 822 flow [2024-06-03 22:29:42,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 92 transitions, 772 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-03 22:29:42,610 INFO L231 Difference]: Finished difference. Result has 129 places, 79 transitions, 622 flow [2024-06-03 22:29:42,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=622, PETRI_PLACES=129, PETRI_TRANSITIONS=79} [2024-06-03 22:29:42,610 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 97 predicate places. [2024-06-03 22:29:42,611 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 79 transitions, 622 flow [2024-06-03 22:29:42,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:42,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:42,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:42,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-03 22:29:42,612 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-03 22:29:42,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:42,612 INFO L85 PathProgramCache]: Analyzing trace with hash -950636561, now seen corresponding path program 15 times [2024-06-03 22:29:42,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:42,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568056134] [2024-06-03 22:29:42,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:42,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:49,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:49,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:49,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568056134] [2024-06-03 22:29:49,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568056134] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:49,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:49,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:29:49,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297359498] [2024-06-03 22:29:49,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:49,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:29:49,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:49,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:29:49,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:29:49,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:29:49,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 79 transitions, 622 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:49,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:49,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:29:49,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:50,366 INFO L124 PetriNetUnfolderBase]: 174/410 cut-off events. [2024-06-03 22:29:50,366 INFO L125 PetriNetUnfolderBase]: For 10008/10008 co-relation queries the response was YES. [2024-06-03 22:29:50,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1825 conditions, 410 events. 174/410 cut-off events. For 10008/10008 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1959 event pairs, 36 based on Foata normal form. 6/413 useless extension candidates. Maximal degree in co-relation 1777. Up to 269 conditions per place. [2024-06-03 22:29:50,368 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 60 selfloop transitions, 21 changer transitions 10/95 dead transitions. [2024-06-03 22:29:50,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 95 transitions, 852 flow [2024-06-03 22:29:50,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:29:50,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:29:50,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 155 transitions. [2024-06-03 22:29:50,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39141414141414144 [2024-06-03 22:29:50,369 INFO L175 Difference]: Start difference. First operand has 129 places, 79 transitions, 622 flow. Second operand 12 states and 155 transitions. [2024-06-03 22:29:50,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 95 transitions, 852 flow [2024-06-03 22:29:50,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 95 transitions, 794 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-03 22:29:50,383 INFO L231 Difference]: Finished difference. Result has 132 places, 76 transitions, 589 flow [2024-06-03 22:29:50,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=589, PETRI_PLACES=132, PETRI_TRANSITIONS=76} [2024-06-03 22:29:50,383 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 100 predicate places. [2024-06-03 22:29:50,383 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 76 transitions, 589 flow [2024-06-03 22:29:50,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:50,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:50,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:50,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-03 22:29:50,384 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-03 22:29:50,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:50,384 INFO L85 PathProgramCache]: Analyzing trace with hash 80253389, now seen corresponding path program 16 times [2024-06-03 22:29:50,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:50,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649363056] [2024-06-03 22:29:50,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:50,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:57,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:57,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:57,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649363056] [2024-06-03 22:29:57,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649363056] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:57,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:57,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:29:57,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28562606] [2024-06-03 22:29:57,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:57,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:29:57,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:57,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:29:57,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:29:58,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:29:58,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 76 transitions, 589 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:58,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:58,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:29:58,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:58,361 INFO L124 PetriNetUnfolderBase]: 167/397 cut-off events. [2024-06-03 22:29:58,361 INFO L125 PetriNetUnfolderBase]: For 10500/10500 co-relation queries the response was YES. [2024-06-03 22:29:58,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1760 conditions, 397 events. 167/397 cut-off events. For 10500/10500 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1866 event pairs, 34 based on Foata normal form. 6/400 useless extension candidates. Maximal degree in co-relation 1711. Up to 245 conditions per place. [2024-06-03 22:29:58,363 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 57 selfloop transitions, 22 changer transitions 9/92 dead transitions. [2024-06-03 22:29:58,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 92 transitions, 813 flow [2024-06-03 22:29:58,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:29:58,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:29:58,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-03 22:29:58,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39944903581267216 [2024-06-03 22:29:58,364 INFO L175 Difference]: Start difference. First operand has 132 places, 76 transitions, 589 flow. Second operand 11 states and 145 transitions. [2024-06-03 22:29:58,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 92 transitions, 813 flow [2024-06-03 22:29:58,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 92 transitions, 767 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-03 22:29:58,380 INFO L231 Difference]: Finished difference. Result has 128 places, 73 transitions, 569 flow [2024-06-03 22:29:58,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=569, PETRI_PLACES=128, PETRI_TRANSITIONS=73} [2024-06-03 22:29:58,381 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 96 predicate places. [2024-06-03 22:29:58,381 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 73 transitions, 569 flow [2024-06-03 22:29:58,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:58,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:58,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:58,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-03 22:29:58,382 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-03 22:29:58,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:58,382 INFO L85 PathProgramCache]: Analyzing trace with hash 319757167, now seen corresponding path program 17 times [2024-06-03 22:29:58,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:58,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427556224] [2024-06-03 22:29:58,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:58,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:05,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:05,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:05,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427556224] [2024-06-03 22:30:05,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427556224] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:05,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:05,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:30:05,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660501812] [2024-06-03 22:30:05,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:05,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:30:05,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:05,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:30:05,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:30:06,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:30:06,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 73 transitions, 569 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:06,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:06,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:30:06,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:06,576 INFO L124 PetriNetUnfolderBase]: 157/377 cut-off events. [2024-06-03 22:30:06,577 INFO L125 PetriNetUnfolderBase]: For 9962/9962 co-relation queries the response was YES. [2024-06-03 22:30:06,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1687 conditions, 377 events. 157/377 cut-off events. For 9962/9962 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1757 event pairs, 34 based on Foata normal form. 6/380 useless extension candidates. Maximal degree in co-relation 1639. Up to 241 conditions per place. [2024-06-03 22:30:06,579 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 57 selfloop transitions, 18 changer transitions 10/89 dead transitions. [2024-06-03 22:30:06,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 89 transitions, 787 flow [2024-06-03 22:30:06,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:30:06,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:30:06,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 152 transitions. [2024-06-03 22:30:06,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3838383838383838 [2024-06-03 22:30:06,580 INFO L175 Difference]: Start difference. First operand has 128 places, 73 transitions, 569 flow. Second operand 12 states and 152 transitions. [2024-06-03 22:30:06,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 89 transitions, 787 flow [2024-06-03 22:30:06,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 89 transitions, 737 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-03 22:30:06,593 INFO L231 Difference]: Finished difference. Result has 125 places, 70 transitions, 538 flow [2024-06-03 22:30:06,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=538, PETRI_PLACES=125, PETRI_TRANSITIONS=70} [2024-06-03 22:30:06,593 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 93 predicate places. [2024-06-03 22:30:06,594 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 70 transitions, 538 flow [2024-06-03 22:30:06,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:06,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:06,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:06,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-03 22:30:06,594 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-03 22:30:06,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:06,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1393251115, now seen corresponding path program 18 times [2024-06-03 22:30:06,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:06,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726656971] [2024-06-03 22:30:06,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:06,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:13,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:13,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:13,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726656971] [2024-06-03 22:30:13,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726656971] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:13,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:13,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:30:13,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817722977] [2024-06-03 22:30:13,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:13,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:30:13,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:13,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:30:13,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:30:14,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:30:14,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 70 transitions, 538 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:14,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:14,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:30:14,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:14,713 INFO L124 PetriNetUnfolderBase]: 150/362 cut-off events. [2024-06-03 22:30:14,714 INFO L125 PetriNetUnfolderBase]: For 8840/8840 co-relation queries the response was YES. [2024-06-03 22:30:14,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 362 events. 150/362 cut-off events. For 8840/8840 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1672 event pairs, 34 based on Foata normal form. 6/365 useless extension candidates. Maximal degree in co-relation 1559. Up to 231 conditions per place. [2024-06-03 22:30:14,716 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 55 selfloop transitions, 17 changer transitions 10/86 dead transitions. [2024-06-03 22:30:14,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 86 transitions, 750 flow [2024-06-03 22:30:14,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:30:14,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:30:14,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 153 transitions. [2024-06-03 22:30:14,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-03 22:30:14,717 INFO L175 Difference]: Start difference. First operand has 125 places, 70 transitions, 538 flow. Second operand 12 states and 153 transitions. [2024-06-03 22:30:14,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 86 transitions, 750 flow [2024-06-03 22:30:14,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 86 transitions, 710 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-03 22:30:14,728 INFO L231 Difference]: Finished difference. Result has 122 places, 67 transitions, 514 flow [2024-06-03 22:30:14,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=514, PETRI_PLACES=122, PETRI_TRANSITIONS=67} [2024-06-03 22:30:14,729 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 90 predicate places. [2024-06-03 22:30:14,729 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 67 transitions, 514 flow [2024-06-03 22:30:14,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:14,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:14,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:14,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-03 22:30:14,729 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-03 22:30:14,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:14,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1386822025, now seen corresponding path program 19 times [2024-06-03 22:30:14,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:14,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677565255] [2024-06-03 22:30:14,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:14,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:23,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:23,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:23,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677565255] [2024-06-03 22:30:23,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677565255] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:23,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:23,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:30:23,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080231179] [2024-06-03 22:30:23,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:23,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:30:23,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:23,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:30:23,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:30:23,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:30:23,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 67 transitions, 514 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:23,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:23,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:30:23,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:23,782 INFO L124 PetriNetUnfolderBase]: 143/351 cut-off events. [2024-06-03 22:30:23,782 INFO L125 PetriNetUnfolderBase]: For 8332/8332 co-relation queries the response was YES. [2024-06-03 22:30:23,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1544 conditions, 351 events. 143/351 cut-off events. For 8332/8332 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1593 event pairs, 32 based on Foata normal form. 6/354 useless extension candidates. Maximal degree in co-relation 1499. Up to 213 conditions per place. [2024-06-03 22:30:23,784 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 52 selfloop transitions, 15 changer transitions 13/84 dead transitions. [2024-06-03 22:30:23,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 84 transitions, 724 flow [2024-06-03 22:30:23,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:30:23,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:30:23,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 153 transitions. [2024-06-03 22:30:23,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-03 22:30:23,785 INFO L175 Difference]: Start difference. First operand has 122 places, 67 transitions, 514 flow. Second operand 12 states and 153 transitions. [2024-06-03 22:30:23,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 84 transitions, 724 flow [2024-06-03 22:30:23,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 84 transitions, 686 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-03 22:30:23,796 INFO L231 Difference]: Finished difference. Result has 119 places, 63 transitions, 483 flow [2024-06-03 22:30:23,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=483, PETRI_PLACES=119, PETRI_TRANSITIONS=63} [2024-06-03 22:30:23,797 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 87 predicate places. [2024-06-03 22:30:23,797 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 63 transitions, 483 flow [2024-06-03 22:30:23,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:23,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:23,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:23,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-03 22:30:23,798 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-03 22:30:23,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:23,798 INFO L85 PathProgramCache]: Analyzing trace with hash 86682479, now seen corresponding path program 20 times [2024-06-03 22:30:23,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:23,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030180823] [2024-06-03 22:30:23,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:23,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15