./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi000_power.opt_pso.opt_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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/rfi000_power.opt_pso.opt_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi000_power.opt_pso.opt_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-03 22:14:46,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 22:14:46,488 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 22:14:46,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 22:14:46,498 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 22:14:46,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 22:14:46,523 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 22:14:46,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 22:14:46,524 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 22:14:46,527 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 22:14:46,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 22:14:46,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 22:14:46,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 22:14:46,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 22:14:46,529 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 22:14:46,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 22:14:46,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 22:14:46,530 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 22:14:46,530 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 22:14:46,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 22:14:46,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 22:14:46,532 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 22:14:46,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 22:14:46,532 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 22:14:46,532 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 22:14:46,533 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 22:14:46,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 22:14:46,533 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 22:14:46,534 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 22:14:46,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 22:14:46,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 22:14:46,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 22:14:46,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:14:46,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 22:14:46,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 22:14:46,535 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 22:14:46,536 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 22:14:46,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 22:14:46,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 22:14:46,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 22:14:46,536 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 22:14:46,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 22:14:46,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 22:14:46,537 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:14:46,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 22:14:46,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 22:14:46,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 22:14:46,728 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 22:14:46,728 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 22:14:46,729 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2024-06-03 22:14:47,796 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 22:14:47,962 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 22:14:47,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2024-06-03 22:14:47,987 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab17ae208/bdcd5d8b71c84a87969d437bb14250a6/FLAGa499907d3 [2024-06-03 22:14:47,997 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab17ae208/bdcd5d8b71c84a87969d437bb14250a6 [2024-06-03 22:14:47,999 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 22:14:48,000 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 22:14:48,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi000_power.opt_pso.opt_rmo.opt.yml/witness.yml [2024-06-03 22:14:48,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 22:14:48,138 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 22:14:48,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 22:14:48,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 22:14:48,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 22:14:48,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:14:47" (1/2) ... [2024-06-03 22:14:48,144 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6666602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:14:48, skipping insertion in model container [2024-06-03 22:14:48,144 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:14:47" (1/2) ... [2024-06-03 22:14:48,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@109898df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:14:48, skipping insertion in model container [2024-06-03 22:14:48,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:14:48" (2/2) ... [2024-06-03 22:14:48,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6666602 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:14:48, skipping insertion in model container [2024-06-03 22:14:48,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:14:48" (2/2) ... [2024-06-03 22:14:48,147 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 22:14:48,240 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 22:14:48,241 INFO L97 edCorrectnessWitness]: Location invariant before [L803-L803] (((((((((((((((! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p1_EAX <= 127) && __unbuffered_p1_EBX <= 127) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 2) && __unbuffered_p1_EBX <= 127) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 2) && __unbuffered_p1_EAX <= 127) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-03 22:14:48,242 INFO L97 edCorrectnessWitness]: Location invariant before [L804-L804] (((((((((((((((! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p1_EAX <= 127) && __unbuffered_p1_EBX <= 127) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 2) && __unbuffered_p1_EBX <= 127) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 2) && __unbuffered_p1_EAX <= 127) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-03 22:14:48,242 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 22:14:48,242 INFO L106 edCorrectnessWitness]: ghost_update [L801-L801] multithreaded = 1; [2024-06-03 22:14:48,280 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 22:14:48,532 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:14:48,541 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 22:14:48,800 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:14:48,827 INFO L206 MainTranslator]: Completed translation [2024-06-03 22:14:48,828 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:14:48 WrapperNode [2024-06-03 22:14:48,828 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 22:14:48,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 22:14:48,829 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 22:14:48,829 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 22:14:48,834 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:14:48" (1/1) ... [2024-06-03 22:14:48,864 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:14:48" (1/1) ... [2024-06-03 22:14:48,927 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-06-03 22:14:48,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 22:14:48,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 22:14:48,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 22:14:48,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 22:14:48,937 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:14:48" (1/1) ... [2024-06-03 22:14:48,938 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:14:48" (1/1) ... [2024-06-03 22:14:48,957 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:14:48" (1/1) ... [2024-06-03 22:14:48,992 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:14:48,993 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:14:48" (1/1) ... [2024-06-03 22:14:48,993 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:14:48" (1/1) ... [2024-06-03 22:14:49,019 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:14:48" (1/1) ... [2024-06-03 22:14:49,021 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:14:48" (1/1) ... [2024-06-03 22:14:49,033 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:14:48" (1/1) ... [2024-06-03 22:14:49,036 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:14:48" (1/1) ... [2024-06-03 22:14:49,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 22:14:49,055 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 22:14:49,055 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 22:14:49,055 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 22:14:49,056 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:14:48" (1/1) ... [2024-06-03 22:14:49,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:14:49,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 22:14:49,079 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:14:49,099 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:14:49,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 22:14:49,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 22:14:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 22:14:49,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 22:14:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 22:14:49,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 22:14:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 22:14:49,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 22:14:49,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 22:14:49,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 22:14:49,114 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:14:49,233 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 22:14:49,235 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 22:14:49,890 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 22:14:49,891 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 22:14:50,047 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 22:14:50,048 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 22:14:50,051 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:14:50 BoogieIcfgContainer [2024-06-03 22:14:50,051 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 22:14:50,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 22:14:50,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 22:14:50,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 22:14:50,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 10:14:47" (1/4) ... [2024-06-03 22:14:50,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df7db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:14:50, skipping insertion in model container [2024-06-03 22:14:50,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:14:48" (2/4) ... [2024-06-03 22:14:50,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df7db and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:14:50, skipping insertion in model container [2024-06-03 22:14:50,061 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:14:48" (3/4) ... [2024-06-03 22:14:50,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df7db and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:14:50, skipping insertion in model container [2024-06-03 22:14:50,061 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:14:50" (4/4) ... [2024-06-03 22:14:50,062 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt_pso.opt_rmo.opt.i [2024-06-03 22:14:50,075 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 22:14:50,075 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-03 22:14:50,076 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 22:14:50,136 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 22:14:50,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 72 flow [2024-06-03 22:14:50,203 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-06-03 22:14:50,204 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:14:50,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 22:14:50,206 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 72 flow [2024-06-03 22:14:50,208 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 24 transitions, 54 flow [2024-06-03 22:14:50,219 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 22:14:50,259 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;@1b0a9c5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 22:14:50,260 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-03 22:14:50,266 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 22:14:50,267 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 22:14:50,267 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:14:50,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:14:50,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 22:14:50,268 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:14:50,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:14:50,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1600259855, now seen corresponding path program 1 times [2024-06-03 22:14:50,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:14:50,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888205255] [2024-06-03 22:14:50,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:14:50,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:14:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:14:53,668 INFO 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:14:53,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:14:53,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888205255] [2024-06-03 22:14:53,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888205255] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:14:53,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:14:53,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 22:14:53,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289791038] [2024-06-03 22:14:53,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:14:53,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 22:14:53,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:14:53,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 22:14:53,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 22:14:53,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-03 22:14:53,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:53,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:14:53,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-03 22:14:53,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:14:53,974 INFO L124 PetriNetUnfolderBase]: 162/317 cut-off events. [2024-06-03 22:14:53,975 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-03 22:14:53,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 317 events. 162/317 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1162 event pairs, 97 based on Foata normal form. 1/303 useless extension candidates. Maximal degree in co-relation 616. Up to 288 conditions per place. [2024-06-03 22:14:53,980 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 23 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2024-06-03 22:14:53,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 121 flow [2024-06-03 22:14:53,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 22:14:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 22:14:53,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2024-06-03 22:14:53,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-06-03 22:14:53,995 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 54 flow. Second operand 3 states and 52 transitions. [2024-06-03 22:14:53,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 121 flow [2024-06-03 22:14:53,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 22:14:53,999 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 73 flow [2024-06-03 22:14:54,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2024-06-03 22:14:54,004 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-03 22:14:54,004 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 73 flow [2024-06-03 22:14:54,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:54,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:14:54,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:14:54,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 22:14:54,005 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:14:54,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:14:54,006 INFO L85 PathProgramCache]: Analyzing trace with hash 251680094, now seen corresponding path program 1 times [2024-06-03 22:14:54,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:14:54,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962460614] [2024-06-03 22:14:54,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:14:54,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:14:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:14:56,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:14:56,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:14:56,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962460614] [2024-06-03 22:14:56,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962460614] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:14:56,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:14:56,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 22:14:56,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325703038] [2024-06-03 22:14:56,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:14:56,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 22:14:56,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:14:56,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 22:14:56,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-03 22:14:56,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-03 22:14:56,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:56,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:14:56,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-03 22:14:56,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:14:56,484 INFO L124 PetriNetUnfolderBase]: 213/382 cut-off events. [2024-06-03 22:14:56,484 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-06-03 22:14:56,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 382 events. 213/382 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1350 event pairs, 109 based on Foata normal form. 2/382 useless extension candidates. Maximal degree in co-relation 865. Up to 364 conditions per place. [2024-06-03 22:14:56,487 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 29 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-06-03 22:14:56,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 167 flow [2024-06-03 22:14:56,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 22:14:56,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 22:14:56,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2024-06-03 22:14:56,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2024-06-03 22:14:56,488 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 73 flow. Second operand 4 states and 60 transitions. [2024-06-03 22:14:56,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 167 flow [2024-06-03 22:14:56,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 22:14:56,490 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 97 flow [2024-06-03 22:14:56,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2024-06-03 22:14:56,491 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-06-03 22:14:56,491 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 97 flow [2024-06-03 22:14:56,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:56,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:14:56,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:14:56,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 22:14:56,492 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:14:56,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:14:56,492 INFO L85 PathProgramCache]: Analyzing trace with hash -795000808, now seen corresponding path program 1 times [2024-06-03 22:14:56,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:14:56,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916854180] [2024-06-03 22:14:56,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:14:56,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:14:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:14:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:14:58,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:14:58,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916854180] [2024-06-03 22:14:58,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916854180] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:14:58,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:14:58,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 22:14:58,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814784077] [2024-06-03 22:14:58,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:14:58,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 22:14:58,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:14:58,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 22:14:58,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-03 22:14:58,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-03 22:14:58,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:58,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:14:58,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-03 22:14:58,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:14:58,710 INFO L124 PetriNetUnfolderBase]: 207/372 cut-off events. [2024-06-03 22:14:58,710 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2024-06-03 22:14:58,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 372 events. 207/372 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1297 event pairs, 61 based on Foata normal form. 4/374 useless extension candidates. Maximal degree in co-relation 930. Up to 336 conditions per place. [2024-06-03 22:14:58,713 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 34 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-06-03 22:14:58,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 219 flow [2024-06-03 22:14:58,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:14:58,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:14:58,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2024-06-03 22:14:58,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45625 [2024-06-03 22:14:58,714 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 97 flow. Second operand 5 states and 73 transitions. [2024-06-03 22:14:58,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 219 flow [2024-06-03 22:14:58,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 210 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-03 22:14:58,716 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 121 flow [2024-06-03 22:14:58,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-06-03 22:14:58,717 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-06-03 22:14:58,717 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 121 flow [2024-06-03 22:14:58,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:14:58,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:14:58,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:14:58,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 22:14:58,718 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:14:58,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:14:58,719 INFO L85 PathProgramCache]: Analyzing trace with hash 508425943, now seen corresponding path program 1 times [2024-06-03 22:14:58,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:14:58,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105585278] [2024-06-03 22:14:58,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:14:58,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:14:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:15:01,337 INFO 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:15:01,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:15:01,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105585278] [2024-06-03 22:15:01,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105585278] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:15:01,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:15:01,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:15:01,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650465687] [2024-06-03 22:15:01,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:15:01,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:15:01,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:15:01,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:15:01,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:15:01,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-03 22:15:01,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:01,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:15:01,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-03 22:15:01,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:15:01,657 INFO L124 PetriNetUnfolderBase]: 203/364 cut-off events. [2024-06-03 22:15:01,657 INFO L125 PetriNetUnfolderBase]: For 359/359 co-relation queries the response was YES. [2024-06-03 22:15:01,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 364 events. 203/364 cut-off events. For 359/359 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1244 event pairs, 36 based on Foata normal form. 4/366 useless extension candidates. Maximal degree in co-relation 990. Up to 310 conditions per place. [2024-06-03 22:15:01,659 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 34 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2024-06-03 22:15:01,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 233 flow [2024-06-03 22:15:01,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:15:01,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:15:01,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2024-06-03 22:15:01,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-03 22:15:01,661 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 121 flow. Second operand 6 states and 80 transitions. [2024-06-03 22:15:01,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 233 flow [2024-06-03 22:15:01,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 218 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-03 22:15:01,663 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 118 flow [2024-06-03 22:15:01,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=118, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2024-06-03 22:15:01,664 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2024-06-03 22:15:01,664 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 118 flow [2024-06-03 22:15:01,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:01,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:15:01,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:15:01,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 22:15:01,665 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:15:01,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:15:01,665 INFO L85 PathProgramCache]: Analyzing trace with hash 234560243, now seen corresponding path program 1 times [2024-06-03 22:15:01,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:15:01,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166400400] [2024-06-03 22:15:01,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:15:01,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:15:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:15:05,647 INFO 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:15:05,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:15:05,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166400400] [2024-06-03 22:15:05,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166400400] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:15:05,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:15:05,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:15:05,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513494296] [2024-06-03 22:15:05,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:15:05,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:15:05,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:15:05,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:15:05,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:15:05,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-03 22:15:05,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 118 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:05,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:15:05,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-03 22:15:05,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:15:05,899 INFO L124 PetriNetUnfolderBase]: 147/295 cut-off events. [2024-06-03 22:15:05,899 INFO L125 PetriNetUnfolderBase]: For 377/377 co-relation queries the response was YES. [2024-06-03 22:15:05,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 295 events. 147/295 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1064 event pairs, 53 based on Foata normal form. 1/288 useless extension candidates. Maximal degree in co-relation 804. Up to 259 conditions per place. [2024-06-03 22:15:05,903 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 26 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2024-06-03 22:15:05,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 36 transitions, 200 flow [2024-06-03 22:15:05,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:15:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:15:05,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2024-06-03 22:15:05,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-03 22:15:05,905 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 118 flow. Second operand 5 states and 64 transitions. [2024-06-03 22:15:05,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 36 transitions, 200 flow [2024-06-03 22:15:05,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 180 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-03 22:15:05,910 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 125 flow [2024-06-03 22:15:05,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2024-06-03 22:15:05,913 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2024-06-03 22:15:05,914 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 125 flow [2024-06-03 22:15:05,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:05,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:15:05,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:15:05,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 22:15:05,919 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:15:05,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:15:05,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1318565773, now seen corresponding path program 1 times [2024-06-03 22:15:05,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:15:05,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184702997] [2024-06-03 22:15:05,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:15:05,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:15:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:15:09,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:15:09,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:15:09,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184702997] [2024-06-03 22:15:09,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184702997] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:15:09,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:15:09,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:15:09,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267962417] [2024-06-03 22:15:09,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:15:09,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:15:09,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:15:09,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:15:09,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:15:10,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:15:10,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 125 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:10,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:15:10,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:15:10,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:15:10,335 INFO L124 PetriNetUnfolderBase]: 203/365 cut-off events. [2024-06-03 22:15:10,335 INFO L125 PetriNetUnfolderBase]: For 693/693 co-relation queries the response was YES. [2024-06-03 22:15:10,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1106 conditions, 365 events. 203/365 cut-off events. For 693/693 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1252 event pairs, 70 based on Foata normal form. 2/365 useless extension candidates. Maximal degree in co-relation 1085. Up to 327 conditions per place. [2024-06-03 22:15:10,338 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 33 selfloop transitions, 13 changer transitions 0/48 dead transitions. [2024-06-03 22:15:10,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 48 transitions, 275 flow [2024-06-03 22:15:10,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:15:10,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:15:10,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-03 22:15:10,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35267857142857145 [2024-06-03 22:15:10,341 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 125 flow. Second operand 7 states and 79 transitions. [2024-06-03 22:15:10,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 48 transitions, 275 flow [2024-06-03 22:15:10,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 264 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-03 22:15:10,343 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 184 flow [2024-06-03 22:15:10,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=184, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2024-06-03 22:15:10,345 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2024-06-03 22:15:10,345 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 184 flow [2024-06-03 22:15:10,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:10,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:15:10,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:15:10,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 22:15:10,346 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:15:10,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:15:10,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1625823128, now seen corresponding path program 1 times [2024-06-03 22:15:10,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:15:10,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284546460] [2024-06-03 22:15:10,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:15:10,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:15:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:15:14,018 INFO 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:15:14,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:15:14,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284546460] [2024-06-03 22:15:14,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284546460] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:15:14,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:15:14,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:15:14,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656518575] [2024-06-03 22:15:14,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:15:14,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:15:14,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:15:14,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:15:14,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:15:14,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:15:14,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 184 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:14,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:15:14,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:15:14,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:15:14,339 INFO L124 PetriNetUnfolderBase]: 206/370 cut-off events. [2024-06-03 22:15:14,339 INFO L125 PetriNetUnfolderBase]: For 996/996 co-relation queries the response was YES. [2024-06-03 22:15:14,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1275 conditions, 370 events. 206/370 cut-off events. For 996/996 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1264 event pairs, 74 based on Foata normal form. 1/369 useless extension candidates. Maximal degree in co-relation 1252. Up to 349 conditions per place. [2024-06-03 22:15:14,343 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 38 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2024-06-03 22:15:14,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 48 transitions, 313 flow [2024-06-03 22:15:14,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:15:14,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:15:14,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2024-06-03 22:15:14,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3489583333333333 [2024-06-03 22:15:14,345 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 184 flow. Second operand 6 states and 67 transitions. [2024-06-03 22:15:14,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 48 transitions, 313 flow [2024-06-03 22:15:14,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 299 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-03 22:15:14,347 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 210 flow [2024-06-03 22:15:14,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-06-03 22:15:14,348 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2024-06-03 22:15:14,348 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 210 flow [2024-06-03 22:15:14,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:14,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:15:14,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:15:14,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 22:15:14,349 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:15:14,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:15:14,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2074127378, now seen corresponding path program 2 times [2024-06-03 22:15:14,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:15:14,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686389249] [2024-06-03 22:15:14,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:15:14,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:15:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:15:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:15:18,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:15:18,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686389249] [2024-06-03 22:15:18,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686389249] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:15:18,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:15:18,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:15:18,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674899161] [2024-06-03 22:15:18,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:15:18,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:15:18,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:15:18,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:15:18,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:15:18,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:15:18,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:18,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:15:18,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:15:18,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:15:18,871 INFO L124 PetriNetUnfolderBase]: 201/362 cut-off events. [2024-06-03 22:15:18,871 INFO L125 PetriNetUnfolderBase]: For 1265/1265 co-relation queries the response was YES. [2024-06-03 22:15:18,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1288 conditions, 362 events. 201/362 cut-off events. For 1265/1265 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1239 event pairs, 74 based on Foata normal form. 2/362 useless extension candidates. Maximal degree in co-relation 1263. Up to 324 conditions per place. [2024-06-03 22:15:18,877 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 33 selfloop transitions, 14 changer transitions 0/49 dead transitions. [2024-06-03 22:15:18,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 49 transitions, 328 flow [2024-06-03 22:15:18,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:15:18,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:15:18,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2024-06-03 22:15:18,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3482142857142857 [2024-06-03 22:15:18,881 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 210 flow. Second operand 7 states and 78 transitions. [2024-06-03 22:15:18,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 49 transitions, 328 flow [2024-06-03 22:15:18,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 309 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-03 22:15:18,884 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 226 flow [2024-06-03 22:15:18,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2024-06-03 22:15:18,888 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2024-06-03 22:15:18,888 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 226 flow [2024-06-03 22:15:18,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:18,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:15:18,889 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:15:18,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 22:15:18,890 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:15:18,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:15:18,891 INFO L85 PathProgramCache]: Analyzing trace with hash 2074135314, now seen corresponding path program 1 times [2024-06-03 22:15:18,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:15:18,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783037237] [2024-06-03 22:15:18,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:15:18,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:15:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:15:23,143 INFO 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:15:23,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:15:23,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783037237] [2024-06-03 22:15:23,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783037237] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:15:23,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:15:23,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:15:23,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361029160] [2024-06-03 22:15:23,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:15:23,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:15:23,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:15:23,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:15:23,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:15:23,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:15:23,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 226 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:23,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:15:23,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:15:23,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:15:23,507 INFO L124 PetriNetUnfolderBase]: 202/364 cut-off events. [2024-06-03 22:15:23,508 INFO L125 PetriNetUnfolderBase]: For 1528/1528 co-relation queries the response was YES. [2024-06-03 22:15:23,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1342 conditions, 364 events. 202/364 cut-off events. For 1528/1528 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1231 event pairs, 72 based on Foata normal form. 2/364 useless extension candidates. Maximal degree in co-relation 1316. Up to 314 conditions per place. [2024-06-03 22:15:23,513 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 35 selfloop transitions, 19 changer transitions 0/56 dead transitions. [2024-06-03 22:15:23,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 402 flow [2024-06-03 22:15:23,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:15:23,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:15:23,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-03 22:15:23,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34765625 [2024-06-03 22:15:23,515 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 226 flow. Second operand 8 states and 89 transitions. [2024-06-03 22:15:23,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 56 transitions, 402 flow [2024-06-03 22:15:23,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 56 transitions, 364 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-03 22:15:23,519 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 262 flow [2024-06-03 22:15:23,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=262, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2024-06-03 22:15:23,521 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 23 predicate places. [2024-06-03 22:15:23,521 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 262 flow [2024-06-03 22:15:23,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:23,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:15:23,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:15:23,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 22:15:23,522 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:15:23,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:15:23,522 INFO L85 PathProgramCache]: Analyzing trace with hash -132993362, now seen corresponding path program 1 times [2024-06-03 22:15:23,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:15:23,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126567118] [2024-06-03 22:15:23,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:15:23,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:15:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:15:27,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:15:27,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:15:27,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126567118] [2024-06-03 22:15:27,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126567118] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:15:27,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:15:27,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:15:27,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647901856] [2024-06-03 22:15:27,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:15:27,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:15:27,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:15:27,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:15:27,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:15:27,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:15:27,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 262 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:27,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:15:27,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:15:27,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:15:27,884 INFO L124 PetriNetUnfolderBase]: 208/374 cut-off events. [2024-06-03 22:15:27,884 INFO L125 PetriNetUnfolderBase]: For 1936/1936 co-relation queries the response was YES. [2024-06-03 22:15:27,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1458 conditions, 374 events. 208/374 cut-off events. For 1936/1936 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1300 event pairs, 50 based on Foata normal form. 2/374 useless extension candidates. Maximal degree in co-relation 1431. Up to 332 conditions per place. [2024-06-03 22:15:27,886 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 48 selfloop transitions, 12 changer transitions 0/62 dead transitions. [2024-06-03 22:15:27,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 62 transitions, 432 flow [2024-06-03 22:15:27,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:15:27,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:15:27,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2024-06-03 22:15:27,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2024-06-03 22:15:27,889 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 262 flow. Second operand 7 states and 80 transitions. [2024-06-03 22:15:27,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 62 transitions, 432 flow [2024-06-03 22:15:27,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 408 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-03 22:15:27,892 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 292 flow [2024-06-03 22:15:27,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=292, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2024-06-03 22:15:27,893 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 27 predicate places. [2024-06-03 22:15:27,895 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 292 flow [2024-06-03 22:15:27,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:27,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:15:27,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:15:27,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 22:15:27,895 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:15:27,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:15:27,896 INFO L85 PathProgramCache]: Analyzing trace with hash -303691142, now seen corresponding path program 2 times [2024-06-03 22:15:27,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:15:27,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938167815] [2024-06-03 22:15:27,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:15:27,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:15:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:15:31,745 INFO 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:15:31,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:15:31,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938167815] [2024-06-03 22:15:31,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938167815] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:15:31,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:15:31,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:15:31,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299775330] [2024-06-03 22:15:31,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:15:31,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:15:31,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:15:31,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:15:31,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:15:31,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:15:31,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 292 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:31,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:15:31,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:15:31,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:15:32,077 INFO L124 PetriNetUnfolderBase]: 219/392 cut-off events. [2024-06-03 22:15:32,078 INFO L125 PetriNetUnfolderBase]: For 2440/2440 co-relation queries the response was YES. [2024-06-03 22:15:32,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 392 events. 219/392 cut-off events. For 2440/2440 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1378 event pairs, 50 based on Foata normal form. 2/392 useless extension candidates. Maximal degree in co-relation 1629. Up to 337 conditions per place. [2024-06-03 22:15:32,082 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 47 selfloop transitions, 16 changer transitions 0/65 dead transitions. [2024-06-03 22:15:32,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 65 transitions, 500 flow [2024-06-03 22:15:32,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:15:32,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:15:32,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2024-06-03 22:15:32,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36160714285714285 [2024-06-03 22:15:32,084 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 292 flow. Second operand 7 states and 81 transitions. [2024-06-03 22:15:32,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 65 transitions, 500 flow [2024-06-03 22:15:32,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 65 transitions, 482 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-03 22:15:32,087 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 343 flow [2024-06-03 22:15:32,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=343, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2024-06-03 22:15:32,088 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 31 predicate places. [2024-06-03 22:15:32,088 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 343 flow [2024-06-03 22:15:32,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:32,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:15:32,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:15:32,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 22:15:32,089 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:15:32,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:15:32,089 INFO L85 PathProgramCache]: Analyzing trace with hash -299049512, now seen corresponding path program 3 times [2024-06-03 22:15:32,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:15:32,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824015690] [2024-06-03 22:15:32,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:15:32,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:15:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:15:36,091 INFO 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:15:36,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:15:36,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824015690] [2024-06-03 22:15:36,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824015690] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:15:36,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:15:36,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:15:36,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487709202] [2024-06-03 22:15:36,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:15:36,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:15:36,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:15:36,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:15:36,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:15:36,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:15:36,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 343 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:36,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:15:36,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:15:36,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:15:36,469 INFO L124 PetriNetUnfolderBase]: 221/396 cut-off events. [2024-06-03 22:15:36,469 INFO L125 PetriNetUnfolderBase]: For 2980/2980 co-relation queries the response was YES. [2024-06-03 22:15:36,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1736 conditions, 396 events. 221/396 cut-off events. For 2980/2980 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1391 event pairs, 48 based on Foata normal form. 4/398 useless extension candidates. Maximal degree in co-relation 1705. Up to 288 conditions per place. [2024-06-03 22:15:36,473 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 47 selfloop transitions, 22 changer transitions 0/71 dead transitions. [2024-06-03 22:15:36,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 71 transitions, 573 flow [2024-06-03 22:15:36,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:15:36,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:15:36,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-03 22:15:36,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36328125 [2024-06-03 22:15:36,475 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 343 flow. Second operand 8 states and 93 transitions. [2024-06-03 22:15:36,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 71 transitions, 573 flow [2024-06-03 22:15:36,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 71 transitions, 553 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-03 22:15:36,482 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 413 flow [2024-06-03 22:15:36,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=413, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2024-06-03 22:15:36,483 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 36 predicate places. [2024-06-03 22:15:36,483 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 413 flow [2024-06-03 22:15:36,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:36,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:15:36,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:15:36,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 22:15:36,484 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:15:36,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:15:36,484 INFO L85 PathProgramCache]: Analyzing trace with hash -126313358, now seen corresponding path program 1 times [2024-06-03 22:15:36,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:15:36,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158933782] [2024-06-03 22:15:36,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:15:36,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:15:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:15:40,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:15:40,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:15:40,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158933782] [2024-06-03 22:15:40,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158933782] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:15:40,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:15:40,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:15:40,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852545678] [2024-06-03 22:15:40,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:15:40,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:15:40,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:15:40,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:15:40,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:15:40,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:15:40,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 413 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:40,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:15:40,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:15:40,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:15:40,915 INFO L124 PetriNetUnfolderBase]: 222/398 cut-off events. [2024-06-03 22:15:40,916 INFO L125 PetriNetUnfolderBase]: For 3308/3308 co-relation queries the response was YES. [2024-06-03 22:15:40,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1848 conditions, 398 events. 222/398 cut-off events. For 3308/3308 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1414 event pairs, 49 based on Foata normal form. 2/398 useless extension candidates. Maximal degree in co-relation 1815. Up to 335 conditions per place. [2024-06-03 22:15:40,919 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 50 selfloop transitions, 23 changer transitions 0/75 dead transitions. [2024-06-03 22:15:40,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 75 transitions, 643 flow [2024-06-03 22:15:40,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:15:40,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:15:40,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-03 22:15:40,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-03 22:15:40,920 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 413 flow. Second operand 9 states and 99 transitions. [2024-06-03 22:15:40,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 75 transitions, 643 flow [2024-06-03 22:15:40,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 75 transitions, 612 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-03 22:15:40,925 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 470 flow [2024-06-03 22:15:40,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=470, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2024-06-03 22:15:40,925 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 41 predicate places. [2024-06-03 22:15:40,925 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 62 transitions, 470 flow [2024-06-03 22:15:40,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:40,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:15:40,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:15:40,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 22:15:40,926 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:15:40,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:15:40,926 INFO L85 PathProgramCache]: Analyzing trace with hash -158297167, now seen corresponding path program 1 times [2024-06-03 22:15:40,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:15:40,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522808076] [2024-06-03 22:15:40,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:15:40,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:15:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:15:45,292 INFO 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:15:45,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:15:45,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522808076] [2024-06-03 22:15:45,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522808076] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:15:45,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:15:45,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:15:45,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775002074] [2024-06-03 22:15:45,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:15:45,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:15:45,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:15:45,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:15:45,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:15:45,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:15:45,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 62 transitions, 470 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:45,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:15:45,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:15:45,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:15:45,634 INFO L124 PetriNetUnfolderBase]: 220/395 cut-off events. [2024-06-03 22:15:45,634 INFO L125 PetriNetUnfolderBase]: For 3509/3509 co-relation queries the response was YES. [2024-06-03 22:15:45,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1914 conditions, 395 events. 220/395 cut-off events. For 3509/3509 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1383 event pairs, 47 based on Foata normal form. 1/394 useless extension candidates. Maximal degree in co-relation 1879. Up to 350 conditions per place. [2024-06-03 22:15:45,637 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 61 selfloop transitions, 13 changer transitions 0/76 dead transitions. [2024-06-03 22:15:45,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 76 transitions, 654 flow [2024-06-03 22:15:45,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:15:45,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:15:45,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2024-06-03 22:15:45,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2024-06-03 22:15:45,638 INFO L175 Difference]: Start difference. First operand has 72 places, 62 transitions, 470 flow. Second operand 7 states and 80 transitions. [2024-06-03 22:15:45,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 76 transitions, 654 flow [2024-06-03 22:15:45,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 76 transitions, 618 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-03 22:15:45,643 INFO L231 Difference]: Finished difference. Result has 74 places, 62 transitions, 468 flow [2024-06-03 22:15:45,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=468, PETRI_PLACES=74, PETRI_TRANSITIONS=62} [2024-06-03 22:15:45,643 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 43 predicate places. [2024-06-03 22:15:45,643 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 468 flow [2024-06-03 22:15:45,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:45,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:15:45,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:15:45,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 22:15:45,644 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:15:45,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:15:45,644 INFO L85 PathProgramCache]: Analyzing trace with hash -828208594, now seen corresponding path program 1 times [2024-06-03 22:15:45,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:15:45,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761934589] [2024-06-03 22:15:45,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:15:45,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:15:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:15:49,605 INFO 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:15:49,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:15:49,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761934589] [2024-06-03 22:15:49,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761934589] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:15:49,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:15:49,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:15:49,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162519625] [2024-06-03 22:15:49,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:15:49,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:15:49,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:15:49,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:15:49,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:15:49,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:15:49,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 468 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:49,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:15:49,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:15:49,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:15:49,954 INFO L124 PetriNetUnfolderBase]: 226/405 cut-off events. [2024-06-03 22:15:49,954 INFO L125 PetriNetUnfolderBase]: For 4113/4113 co-relation queries the response was YES. [2024-06-03 22:15:49,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1998 conditions, 405 events. 226/405 cut-off events. For 4113/4113 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1430 event pairs, 46 based on Foata normal form. 2/405 useless extension candidates. Maximal degree in co-relation 1961. Up to 355 conditions per place. [2024-06-03 22:15:49,957 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 64 selfloop transitions, 14 changer transitions 0/80 dead transitions. [2024-06-03 22:15:49,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 80 transitions, 682 flow [2024-06-03 22:15:49,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:15:49,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:15:49,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-03 22:15:49,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34765625 [2024-06-03 22:15:49,959 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 468 flow. Second operand 8 states and 89 transitions. [2024-06-03 22:15:49,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 80 transitions, 682 flow [2024-06-03 22:15:49,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 80 transitions, 651 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-03 22:15:49,964 INFO L231 Difference]: Finished difference. Result has 76 places, 64 transitions, 490 flow [2024-06-03 22:15:49,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=490, PETRI_PLACES=76, PETRI_TRANSITIONS=64} [2024-06-03 22:15:49,965 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 45 predicate places. [2024-06-03 22:15:49,965 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 64 transitions, 490 flow [2024-06-03 22:15:49,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:49,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:15:49,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:15:49,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 22:15:49,966 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:15:49,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:15:49,966 INFO L85 PathProgramCache]: Analyzing trace with hash -824483944, now seen corresponding path program 2 times [2024-06-03 22:15:49,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:15:49,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37873198] [2024-06-03 22:15:49,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:15:49,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:15:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:15:54,083 INFO 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:15:54,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:15:54,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37873198] [2024-06-03 22:15:54,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37873198] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:15:54,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:15:54,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:15:54,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907057181] [2024-06-03 22:15:54,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:15:54,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:15:54,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:15:54,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:15:54,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:15:54,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:15:54,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 64 transitions, 490 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:54,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:15:54,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:15:54,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:15:54,471 INFO L124 PetriNetUnfolderBase]: 232/415 cut-off events. [2024-06-03 22:15:54,471 INFO L125 PetriNetUnfolderBase]: For 4699/4699 co-relation queries the response was YES. [2024-06-03 22:15:54,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2095 conditions, 415 events. 232/415 cut-off events. For 4699/4699 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1473 event pairs, 41 based on Foata normal form. 2/415 useless extension candidates. Maximal degree in co-relation 2057. Up to 301 conditions per place. [2024-06-03 22:15:54,474 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 49 selfloop transitions, 30 changer transitions 0/81 dead transitions. [2024-06-03 22:15:54,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 81 transitions, 738 flow [2024-06-03 22:15:54,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:15:54,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:15:54,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-03 22:15:54,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-03 22:15:54,475 INFO L175 Difference]: Start difference. First operand has 76 places, 64 transitions, 490 flow. Second operand 8 states and 94 transitions. [2024-06-03 22:15:54,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 81 transitions, 738 flow [2024-06-03 22:15:54,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 81 transitions, 705 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 22:15:54,481 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 542 flow [2024-06-03 22:15:54,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=542, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2024-06-03 22:15:54,482 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 47 predicate places. [2024-06-03 22:15:54,482 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 542 flow [2024-06-03 22:15:54,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:54,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:15:54,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:15:54,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 22:15:54,483 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:15:54,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:15:54,483 INFO L85 PathProgramCache]: Analyzing trace with hash -154487732, now seen corresponding path program 3 times [2024-06-03 22:15:54,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:15:54,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908886794] [2024-06-03 22:15:54,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:15:54,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:15:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:15:58,489 INFO 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:15:58,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:15:58,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908886794] [2024-06-03 22:15:58,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908886794] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:15:58,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:15:58,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:15:58,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333470032] [2024-06-03 22:15:58,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:15:58,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:15:58,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:15:58,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:15:58,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:15:58,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:15:58,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 542 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:58,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:15:58,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:15:58,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:15:58,831 INFO L124 PetriNetUnfolderBase]: 233/417 cut-off events. [2024-06-03 22:15:58,832 INFO L125 PetriNetUnfolderBase]: For 5209/5209 co-relation queries the response was YES. [2024-06-03 22:15:58,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2176 conditions, 417 events. 233/417 cut-off events. For 5209/5209 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1497 event pairs, 47 based on Foata normal form. 2/417 useless extension candidates. Maximal degree in co-relation 2137. Up to 304 conditions per place. [2024-06-03 22:15:58,834 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 53 selfloop transitions, 28 changer transitions 0/83 dead transitions. [2024-06-03 22:15:58,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 83 transitions, 800 flow [2024-06-03 22:15:58,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:15:58,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:15:58,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-03 22:15:58,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36328125 [2024-06-03 22:15:58,837 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 542 flow. Second operand 8 states and 93 transitions. [2024-06-03 22:15:58,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 83 transitions, 800 flow [2024-06-03 22:15:58,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 83 transitions, 719 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-03 22:15:58,842 INFO L231 Difference]: Finished difference. Result has 80 places, 68 transitions, 547 flow [2024-06-03 22:15:58,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=547, PETRI_PLACES=80, PETRI_TRANSITIONS=68} [2024-06-03 22:15:58,843 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 49 predicate places. [2024-06-03 22:15:58,843 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 68 transitions, 547 flow [2024-06-03 22:15:58,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:15:58,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:15:58,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:15:58,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 22:15:58,844 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:15:58,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:15:58,844 INFO L85 PathProgramCache]: Analyzing trace with hash 371835347, now seen corresponding path program 1 times [2024-06-03 22:15:58,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:15:58,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78636881] [2024-06-03 22:15:58,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:15:58,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:15:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:16:02,902 INFO 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:02,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:16:02,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78636881] [2024-06-03 22:16:02,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78636881] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:16:02,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:16:02,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:16:02,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679515665] [2024-06-03 22:16:02,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:16:02,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:16:02,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:16:02,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:16:02,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:16:03,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:16:03,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 68 transitions, 547 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:03,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:16:03,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:16:03,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:16:03,319 INFO L124 PetriNetUnfolderBase]: 236/422 cut-off events. [2024-06-03 22:16:03,319 INFO L125 PetriNetUnfolderBase]: For 5605/5605 co-relation queries the response was YES. [2024-06-03 22:16:03,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2215 conditions, 422 events. 236/422 cut-off events. For 5605/5605 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1511 event pairs, 50 based on Foata normal form. 1/421 useless extension candidates. Maximal degree in co-relation 2175. Up to 371 conditions per place. [2024-06-03 22:16:03,322 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 60 selfloop transitions, 21 changer transitions 0/83 dead transitions. [2024-06-03 22:16:03,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 83 transitions, 787 flow [2024-06-03 22:16:03,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:16:03,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:16:03,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-03 22:16:03,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3368055555555556 [2024-06-03 22:16:03,323 INFO L175 Difference]: Start difference. First operand has 80 places, 68 transitions, 547 flow. Second operand 9 states and 97 transitions. [2024-06-03 22:16:03,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 83 transitions, 787 flow [2024-06-03 22:16:03,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 83 transitions, 740 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-03 22:16:03,329 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 561 flow [2024-06-03 22:16:03,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=561, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2024-06-03 22:16:03,329 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 53 predicate places. [2024-06-03 22:16:03,329 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 561 flow [2024-06-03 22:16:03,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:03,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:03,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:16:03,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 22:16:03,330 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:16:03,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:03,330 INFO L85 PathProgramCache]: Analyzing trace with hash 378977747, now seen corresponding path program 2 times [2024-06-03 22:16:03,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:03,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332321186] [2024-06-03 22:16:03,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:03,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:16:07,395 INFO 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:07,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:16:07,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332321186] [2024-06-03 22:16:07,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332321186] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:16:07,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:16:07,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:16:07,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192196604] [2024-06-03 22:16:07,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:16:07,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:16:07,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:16:07,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:16:07,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:16:07,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:16:07,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 561 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:07,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:16:07,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:16:07,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:16:07,726 INFO L124 PetriNetUnfolderBase]: 234/419 cut-off events. [2024-06-03 22:16:07,726 INFO L125 PetriNetUnfolderBase]: For 6026/6026 co-relation queries the response was YES. [2024-06-03 22:16:07,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2198 conditions, 419 events. 234/419 cut-off events. For 6026/6026 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1498 event pairs, 50 based on Foata normal form. 1/418 useless extension candidates. Maximal degree in co-relation 2157. Up to 369 conditions per place. [2024-06-03 22:16:07,729 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 59 selfloop transitions, 20 changer transitions 0/81 dead transitions. [2024-06-03 22:16:07,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 81 transitions, 745 flow [2024-06-03 22:16:07,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:16:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:16:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-03 22:16:07,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-03 22:16:07,733 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 561 flow. Second operand 8 states and 88 transitions. [2024-06-03 22:16:07,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 81 transitions, 745 flow [2024-06-03 22:16:07,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 81 transitions, 697 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-03 22:16:07,739 INFO L231 Difference]: Finished difference. Result has 85 places, 70 transitions, 558 flow [2024-06-03 22:16:07,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=558, PETRI_PLACES=85, PETRI_TRANSITIONS=70} [2024-06-03 22:16:07,739 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 54 predicate places. [2024-06-03 22:16:07,739 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 70 transitions, 558 flow [2024-06-03 22:16:07,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:07,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:07,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:16:07,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 22:16:07,740 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:16:07,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:07,740 INFO L85 PathProgramCache]: Analyzing trace with hash 379254577, now seen corresponding path program 1 times [2024-06-03 22:16:07,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:07,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721909590] [2024-06-03 22:16:07,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:07,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:16:12,054 INFO 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:12,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:16:12,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721909590] [2024-06-03 22:16:12,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721909590] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:16:12,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:16:12,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:16:12,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650308238] [2024-06-03 22:16:12,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:16:12,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:16:12,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:16:12,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:16:12,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:16:12,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:16:12,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 70 transitions, 558 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:12,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:16:12,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:16:12,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:16:12,469 INFO L124 PetriNetUnfolderBase]: 263/467 cut-off events. [2024-06-03 22:16:12,470 INFO L125 PetriNetUnfolderBase]: For 7748/7748 co-relation queries the response was YES. [2024-06-03 22:16:12,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2438 conditions, 467 events. 263/467 cut-off events. For 7748/7748 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1737 event pairs, 46 based on Foata normal form. 4/469 useless extension candidates. Maximal degree in co-relation 2396. Up to 241 conditions per place. [2024-06-03 22:16:12,473 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 57 selfloop transitions, 44 changer transitions 0/103 dead transitions. [2024-06-03 22:16:12,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 103 transitions, 1050 flow [2024-06-03 22:16:12,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:16:12,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:16:12,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-03 22:16:12,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-03 22:16:12,485 INFO L175 Difference]: Start difference. First operand has 85 places, 70 transitions, 558 flow. Second operand 10 states and 123 transitions. [2024-06-03 22:16:12,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 103 transitions, 1050 flow [2024-06-03 22:16:12,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 103 transitions, 1001 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-03 22:16:12,491 INFO L231 Difference]: Finished difference. Result has 89 places, 80 transitions, 702 flow [2024-06-03 22:16:12,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=702, PETRI_PLACES=89, PETRI_TRANSITIONS=80} [2024-06-03 22:16:12,492 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 58 predicate places. [2024-06-03 22:16:12,492 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 80 transitions, 702 flow [2024-06-03 22:16:12,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:12,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:12,492 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:16:12,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 22:16:12,493 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:16:12,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:12,493 INFO L85 PathProgramCache]: Analyzing trace with hash 92476759, now seen corresponding path program 1 times [2024-06-03 22:16:12,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:12,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29183929] [2024-06-03 22:16:12,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:12,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:16:16,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:16:16,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:16:16,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29183929] [2024-06-03 22:16:16,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29183929] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:16:16,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:16:16,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:16:16,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503129968] [2024-06-03 22:16:16,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:16:16,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:16:16,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:16:16,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:16:16,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:16:16,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:16:16,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 80 transitions, 702 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:16,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:16:16,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:16:16,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:16:17,052 INFO L124 PetriNetUnfolderBase]: 267/475 cut-off events. [2024-06-03 22:16:17,052 INFO L125 PetriNetUnfolderBase]: For 8248/8248 co-relation queries the response was YES. [2024-06-03 22:16:17,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2688 conditions, 475 events. 267/475 cut-off events. For 8248/8248 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1780 event pairs, 34 based on Foata normal form. 2/475 useless extension candidates. Maximal degree in co-relation 2644. Up to 413 conditions per place. [2024-06-03 22:16:17,056 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 84 selfloop transitions, 11 changer transitions 0/97 dead transitions. [2024-06-03 22:16:17,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 97 transitions, 942 flow [2024-06-03 22:16:17,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:16:17,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:16:17,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2024-06-03 22:16:17,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3359375 [2024-06-03 22:16:17,057 INFO L175 Difference]: Start difference. First operand has 89 places, 80 transitions, 702 flow. Second operand 8 states and 86 transitions. [2024-06-03 22:16:17,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 97 transitions, 942 flow [2024-06-03 22:16:17,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 97 transitions, 881 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-03 22:16:17,065 INFO L231 Difference]: Finished difference. Result has 93 places, 81 transitions, 681 flow [2024-06-03 22:16:17,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=681, PETRI_PLACES=93, PETRI_TRANSITIONS=81} [2024-06-03 22:16:17,066 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 62 predicate places. [2024-06-03 22:16:17,066 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 81 transitions, 681 flow [2024-06-03 22:16:17,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:17,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:17,067 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:16:17,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 22:16:17,067 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:16:17,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:17,067 INFO L85 PathProgramCache]: Analyzing trace with hash 92537333, now seen corresponding path program 1 times [2024-06-03 22:16:17,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:17,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030486460] [2024-06-03 22:16:17,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:17,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:16:21,267 INFO 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:21,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:16:21,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030486460] [2024-06-03 22:16:21,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030486460] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:16:21,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:16:21,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:16:21,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493065543] [2024-06-03 22:16:21,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:16:21,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:16:21,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:16:21,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:16:21,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:16:21,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:16:21,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 81 transitions, 681 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:21,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:16:21,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:16:21,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:16:21,683 INFO L124 PetriNetUnfolderBase]: 265/472 cut-off events. [2024-06-03 22:16:21,683 INFO L125 PetriNetUnfolderBase]: For 8413/8413 co-relation queries the response was YES. [2024-06-03 22:16:21,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2663 conditions, 472 events. 265/472 cut-off events. For 8413/8413 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1771 event pairs, 46 based on Foata normal form. 1/471 useless extension candidates. Maximal degree in co-relation 2617. Up to 416 conditions per place. [2024-06-03 22:16:21,686 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 78 selfloop transitions, 17 changer transitions 0/97 dead transitions. [2024-06-03 22:16:21,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 97 transitions, 913 flow [2024-06-03 22:16:21,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:16:21,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:16:21,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-03 22:16:21,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34765625 [2024-06-03 22:16:21,688 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 681 flow. Second operand 8 states and 89 transitions. [2024-06-03 22:16:21,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 97 transitions, 913 flow [2024-06-03 22:16:21,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 97 transitions, 879 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-03 22:16:21,697 INFO L231 Difference]: Finished difference. Result has 95 places, 81 transitions, 689 flow [2024-06-03 22:16:21,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=689, PETRI_PLACES=95, PETRI_TRANSITIONS=81} [2024-06-03 22:16:21,697 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 64 predicate places. [2024-06-03 22:16:21,698 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 81 transitions, 689 flow [2024-06-03 22:16:21,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:21,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:21,698 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:16:21,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 22:16:21,698 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:16:21,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:21,699 INFO L85 PathProgramCache]: Analyzing trace with hash 92537209, now seen corresponding path program 2 times [2024-06-03 22:16:21,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:21,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773176365] [2024-06-03 22:16:21,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:21,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:16:26,012 INFO 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:26,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:16:26,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773176365] [2024-06-03 22:16:26,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773176365] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:16:26,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:16:26,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:16:26,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558942321] [2024-06-03 22:16:26,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:16:26,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:16:26,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:16:26,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:16:26,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:16:26,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:16:26,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 81 transitions, 689 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:26,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:16:26,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:16:26,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:16:26,454 INFO L124 PetriNetUnfolderBase]: 269/480 cut-off events. [2024-06-03 22:16:26,454 INFO L125 PetriNetUnfolderBase]: For 9565/9565 co-relation queries the response was YES. [2024-06-03 22:16:26,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2740 conditions, 480 events. 269/480 cut-off events. For 9565/9565 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1811 event pairs, 46 based on Foata normal form. 2/480 useless extension candidates. Maximal degree in co-relation 2693. Up to 427 conditions per place. [2024-06-03 22:16:26,457 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 82 selfloop transitions, 14 changer transitions 0/98 dead transitions. [2024-06-03 22:16:26,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 98 transitions, 935 flow [2024-06-03 22:16:26,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:16:26,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:16:26,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-03 22:16:26,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-03 22:16:26,460 INFO L175 Difference]: Start difference. First operand has 95 places, 81 transitions, 689 flow. Second operand 8 states and 88 transitions. [2024-06-03 22:16:26,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 98 transitions, 935 flow [2024-06-03 22:16:26,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 98 transitions, 872 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-03 22:16:26,472 INFO L231 Difference]: Finished difference. Result has 95 places, 82 transitions, 675 flow [2024-06-03 22:16:26,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=675, PETRI_PLACES=95, PETRI_TRANSITIONS=82} [2024-06-03 22:16:26,473 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 64 predicate places. [2024-06-03 22:16:26,473 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 82 transitions, 675 flow [2024-06-03 22:16:26,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:26,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:26,473 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:16:26,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 22:16:26,474 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:16:26,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:26,474 INFO L85 PathProgramCache]: Analyzing trace with hash 95338679, now seen corresponding path program 1 times [2024-06-03 22:16:26,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:26,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3723226] [2024-06-03 22:16:26,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:26,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:16:30,462 INFO 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:30,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:16:30,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3723226] [2024-06-03 22:16:30,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3723226] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:16:30,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:16:30,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:16:30,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869625243] [2024-06-03 22:16:30,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:16:30,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:16:30,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:16:30,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:16:30,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:16:30,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:16:30,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 82 transitions, 675 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:30,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:16:30,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:16:30,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:16:30,854 INFO L124 PetriNetUnfolderBase]: 275/490 cut-off events. [2024-06-03 22:16:30,854 INFO L125 PetriNetUnfolderBase]: For 9625/9625 co-relation queries the response was YES. [2024-06-03 22:16:30,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2763 conditions, 490 events. 275/490 cut-off events. For 9625/9625 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1854 event pairs, 50 based on Foata normal form. 2/490 useless extension candidates. Maximal degree in co-relation 2715. Up to 432 conditions per place. [2024-06-03 22:16:30,858 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 84 selfloop transitions, 16 changer transitions 0/102 dead transitions. [2024-06-03 22:16:30,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 102 transitions, 939 flow [2024-06-03 22:16:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:16:30,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:16:30,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-03 22:16:30,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2024-06-03 22:16:30,860 INFO L175 Difference]: Start difference. First operand has 95 places, 82 transitions, 675 flow. Second operand 9 states and 98 transitions. [2024-06-03 22:16:30,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 102 transitions, 939 flow [2024-06-03 22:16:30,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 102 transitions, 902 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-03 22:16:30,872 INFO L231 Difference]: Finished difference. Result has 98 places, 84 transitions, 695 flow [2024-06-03 22:16:30,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=695, PETRI_PLACES=98, PETRI_TRANSITIONS=84} [2024-06-03 22:16:30,872 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 67 predicate places. [2024-06-03 22:16:30,873 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 84 transitions, 695 flow [2024-06-03 22:16:30,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:30,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:30,873 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:16:30,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 22:16:30,873 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:16:30,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:30,874 INFO L85 PathProgramCache]: Analyzing trace with hash 210809339, now seen corresponding path program 2 times [2024-06-03 22:16:30,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:30,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660631839] [2024-06-03 22:16:30,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:30,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:16:35,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:16:35,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:16:35,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660631839] [2024-06-03 22:16:35,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660631839] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:16:35,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:16:35,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:16:35,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638385067] [2024-06-03 22:16:35,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:16:35,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:16:35,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:16:35,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:16:35,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:16:35,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:16:35,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 84 transitions, 695 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:35,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:16:35,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:16:35,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:16:35,550 INFO L124 PetriNetUnfolderBase]: 281/500 cut-off events. [2024-06-03 22:16:35,550 INFO L125 PetriNetUnfolderBase]: For 10363/10363 co-relation queries the response was YES. [2024-06-03 22:16:35,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2850 conditions, 500 events. 281/500 cut-off events. For 10363/10363 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1913 event pairs, 42 based on Foata normal form. 2/500 useless extension candidates. Maximal degree in co-relation 2801. Up to 330 conditions per place. [2024-06-03 22:16:35,554 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 62 selfloop transitions, 42 changer transitions 0/106 dead transitions. [2024-06-03 22:16:35,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 106 transitions, 1081 flow [2024-06-03 22:16:35,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:16:35,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:16:35,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-03 22:16:35,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3715277777777778 [2024-06-03 22:16:35,555 INFO L175 Difference]: Start difference. First operand has 98 places, 84 transitions, 695 flow. Second operand 9 states and 107 transitions. [2024-06-03 22:16:35,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 106 transitions, 1081 flow [2024-06-03 22:16:35,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 106 transitions, 1046 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-03 22:16:35,567 INFO L231 Difference]: Finished difference. Result has 101 places, 88 transitions, 812 flow [2024-06-03 22:16:35,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=812, PETRI_PLACES=101, PETRI_TRANSITIONS=88} [2024-06-03 22:16:35,567 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 70 predicate places. [2024-06-03 22:16:35,568 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 88 transitions, 812 flow [2024-06-03 22:16:35,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:35,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:35,568 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:16:35,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 22:16:35,568 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:16:35,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:35,569 INFO L85 PathProgramCache]: Analyzing trace with hash 210624889, now seen corresponding path program 3 times [2024-06-03 22:16:35,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:35,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052108560] [2024-06-03 22:16:35,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:35,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:16:40,246 INFO 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:40,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:16:40,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052108560] [2024-06-03 22:16:40,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052108560] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:16:40,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:16:40,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:16:40,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194692006] [2024-06-03 22:16:40,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:16:40,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:16:40,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:16:40,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:16:40,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:16:40,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:16:40,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 88 transitions, 812 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:40,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:16:40,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:16:40,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:16:40,671 INFO L124 PetriNetUnfolderBase]: 285/508 cut-off events. [2024-06-03 22:16:40,672 INFO L125 PetriNetUnfolderBase]: For 11491/11491 co-relation queries the response was YES. [2024-06-03 22:16:40,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3056 conditions, 508 events. 285/508 cut-off events. For 11491/11491 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1944 event pairs, 48 based on Foata normal form. 2/508 useless extension candidates. Maximal degree in co-relation 3005. Up to 448 conditions per place. [2024-06-03 22:16:40,676 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 84 selfloop transitions, 17 changer transitions 0/103 dead transitions. [2024-06-03 22:16:40,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 103 transitions, 1066 flow [2024-06-03 22:16:40,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:16:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:16:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-03 22:16:40,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-03 22:16:40,677 INFO L175 Difference]: Start difference. First operand has 101 places, 88 transitions, 812 flow. Second operand 8 states and 88 transitions. [2024-06-03 22:16:40,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 103 transitions, 1066 flow [2024-06-03 22:16:40,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 103 transitions, 993 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-03 22:16:40,689 INFO L231 Difference]: Finished difference. Result has 103 places, 89 transitions, 795 flow [2024-06-03 22:16:40,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=795, PETRI_PLACES=103, PETRI_TRANSITIONS=89} [2024-06-03 22:16:40,690 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 72 predicate places. [2024-06-03 22:16:40,690 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 89 transitions, 795 flow [2024-06-03 22:16:40,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:40,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:40,691 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:16:40,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 22:16:40,691 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:16:40,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:40,691 INFO L85 PathProgramCache]: Analyzing trace with hash 210629849, now seen corresponding path program 3 times [2024-06-03 22:16:40,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:40,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216676819] [2024-06-03 22:16:40,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:40,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:16:44,827 INFO 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:44,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:16:44,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216676819] [2024-06-03 22:16:44,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216676819] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:16:44,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:16:44,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:16:44,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811376765] [2024-06-03 22:16:44,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:16:44,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:16:44,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:16:44,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:16:44,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:16:44,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:16:44,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 89 transitions, 795 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:44,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:16:44,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:16:44,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:16:45,210 INFO L124 PetriNetUnfolderBase]: 296/526 cut-off events. [2024-06-03 22:16:45,210 INFO L125 PetriNetUnfolderBase]: For 12748/12748 co-relation queries the response was YES. [2024-06-03 22:16:45,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3135 conditions, 526 events. 296/526 cut-off events. For 12748/12748 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2043 event pairs, 47 based on Foata normal form. 2/526 useless extension candidates. Maximal degree in co-relation 3083. Up to 350 conditions per place. [2024-06-03 22:16:45,213 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 69 selfloop transitions, 40 changer transitions 0/111 dead transitions. [2024-06-03 22:16:45,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 111 transitions, 1201 flow [2024-06-03 22:16:45,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:16:45,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:16:45,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-03 22:16:45,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-03 22:16:45,228 INFO L175 Difference]: Start difference. First operand has 103 places, 89 transitions, 795 flow. Second operand 9 states and 105 transitions. [2024-06-03 22:16:45,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 111 transitions, 1201 flow [2024-06-03 22:16:45,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 111 transitions, 1155 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-03 22:16:45,241 INFO L231 Difference]: Finished difference. Result has 106 places, 93 transitions, 874 flow [2024-06-03 22:16:45,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=874, PETRI_PLACES=106, PETRI_TRANSITIONS=93} [2024-06-03 22:16:45,242 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 75 predicate places. [2024-06-03 22:16:45,242 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 93 transitions, 874 flow [2024-06-03 22:16:45,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:45,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:45,243 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:16:45,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 22:16:45,243 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:16:45,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:45,243 INFO L85 PathProgramCache]: Analyzing trace with hash 210802829, now seen corresponding path program 4 times [2024-06-03 22:16:45,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:45,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966304963] [2024-06-03 22:16:45,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:45,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:16:49,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:16:49,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:16:49,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966304963] [2024-06-03 22:16:49,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966304963] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:16:49,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:16:49,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:16:49,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938109031] [2024-06-03 22:16:49,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:16:49,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:16:49,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:16:49,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:16:49,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:16:49,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:16:49,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 93 transitions, 874 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:49,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:16:49,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:16:49,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:16:49,710 INFO L124 PetriNetUnfolderBase]: 292/520 cut-off events. [2024-06-03 22:16:49,711 INFO L125 PetriNetUnfolderBase]: For 13016/13016 co-relation queries the response was YES. [2024-06-03 22:16:49,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3140 conditions, 520 events. 292/520 cut-off events. For 13016/13016 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2019 event pairs, 40 based on Foata normal form. 2/520 useless extension candidates. Maximal degree in co-relation 3087. Up to 347 conditions per place. [2024-06-03 22:16:49,716 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 66 selfloop transitions, 43 changer transitions 0/111 dead transitions. [2024-06-03 22:16:49,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 111 transitions, 1244 flow [2024-06-03 22:16:49,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:16:49,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:16:49,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-03 22:16:49,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3715277777777778 [2024-06-03 22:16:49,732 INFO L175 Difference]: Start difference. First operand has 106 places, 93 transitions, 874 flow. Second operand 9 states and 107 transitions. [2024-06-03 22:16:49,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 111 transitions, 1244 flow [2024-06-03 22:16:49,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 111 transitions, 1191 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-03 22:16:49,766 INFO L231 Difference]: Finished difference. Result has 110 places, 93 transitions, 912 flow [2024-06-03 22:16:49,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=912, PETRI_PLACES=110, PETRI_TRANSITIONS=93} [2024-06-03 22:16:49,771 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 79 predicate places. [2024-06-03 22:16:49,771 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 93 transitions, 912 flow [2024-06-03 22:16:49,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:49,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:49,784 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:16:49,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 22:16:49,784 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:16:49,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:49,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1364676231, now seen corresponding path program 4 times [2024-06-03 22:16:49,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:49,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828738378] [2024-06-03 22:16:49,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:49,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:16:54,614 INFO 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:54,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:16:54,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828738378] [2024-06-03 22:16:54,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828738378] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:16:54,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:16:54,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:16:54,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677579422] [2024-06-03 22:16:54,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:16:54,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:16:54,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:16:54,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:16:54,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:16:54,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:16:54,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 93 transitions, 912 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:54,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:16:54,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:16:54,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:16:55,039 INFO L124 PetriNetUnfolderBase]: 293/523 cut-off events. [2024-06-03 22:16:55,039 INFO L125 PetriNetUnfolderBase]: For 14164/14164 co-relation queries the response was YES. [2024-06-03 22:16:55,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3132 conditions, 523 events. 293/523 cut-off events. For 14164/14164 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2037 event pairs, 49 based on Foata normal form. 4/525 useless extension candidates. Maximal degree in co-relation 3078. Up to 399 conditions per place. [2024-06-03 22:16:55,043 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 77 selfloop transitions, 30 changer transitions 0/109 dead transitions. [2024-06-03 22:16:55,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 109 transitions, 1170 flow [2024-06-03 22:16:55,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:16:55,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:16:55,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-03 22:16:55,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3506944444444444 [2024-06-03 22:16:55,044 INFO L175 Difference]: Start difference. First operand has 110 places, 93 transitions, 912 flow. Second operand 9 states and 101 transitions. [2024-06-03 22:16:55,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 109 transitions, 1170 flow [2024-06-03 22:16:55,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 109 transitions, 1100 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 22:16:55,062 INFO L231 Difference]: Finished difference. Result has 113 places, 94 transitions, 915 flow [2024-06-03 22:16:55,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=915, PETRI_PLACES=113, PETRI_TRANSITIONS=94} [2024-06-03 22:16:55,063 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 82 predicate places. [2024-06-03 22:16:55,063 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 94 transitions, 915 flow [2024-06-03 22:16:55,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:55,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:55,063 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:16:55,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 22:16:55,063 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:16:55,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:55,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1128316421, now seen corresponding path program 5 times [2024-06-03 22:16:55,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:55,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325058127] [2024-06-03 22:16:55,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:55,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:16:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:16:59,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:16:59,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325058127] [2024-06-03 22:16:59,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325058127] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:16:59,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:16:59,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:16:59,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560388220] [2024-06-03 22:16:59,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:16:59,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:16:59,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:16:59,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:16:59,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:16:59,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:16:59,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 94 transitions, 915 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:59,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:16:59,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:16:59,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:16:59,906 INFO L124 PetriNetUnfolderBase]: 299/533 cut-off events. [2024-06-03 22:16:59,907 INFO L125 PetriNetUnfolderBase]: For 14290/14290 co-relation queries the response was YES. [2024-06-03 22:16:59,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3197 conditions, 533 events. 299/533 cut-off events. For 14290/14290 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2096 event pairs, 41 based on Foata normal form. 2/533 useless extension candidates. Maximal degree in co-relation 3142. Up to 356 conditions per place. [2024-06-03 22:16:59,911 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 65 selfloop transitions, 48 changer transitions 0/115 dead transitions. [2024-06-03 22:16:59,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 115 transitions, 1323 flow [2024-06-03 22:16:59,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:16:59,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:16:59,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-03 22:16:59,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-03 22:16:59,913 INFO L175 Difference]: Start difference. First operand has 113 places, 94 transitions, 915 flow. Second operand 10 states and 115 transitions. [2024-06-03 22:16:59,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 115 transitions, 1323 flow [2024-06-03 22:16:59,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 115 transitions, 1237 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-03 22:16:59,932 INFO L231 Difference]: Finished difference. Result has 115 places, 96 transitions, 950 flow [2024-06-03 22:16:59,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=950, PETRI_PLACES=115, PETRI_TRANSITIONS=96} [2024-06-03 22:16:59,933 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 84 predicate places. [2024-06-03 22:16:59,933 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 96 transitions, 950 flow [2024-06-03 22:16:59,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:16:59,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:59,933 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:16:59,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 22:16:59,933 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:16:59,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:59,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1128316173, now seen corresponding path program 1 times [2024-06-03 22:16:59,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:59,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552800465] [2024-06-03 22:16:59,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:59,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:04,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:17:04,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:04,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552800465] [2024-06-03 22:17:04,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552800465] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:04,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:04,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:17:04,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062118683] [2024-06-03 22:17:04,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:04,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:17:04,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:04,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:17:04,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:17:04,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:17:04,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 96 transitions, 950 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:04,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:04,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:17:04,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:04,944 INFO L124 PetriNetUnfolderBase]: 307/546 cut-off events. [2024-06-03 22:17:04,944 INFO L125 PetriNetUnfolderBase]: For 15130/15130 co-relation queries the response was YES. [2024-06-03 22:17:04,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3320 conditions, 546 events. 307/546 cut-off events. For 15130/15130 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2153 event pairs, 54 based on Foata normal form. 1/545 useless extension candidates. Maximal degree in co-relation 3265. Up to 479 conditions per place. [2024-06-03 22:17:04,955 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 85 selfloop transitions, 28 changer transitions 0/115 dead transitions. [2024-06-03 22:17:04,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 115 transitions, 1358 flow [2024-06-03 22:17:04,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:17:04,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:17:04,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-03 22:17:04,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.340625 [2024-06-03 22:17:04,970 INFO L175 Difference]: Start difference. First operand has 115 places, 96 transitions, 950 flow. Second operand 10 states and 109 transitions. [2024-06-03 22:17:04,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 115 transitions, 1358 flow [2024-06-03 22:17:04,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 115 transitions, 1237 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-03 22:17:04,993 INFO L231 Difference]: Finished difference. Result has 116 places, 100 transitions, 922 flow [2024-06-03 22:17:04,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=922, PETRI_PLACES=116, PETRI_TRANSITIONS=100} [2024-06-03 22:17:04,994 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 85 predicate places. [2024-06-03 22:17:04,994 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 100 transitions, 922 flow [2024-06-03 22:17:04,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:04,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:04,995 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:04,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 22:17:04,995 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:17:04,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:04,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1128019503, now seen corresponding path program 2 times [2024-06-03 22:17:04,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:04,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988035585] [2024-06-03 22:17:04,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:04,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:09,686 INFO 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,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:09,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988035585] [2024-06-03 22:17:09,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988035585] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:09,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:09,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:17:09,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514014102] [2024-06-03 22:17:09,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:09,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:17:09,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:09,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:17:09,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:17:09,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:17:09,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 100 transitions, 922 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:09,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:09,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:17:09,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:10,109 INFO L124 PetriNetUnfolderBase]: 305/543 cut-off events. [2024-06-03 22:17:10,109 INFO L125 PetriNetUnfolderBase]: For 15389/15389 co-relation queries the response was YES. [2024-06-03 22:17:10,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3199 conditions, 543 events. 305/543 cut-off events. For 15389/15389 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2146 event pairs, 56 based on Foata normal form. 1/542 useless extension candidates. Maximal degree in co-relation 3144. Up to 477 conditions per place. [2024-06-03 22:17:10,113 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 84 selfloop transitions, 28 changer transitions 0/114 dead transitions. [2024-06-03 22:17:10,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 114 transitions, 1238 flow [2024-06-03 22:17:10,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:17:10,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:17:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-03 22:17:10,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.334375 [2024-06-03 22:17:10,115 INFO L175 Difference]: Start difference. First operand has 116 places, 100 transitions, 922 flow. Second operand 10 states and 107 transitions. [2024-06-03 22:17:10,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 114 transitions, 1238 flow [2024-06-03 22:17:10,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 114 transitions, 1174 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-03 22:17:10,135 INFO L231 Difference]: Finished difference. Result has 119 places, 100 transitions, 919 flow [2024-06-03 22:17:10,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=919, PETRI_PLACES=119, PETRI_TRANSITIONS=100} [2024-06-03 22:17:10,136 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 88 predicate places. [2024-06-03 22:17:10,136 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 100 transitions, 919 flow [2024-06-03 22:17:10,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:10,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:10,137 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:10,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 22:17:10,137 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:17:10,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:10,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1136597141, now seen corresponding path program 6 times [2024-06-03 22:17:10,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:10,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226365781] [2024-06-03 22:17:10,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:10,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:14,672 INFO 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,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:14,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226365781] [2024-06-03 22:17:14,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226365781] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:14,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:14,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:17:14,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514024818] [2024-06-03 22:17:14,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:14,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:17:14,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:14,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:17:14,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:17:14,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:17:14,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 100 transitions, 919 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:14,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:14,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:17:14,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:15,042 INFO L124 PetriNetUnfolderBase]: 311/553 cut-off events. [2024-06-03 22:17:15,042 INFO L125 PetriNetUnfolderBase]: For 16875/16875 co-relation queries the response was YES. [2024-06-03 22:17:15,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3265 conditions, 553 events. 311/553 cut-off events. For 16875/16875 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2199 event pairs, 49 based on Foata normal form. 2/553 useless extension candidates. Maximal degree in co-relation 3209. Up to 372 conditions per place. [2024-06-03 22:17:15,046 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 73 selfloop transitions, 44 changer transitions 0/119 dead transitions. [2024-06-03 22:17:15,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 119 transitions, 1339 flow [2024-06-03 22:17:15,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:17:15,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:17:15,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-03 22:17:15,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2024-06-03 22:17:15,047 INFO L175 Difference]: Start difference. First operand has 119 places, 100 transitions, 919 flow. Second operand 9 states and 106 transitions. [2024-06-03 22:17:15,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 119 transitions, 1339 flow [2024-06-03 22:17:15,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 119 transitions, 1278 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-03 22:17:15,071 INFO L231 Difference]: Finished difference. Result has 119 places, 102 transitions, 969 flow [2024-06-03 22:17:15,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=969, PETRI_PLACES=119, PETRI_TRANSITIONS=102} [2024-06-03 22:17:15,071 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 88 predicate places. [2024-06-03 22:17:15,072 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 102 transitions, 969 flow [2024-06-03 22:17:15,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:15,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:15,072 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:15,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 22:17:15,072 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:17:15,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:15,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1136590383, now seen corresponding path program 3 times [2024-06-03 22:17:15,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:15,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462370508] [2024-06-03 22:17:15,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:15,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:19,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:17:19,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:19,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462370508] [2024-06-03 22:17:19,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462370508] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:19,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:19,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:17:19,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037069209] [2024-06-03 22:17:19,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:19,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:17:19,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:19,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:17:19,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:17:19,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:17:19,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 102 transitions, 969 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:19,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:19,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:17:19,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:19,885 INFO L124 PetriNetUnfolderBase]: 309/550 cut-off events. [2024-06-03 22:17:19,885 INFO L125 PetriNetUnfolderBase]: For 17057/17057 co-relation queries the response was YES. [2024-06-03 22:17:19,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3306 conditions, 550 events. 309/550 cut-off events. For 17057/17057 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2181 event pairs, 54 based on Foata normal form. 1/549 useless extension candidates. Maximal degree in co-relation 3249. Up to 485 conditions per place. [2024-06-03 22:17:19,889 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 85 selfloop transitions, 27 changer transitions 0/114 dead transitions. [2024-06-03 22:17:19,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 114 transitions, 1221 flow [2024-06-03 22:17:19,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:17:19,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:17:19,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-03 22:17:19,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2024-06-03 22:17:19,890 INFO L175 Difference]: Start difference. First operand has 119 places, 102 transitions, 969 flow. Second operand 9 states and 98 transitions. [2024-06-03 22:17:19,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 114 transitions, 1221 flow [2024-06-03 22:17:19,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 114 transitions, 1117 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-03 22:17:19,913 INFO L231 Difference]: Finished difference. Result has 121 places, 102 transitions, 924 flow [2024-06-03 22:17:19,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=924, PETRI_PLACES=121, PETRI_TRANSITIONS=102} [2024-06-03 22:17:19,913 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 90 predicate places. [2024-06-03 22:17:19,913 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 102 transitions, 924 flow [2024-06-03 22:17:19,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:19,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:19,914 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:19,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 22:17:19,914 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:17:19,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:19,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1617259939, now seen corresponding path program 7 times [2024-06-03 22:17:19,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:19,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609315721] [2024-06-03 22:17:19,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:19,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:24,206 INFO 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:24,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:24,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609315721] [2024-06-03 22:17:24,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609315721] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:24,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:24,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:17:24,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470655545] [2024-06-03 22:17:24,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:24,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:17:24,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:24,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:17:24,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:17:24,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:17:24,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 102 transitions, 924 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:24,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:24,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:17:24,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:24,567 INFO L124 PetriNetUnfolderBase]: 305/544 cut-off events. [2024-06-03 22:17:24,568 INFO L125 PetriNetUnfolderBase]: For 17224/17224 co-relation queries the response was YES. [2024-06-03 22:17:24,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3186 conditions, 544 events. 305/544 cut-off events. For 17224/17224 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2166 event pairs, 47 based on Foata normal form. 2/544 useless extension candidates. Maximal degree in co-relation 3128. Up to 366 conditions per place. [2024-06-03 22:17:24,571 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 74 selfloop transitions, 43 changer transitions 0/119 dead transitions. [2024-06-03 22:17:24,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 119 transitions, 1270 flow [2024-06-03 22:17:24,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:17:24,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:17:24,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-03 22:17:24,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2024-06-03 22:17:24,574 INFO L175 Difference]: Start difference. First operand has 121 places, 102 transitions, 924 flow. Second operand 9 states and 106 transitions. [2024-06-03 22:17:24,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 119 transitions, 1270 flow [2024-06-03 22:17:24,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 119 transitions, 1200 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-03 22:17:24,599 INFO L231 Difference]: Finished difference. Result has 122 places, 102 transitions, 945 flow [2024-06-03 22:17:24,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=945, PETRI_PLACES=122, PETRI_TRANSITIONS=102} [2024-06-03 22:17:24,599 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 91 predicate places. [2024-06-03 22:17:24,599 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 102 transitions, 945 flow [2024-06-03 22:17:24,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:24,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:24,600 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:24,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 22:17:24,600 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:17:24,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:24,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1128008591, now seen corresponding path program 1 times [2024-06-03 22:17:24,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:24,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890441614] [2024-06-03 22:17:24,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:24,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:29,283 INFO 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:29,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:29,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890441614] [2024-06-03 22:17:29,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890441614] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:29,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:29,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:17:29,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978960657] [2024-06-03 22:17:29,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:29,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:17:29,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:29,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:17:29,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:17:29,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:17:29,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 102 transitions, 945 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:29,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:29,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:17:29,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:29,709 INFO L124 PetriNetUnfolderBase]: 306/547 cut-off events. [2024-06-03 22:17:29,709 INFO L125 PetriNetUnfolderBase]: For 18439/18439 co-relation queries the response was YES. [2024-06-03 22:17:29,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3207 conditions, 547 events. 306/547 cut-off events. For 18439/18439 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2178 event pairs, 53 based on Foata normal form. 4/549 useless extension candidates. Maximal degree in co-relation 3148. Up to 464 conditions per place. [2024-06-03 22:17:29,733 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 84 selfloop transitions, 33 changer transitions 0/119 dead transitions. [2024-06-03 22:17:29,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 119 transitions, 1230 flow [2024-06-03 22:17:29,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:17:29,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:17:29,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-03 22:17:29,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32670454545454547 [2024-06-03 22:17:29,734 INFO L175 Difference]: Start difference. First operand has 122 places, 102 transitions, 945 flow. Second operand 11 states and 115 transitions. [2024-06-03 22:17:29,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 119 transitions, 1230 flow [2024-06-03 22:17:29,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 119 transitions, 1114 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-03 22:17:29,757 INFO L231 Difference]: Finished difference. Result has 125 places, 104 transitions, 925 flow [2024-06-03 22:17:29,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=925, PETRI_PLACES=125, PETRI_TRANSITIONS=104} [2024-06-03 22:17:29,758 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 94 predicate places. [2024-06-03 22:17:29,758 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 104 transitions, 925 flow [2024-06-03 22:17:29,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:29,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:29,758 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:17:29,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 22:17:29,759 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:17:29,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:29,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1428186481, now seen corresponding path program 1 times [2024-06-03 22:17:29,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:29,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909823642] [2024-06-03 22:17:29,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:29,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:33,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:17:33,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:33,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909823642] [2024-06-03 22:17:33,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909823642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:33,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:33,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:17:33,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746650096] [2024-06-03 22:17:33,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:33,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:17:33,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:33,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:17:33,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:17:34,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:17:34,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 104 transitions, 925 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:34,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:34,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:17:34,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:34,365 INFO L124 PetriNetUnfolderBase]: 310/555 cut-off events. [2024-06-03 22:17:34,365 INFO L125 PetriNetUnfolderBase]: For 17999/17999 co-relation queries the response was YES. [2024-06-03 22:17:34,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3246 conditions, 555 events. 310/555 cut-off events. For 17999/17999 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2237 event pairs, 32 based on Foata normal form. 2/555 useless extension candidates. Maximal degree in co-relation 3185. Up to 485 conditions per place. [2024-06-03 22:17:34,369 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 109 selfloop transitions, 12 changer transitions 0/123 dead transitions. [2024-06-03 22:17:34,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 123 transitions, 1217 flow [2024-06-03 22:17:34,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:17:34,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:17:34,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2024-06-03 22:17:34,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3263888888888889 [2024-06-03 22:17:34,370 INFO L175 Difference]: Start difference. First operand has 125 places, 104 transitions, 925 flow. Second operand 9 states and 94 transitions. [2024-06-03 22:17:34,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 123 transitions, 1217 flow [2024-06-03 22:17:34,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 123 transitions, 1136 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-03 22:17:34,397 INFO L231 Difference]: Finished difference. Result has 126 places, 105 transitions, 882 flow [2024-06-03 22:17:34,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=882, PETRI_PLACES=126, PETRI_TRANSITIONS=105} [2024-06-03 22:17:34,397 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 95 predicate places. [2024-06-03 22:17:34,397 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 105 transitions, 882 flow [2024-06-03 22:17:34,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:34,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:34,398 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:17:34,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 22:17:34,398 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:17:34,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:34,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1717141770, now seen corresponding path program 1 times [2024-06-03 22:17:34,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:34,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390090612] [2024-06-03 22:17:34,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:34,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:38,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:17:38,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:38,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390090612] [2024-06-03 22:17:38,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390090612] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:38,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:38,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:17:38,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913358212] [2024-06-03 22:17:38,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:38,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:17:38,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:38,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:17:38,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:17:38,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:17:38,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 105 transitions, 882 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:38,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:38,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:17:38,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:38,976 INFO L124 PetriNetUnfolderBase]: 308/552 cut-off events. [2024-06-03 22:17:38,976 INFO L125 PetriNetUnfolderBase]: For 17486/17486 co-relation queries the response was YES. [2024-06-03 22:17:38,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3149 conditions, 552 events. 308/552 cut-off events. For 17486/17486 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2234 event pairs, 46 based on Foata normal form. 1/551 useless extension candidates. Maximal degree in co-relation 3087. Up to 485 conditions per place. [2024-06-03 22:17:38,980 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 100 selfloop transitions, 21 changer transitions 0/123 dead transitions. [2024-06-03 22:17:38,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 123 transitions, 1172 flow [2024-06-03 22:17:38,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:17:38,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:17:38,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-03 22:17:38,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2024-06-03 22:17:38,981 INFO L175 Difference]: Start difference. First operand has 126 places, 105 transitions, 882 flow. Second operand 9 states and 98 transitions. [2024-06-03 22:17:38,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 123 transitions, 1172 flow [2024-06-03 22:17:39,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 123 transitions, 1140 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-03 22:17:39,006 INFO L231 Difference]: Finished difference. Result has 128 places, 105 transitions, 900 flow [2024-06-03 22:17:39,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=900, PETRI_PLACES=128, PETRI_TRANSITIONS=105} [2024-06-03 22:17:39,007 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 97 predicate places. [2024-06-03 22:17:39,007 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 105 transitions, 900 flow [2024-06-03 22:17:39,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:39,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:39,007 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:17:39,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 22:17:39,007 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:17:39,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:39,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1717141615, now seen corresponding path program 2 times [2024-06-03 22:17:39,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:39,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394565774] [2024-06-03 22:17:39,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:39,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:43,395 INFO 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:43,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:43,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394565774] [2024-06-03 22:17:43,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394565774] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:43,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:43,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:17:43,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052479450] [2024-06-03 22:17:43,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:43,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:17:43,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:43,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:17:43,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:17:43,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:17:43,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 105 transitions, 900 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:43,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:43,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:17:43,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:43,819 INFO L124 PetriNetUnfolderBase]: 312/560 cut-off events. [2024-06-03 22:17:43,819 INFO L125 PetriNetUnfolderBase]: For 19119/19119 co-relation queries the response was YES. [2024-06-03 22:17:43,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3223 conditions, 560 events. 312/560 cut-off events. For 19119/19119 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2273 event pairs, 48 based on Foata normal form. 2/560 useless extension candidates. Maximal degree in co-relation 3160. Up to 496 conditions per place. [2024-06-03 22:17:43,823 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 104 selfloop transitions, 18 changer transitions 0/124 dead transitions. [2024-06-03 22:17:43,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 124 transitions, 1200 flow [2024-06-03 22:17:43,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:17:43,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:17:43,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-03 22:17:43,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3368055555555556 [2024-06-03 22:17:43,824 INFO L175 Difference]: Start difference. First operand has 128 places, 105 transitions, 900 flow. Second operand 9 states and 97 transitions. [2024-06-03 22:17:43,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 124 transitions, 1200 flow [2024-06-03 22:17:43,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 124 transitions, 1102 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-03 22:17:43,851 INFO L231 Difference]: Finished difference. Result has 127 places, 106 transitions, 855 flow [2024-06-03 22:17:43,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=855, PETRI_PLACES=127, PETRI_TRANSITIONS=106} [2024-06-03 22:17:43,851 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 96 predicate places. [2024-06-03 22:17:43,851 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 106 transitions, 855 flow [2024-06-03 22:17:43,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:43,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:43,852 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:17:43,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-03 22:17:43,852 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:17:43,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:43,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1717137895, now seen corresponding path program 3 times [2024-06-03 22:17:43,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:43,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735110079] [2024-06-03 22:17:43,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:43,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:48,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:17:48,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:48,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735110079] [2024-06-03 22:17:48,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735110079] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:48,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:48,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:17:48,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234901219] [2024-06-03 22:17:48,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:48,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:17:48,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:48,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:17:48,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:17:48,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:17:48,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 106 transitions, 855 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:48,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:48,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:17:48,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:48,502 INFO L124 PetriNetUnfolderBase]: 316/568 cut-off events. [2024-06-03 22:17:48,503 INFO L125 PetriNetUnfolderBase]: For 19260/19260 co-relation queries the response was YES. [2024-06-03 22:17:48,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3222 conditions, 568 events. 316/568 cut-off events. For 19260/19260 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2347 event pairs, 46 based on Foata normal form. 2/568 useless extension candidates. Maximal degree in co-relation 3158. Up to 488 conditions per place. [2024-06-03 22:17:48,507 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 105 selfloop transitions, 18 changer transitions 0/125 dead transitions. [2024-06-03 22:17:48,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 125 transitions, 1157 flow [2024-06-03 22:17:48,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:17:48,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:17:48,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-03 22:17:48,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2024-06-03 22:17:48,509 INFO L175 Difference]: Start difference. First operand has 127 places, 106 transitions, 855 flow. Second operand 9 states and 98 transitions. [2024-06-03 22:17:48,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 125 transitions, 1157 flow [2024-06-03 22:17:48,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 125 transitions, 1116 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-03 22:17:48,540 INFO L231 Difference]: Finished difference. Result has 129 places, 107 transitions, 868 flow [2024-06-03 22:17:48,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=868, PETRI_PLACES=129, PETRI_TRANSITIONS=107} [2024-06-03 22:17:48,549 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 98 predicate places. [2024-06-03 22:17:48,550 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 107 transitions, 868 flow [2024-06-03 22:17:48,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:48,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:48,550 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:17:48,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-03 22:17:48,550 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:17:48,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:48,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1339466899, now seen corresponding path program 1 times [2024-06-03 22:17:48,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:48,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167462091] [2024-06-03 22:17:48,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:48,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:53,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:17:53,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:53,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167462091] [2024-06-03 22:17:53,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167462091] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:53,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:53,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:17:53,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364723922] [2024-06-03 22:17:53,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:53,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:17:53,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:53,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:17:53,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:17:53,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:17:53,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 107 transitions, 868 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:53,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:53,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:17:53,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:53,434 INFO L124 PetriNetUnfolderBase]: 322/578 cut-off events. [2024-06-03 22:17:53,434 INFO L125 PetriNetUnfolderBase]: For 20257/20257 co-relation queries the response was YES. [2024-06-03 22:17:53,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3284 conditions, 578 events. 322/578 cut-off events. For 20257/20257 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2395 event pairs, 45 based on Foata normal form. 2/578 useless extension candidates. Maximal degree in co-relation 3219. Up to 512 conditions per place. [2024-06-03 22:17:53,438 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 109 selfloop transitions, 18 changer transitions 0/129 dead transitions. [2024-06-03 22:17:53,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 129 transitions, 1191 flow [2024-06-03 22:17:53,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:17:53,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:17:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-03 22:17:53,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.334375 [2024-06-03 22:17:53,439 INFO L175 Difference]: Start difference. First operand has 129 places, 107 transitions, 868 flow. Second operand 10 states and 107 transitions. [2024-06-03 22:17:53,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 129 transitions, 1191 flow [2024-06-03 22:17:53,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 129 transitions, 1147 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-03 22:17:53,473 INFO L231 Difference]: Finished difference. Result has 132 places, 109 transitions, 884 flow [2024-06-03 22:17:53,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=884, PETRI_PLACES=132, PETRI_TRANSITIONS=109} [2024-06-03 22:17:53,473 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 101 predicate places. [2024-06-03 22:17:53,473 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 109 transitions, 884 flow [2024-06-03 22:17:53,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:53,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:53,474 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:17:53,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-03 22:17:53,474 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:17:53,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:53,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2054836295, now seen corresponding path program 2 times [2024-06-03 22:17:53,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:53,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583957008] [2024-06-03 22:17:53,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:53,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:57,766 INFO 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,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:57,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583957008] [2024-06-03 22:17:57,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583957008] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:57,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:57,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:17:57,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131210035] [2024-06-03 22:17:57,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:57,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:17:57,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:57,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:17:57,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:17:57,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:17:57,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 109 transitions, 884 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:57,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:57,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:17:57,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:58,184 INFO L124 PetriNetUnfolderBase]: 334/598 cut-off events. [2024-06-03 22:17:58,185 INFO L125 PetriNetUnfolderBase]: For 22776/22776 co-relation queries the response was YES. [2024-06-03 22:17:58,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3388 conditions, 598 events. 334/598 cut-off events. For 22776/22776 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2496 event pairs, 37 based on Foata normal form. 4/600 useless extension candidates. Maximal degree in co-relation 3322. Up to 289 conditions per place. [2024-06-03 22:17:58,189 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 74 selfloop transitions, 60 changer transitions 0/136 dead transitions. [2024-06-03 22:17:58,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 136 transitions, 1423 flow [2024-06-03 22:17:58,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:17:58,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:17:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-03 22:17:58,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-03 22:17:58,190 INFO L175 Difference]: Start difference. First operand has 132 places, 109 transitions, 884 flow. Second operand 10 states and 122 transitions. [2024-06-03 22:17:58,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 136 transitions, 1423 flow [2024-06-03 22:17:58,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 136 transitions, 1384 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-03 22:17:58,223 INFO L231 Difference]: Finished difference. Result has 134 places, 115 transitions, 1026 flow [2024-06-03 22:17:58,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1026, PETRI_PLACES=134, PETRI_TRANSITIONS=115} [2024-06-03 22:17:58,224 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 103 predicate places. [2024-06-03 22:17:58,224 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 115 transitions, 1026 flow [2024-06-03 22:17:58,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:58,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:58,225 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:17:58,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-03 22:17:58,225 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:17:58,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:58,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1864958977, now seen corresponding path program 3 times [2024-06-03 22:17:58,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:58,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320681127] [2024-06-03 22:17:58,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:58,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:02,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:18:02,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:02,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320681127] [2024-06-03 22:18:02,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320681127] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:02,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:02,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:18:02,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763884294] [2024-06-03 22:18:02,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:02,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:18:02,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:02,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:18:02,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:18:02,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:18:02,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 115 transitions, 1026 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:02,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:02,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:18:02,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:03,236 INFO L124 PetriNetUnfolderBase]: 340/608 cut-off events. [2024-06-03 22:18:03,237 INFO L125 PetriNetUnfolderBase]: For 22609/22609 co-relation queries the response was YES. [2024-06-03 22:18:03,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3605 conditions, 608 events. 340/608 cut-off events. For 22609/22609 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2557 event pairs, 43 based on Foata normal form. 2/608 useless extension candidates. Maximal degree in co-relation 3538. Up to 291 conditions per place. [2024-06-03 22:18:03,240 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 78 selfloop transitions, 58 changer transitions 0/138 dead transitions. [2024-06-03 22:18:03,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 138 transitions, 1549 flow [2024-06-03 22:18:03,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:18:03,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:18:03,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-03 22:18:03,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-03 22:18:03,242 INFO L175 Difference]: Start difference. First operand has 134 places, 115 transitions, 1026 flow. Second operand 10 states and 122 transitions. [2024-06-03 22:18:03,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 138 transitions, 1549 flow [2024-06-03 22:18:03,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 138 transitions, 1487 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-03 22:18:03,279 INFO L231 Difference]: Finished difference. Result has 139 places, 117 transitions, 1110 flow [2024-06-03 22:18:03,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=964, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1110, PETRI_PLACES=139, PETRI_TRANSITIONS=117} [2024-06-03 22:18:03,280 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 108 predicate places. [2024-06-03 22:18:03,280 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 117 transitions, 1110 flow [2024-06-03 22:18:03,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:03,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:03,280 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:03,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-03 22:18:03,280 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:18:03,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:03,281 INFO L85 PathProgramCache]: Analyzing trace with hash -2055051497, now seen corresponding path program 4 times [2024-06-03 22:18:03,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:03,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537358737] [2024-06-03 22:18:03,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:03,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:07,845 INFO 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:07,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:07,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537358737] [2024-06-03 22:18:07,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537358737] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:07,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:07,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:18:07,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208170048] [2024-06-03 22:18:07,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:07,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:18:07,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:07,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:18:07,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:18:07,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:18:07,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 117 transitions, 1110 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:07,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:07,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:18:07,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:08,255 INFO L124 PetriNetUnfolderBase]: 344/616 cut-off events. [2024-06-03 22:18:08,256 INFO L125 PetriNetUnfolderBase]: For 24008/24008 co-relation queries the response was YES. [2024-06-03 22:18:08,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3776 conditions, 616 events. 344/616 cut-off events. For 24008/24008 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2603 event pairs, 39 based on Foata normal form. 2/616 useless extension candidates. Maximal degree in co-relation 3707. Up to 498 conditions per place. [2024-06-03 22:18:08,260 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 99 selfloop transitions, 33 changer transitions 0/134 dead transitions. [2024-06-03 22:18:08,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 134 transitions, 1430 flow [2024-06-03 22:18:08,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:18:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:18:08,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-03 22:18:08,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3506944444444444 [2024-06-03 22:18:08,261 INFO L175 Difference]: Start difference. First operand has 139 places, 117 transitions, 1110 flow. Second operand 9 states and 101 transitions. [2024-06-03 22:18:08,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 134 transitions, 1430 flow [2024-06-03 22:18:08,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 134 transitions, 1327 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-03 22:18:08,303 INFO L231 Difference]: Finished difference. Result has 141 places, 118 transitions, 1093 flow [2024-06-03 22:18:08,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1093, PETRI_PLACES=141, PETRI_TRANSITIONS=118} [2024-06-03 22:18:08,304 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 110 predicate places. [2024-06-03 22:18:08,304 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 118 transitions, 1093 flow [2024-06-03 22:18:08,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:08,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:08,304 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:08,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-03 22:18:08,305 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:18:08,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:08,305 INFO L85 PathProgramCache]: Analyzing trace with hash -2055045545, now seen corresponding path program 4 times [2024-06-03 22:18:08,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:08,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393094953] [2024-06-03 22:18:08,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:08,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:12,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:18:12,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:12,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393094953] [2024-06-03 22:18:12,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393094953] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:12,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:12,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:18:12,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029572852] [2024-06-03 22:18:12,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:12,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:18:12,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:12,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:18:12,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:18:12,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:18:12,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 118 transitions, 1093 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:12,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:12,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:18:12,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:12,813 INFO L124 PetriNetUnfolderBase]: 350/626 cut-off events. [2024-06-03 22:18:12,813 INFO L125 PetriNetUnfolderBase]: For 25065/25065 co-relation queries the response was YES. [2024-06-03 22:18:12,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3805 conditions, 626 events. 350/626 cut-off events. For 25065/25065 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2650 event pairs, 45 based on Foata normal form. 2/626 useless extension candidates. Maximal degree in co-relation 3735. Up to 301 conditions per place. [2024-06-03 22:18:12,818 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 82 selfloop transitions, 57 changer transitions 0/141 dead transitions. [2024-06-03 22:18:12,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 141 transitions, 1633 flow [2024-06-03 22:18:12,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:18:12,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:18:12,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-03 22:18:12,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-03 22:18:12,819 INFO L175 Difference]: Start difference. First operand has 141 places, 118 transitions, 1093 flow. Second operand 10 states and 122 transitions. [2024-06-03 22:18:12,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 141 transitions, 1633 flow [2024-06-03 22:18:12,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 141 transitions, 1557 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-03 22:18:12,860 INFO L231 Difference]: Finished difference. Result has 144 places, 120 transitions, 1164 flow [2024-06-03 22:18:12,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1164, PETRI_PLACES=144, PETRI_TRANSITIONS=120} [2024-06-03 22:18:12,862 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 113 predicate places. [2024-06-03 22:18:12,862 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 120 transitions, 1164 flow [2024-06-03 22:18:12,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:12,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:12,863 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:12,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-03 22:18:12,863 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:18:12,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:12,865 INFO L85 PathProgramCache]: Analyzing trace with hash -2060558027, now seen corresponding path program 5 times [2024-06-03 22:18:12,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:12,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757233157] [2024-06-03 22:18:12,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:12,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:17,106 INFO 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,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:17,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757233157] [2024-06-03 22:18:17,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757233157] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:17,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:17,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:18:17,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681393748] [2024-06-03 22:18:17,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:17,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:18:17,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:17,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:18:17,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:18:17,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:18:17,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 120 transitions, 1164 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:17,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:17,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:18:17,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:17,460 INFO L124 PetriNetUnfolderBase]: 354/634 cut-off events. [2024-06-03 22:18:17,460 INFO L125 PetriNetUnfolderBase]: For 26451/26451 co-relation queries the response was YES. [2024-06-03 22:18:17,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3930 conditions, 634 events. 354/634 cut-off events. For 26451/26451 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2720 event pairs, 43 based on Foata normal form. 2/634 useless extension candidates. Maximal degree in co-relation 3859. Up to 516 conditions per place. [2024-06-03 22:18:17,465 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 106 selfloop transitions, 29 changer transitions 0/137 dead transitions. [2024-06-03 22:18:17,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 137 transitions, 1492 flow [2024-06-03 22:18:17,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:18:17,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:18:17,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2024-06-03 22:18:17,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3472222222222222 [2024-06-03 22:18:17,466 INFO L175 Difference]: Start difference. First operand has 144 places, 120 transitions, 1164 flow. Second operand 9 states and 100 transitions. [2024-06-03 22:18:17,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 137 transitions, 1492 flow [2024-06-03 22:18:17,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 137 transitions, 1396 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-03 22:18:17,512 INFO L231 Difference]: Finished difference. Result has 146 places, 121 transitions, 1148 flow [2024-06-03 22:18:17,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1148, PETRI_PLACES=146, PETRI_TRANSITIONS=121} [2024-06-03 22:18:17,513 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 115 predicate places. [2024-06-03 22:18:17,513 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 121 transitions, 1148 flow [2024-06-03 22:18:17,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:17,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:17,513 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:17,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-03 22:18:17,513 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:18:17,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:17,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2060407925, now seen corresponding path program 5 times [2024-06-03 22:18:17,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:17,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80380046] [2024-06-03 22:18:17,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:17,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:21,851 INFO 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:21,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:21,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80380046] [2024-06-03 22:18:21,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80380046] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:21,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:21,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:18:21,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388949571] [2024-06-03 22:18:21,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:21,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:18:21,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:21,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:18:21,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:18:21,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:18:21,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 121 transitions, 1148 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:21,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:21,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:18:21,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:22,244 INFO L124 PetriNetUnfolderBase]: 364/650 cut-off events. [2024-06-03 22:18:22,244 INFO L125 PetriNetUnfolderBase]: For 28500/28500 co-relation queries the response was YES. [2024-06-03 22:18:22,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4023 conditions, 650 events. 364/650 cut-off events. For 28500/28500 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2790 event pairs, 53 based on Foata normal form. 2/650 useless extension candidates. Maximal degree in co-relation 3951. Up to 319 conditions per place. [2024-06-03 22:18:22,249 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 83 selfloop transitions, 61 changer transitions 0/146 dead transitions. [2024-06-03 22:18:22,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 146 transitions, 1727 flow [2024-06-03 22:18:22,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:18:22,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:18:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-03 22:18:22,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-03 22:18:22,250 INFO L175 Difference]: Start difference. First operand has 146 places, 121 transitions, 1148 flow. Second operand 10 states and 118 transitions. [2024-06-03 22:18:22,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 146 transitions, 1727 flow [2024-06-03 22:18:22,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 146 transitions, 1657 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-03 22:18:22,303 INFO L231 Difference]: Finished difference. Result has 150 places, 126 transitions, 1304 flow [2024-06-03 22:18:22,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1078, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1304, PETRI_PLACES=150, PETRI_TRANSITIONS=126} [2024-06-03 22:18:22,304 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 119 predicate places. [2024-06-03 22:18:22,304 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 126 transitions, 1304 flow [2024-06-03 22:18:22,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:22,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:22,305 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:22,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-03 22:18:22,305 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:18:22,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:22,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1861033261, now seen corresponding path program 6 times [2024-06-03 22:18:22,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:22,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979754503] [2024-06-03 22:18:22,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:22,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:26,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:26,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:26,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979754503] [2024-06-03 22:18:26,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979754503] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:26,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:26,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:18:26,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252324698] [2024-06-03 22:18:26,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:26,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:18:26,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:26,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:18:26,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:18:27,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:18:27,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 126 transitions, 1304 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:27,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:27,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:18:27,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:27,284 INFO L124 PetriNetUnfolderBase]: 361/645 cut-off events. [2024-06-03 22:18:27,285 INFO L125 PetriNetUnfolderBase]: For 27980/27980 co-relation queries the response was YES. [2024-06-03 22:18:27,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4084 conditions, 645 events. 361/645 cut-off events. For 27980/27980 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2767 event pairs, 44 based on Foata normal form. 2/645 useless extension candidates. Maximal degree in co-relation 4010. Up to 491 conditions per place. [2024-06-03 22:18:27,289 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 108 selfloop transitions, 32 changer transitions 0/142 dead transitions. [2024-06-03 22:18:27,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 142 transitions, 1624 flow [2024-06-03 22:18:27,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:18:27,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:18:27,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2024-06-03 22:18:27,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3472222222222222 [2024-06-03 22:18:27,290 INFO L175 Difference]: Start difference. First operand has 150 places, 126 transitions, 1304 flow. Second operand 9 states and 100 transitions. [2024-06-03 22:18:27,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 142 transitions, 1624 flow [2024-06-03 22:18:27,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 142 transitions, 1555 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-03 22:18:27,343 INFO L231 Difference]: Finished difference. Result has 153 places, 126 transitions, 1304 flow [2024-06-03 22:18:27,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1235, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1304, PETRI_PLACES=153, PETRI_TRANSITIONS=126} [2024-06-03 22:18:27,343 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 122 predicate places. [2024-06-03 22:18:27,343 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 126 transitions, 1304 flow [2024-06-03 22:18:27,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:27,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:27,344 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:27,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-03 22:18:27,344 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:18:27,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:27,344 INFO L85 PathProgramCache]: Analyzing trace with hash -874771655, now seen corresponding path program 6 times [2024-06-03 22:18:27,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:27,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182448635] [2024-06-03 22:18:27,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:27,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:31,642 INFO 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:31,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:31,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182448635] [2024-06-03 22:18:31,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182448635] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:31,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:31,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:18:31,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766135649] [2024-06-03 22:18:31,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:31,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:18:31,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:31,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:18:31,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:18:31,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:18:31,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 126 transitions, 1304 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:31,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:31,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:18:31,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:32,078 INFO L124 PetriNetUnfolderBase]: 367/655 cut-off events. [2024-06-03 22:18:32,078 INFO L125 PetriNetUnfolderBase]: For 29339/29339 co-relation queries the response was YES. [2024-06-03 22:18:32,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4104 conditions, 655 events. 367/655 cut-off events. For 29339/29339 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2822 event pairs, 53 based on Foata normal form. 2/655 useless extension candidates. Maximal degree in co-relation 4029. Up to 316 conditions per place. [2024-06-03 22:18:32,083 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 88 selfloop transitions, 59 changer transitions 0/149 dead transitions. [2024-06-03 22:18:32,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 149 transitions, 1952 flow [2024-06-03 22:18:32,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:18:32,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:18:32,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-03 22:18:32,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-03 22:18:32,084 INFO L175 Difference]: Start difference. First operand has 153 places, 126 transitions, 1304 flow. Second operand 10 states and 124 transitions. [2024-06-03 22:18:32,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 149 transitions, 1952 flow [2024-06-03 22:18:32,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 149 transitions, 1875 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-03 22:18:32,147 INFO L231 Difference]: Finished difference. Result has 156 places, 128 transitions, 1372 flow [2024-06-03 22:18:32,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1372, PETRI_PLACES=156, PETRI_TRANSITIONS=128} [2024-06-03 22:18:32,147 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 125 predicate places. [2024-06-03 22:18:32,147 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 128 transitions, 1372 flow [2024-06-03 22:18:32,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:32,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:32,148 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:32,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-03 22:18:32,148 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:18:32,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:32,148 INFO L85 PathProgramCache]: Analyzing trace with hash -874562405, now seen corresponding path program 7 times [2024-06-03 22:18:32,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:32,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159360139] [2024-06-03 22:18:32,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:32,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:36,411 INFO 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,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:36,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159360139] [2024-06-03 22:18:36,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159360139] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:36,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:36,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:18:36,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730946221] [2024-06-03 22:18:36,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:36,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:18:36,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:36,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:18:36,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:18:36,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:18:36,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 128 transitions, 1372 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:36,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:36,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:18:36,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:36,799 INFO L124 PetriNetUnfolderBase]: 406/719 cut-off events. [2024-06-03 22:18:36,799 INFO L125 PetriNetUnfolderBase]: For 38681/38681 co-relation queries the response was YES. [2024-06-03 22:18:36,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4738 conditions, 719 events. 406/719 cut-off events. For 38681/38681 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3137 event pairs, 59 based on Foata normal form. 4/721 useless extension candidates. Maximal degree in co-relation 4662. Up to 342 conditions per place. [2024-06-03 22:18:36,804 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 94 selfloop transitions, 62 changer transitions 0/158 dead transitions. [2024-06-03 22:18:36,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 158 transitions, 2143 flow [2024-06-03 22:18:36,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:18:36,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:18:36,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-03 22:18:36,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-03 22:18:36,805 INFO L175 Difference]: Start difference. First operand has 156 places, 128 transitions, 1372 flow. Second operand 10 states and 124 transitions. [2024-06-03 22:18:36,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 158 transitions, 2143 flow [2024-06-03 22:18:36,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 158 transitions, 1947 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-03 22:18:36,884 INFO L231 Difference]: Finished difference. Result has 158 places, 136 transitions, 1435 flow [2024-06-03 22:18:36,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1435, PETRI_PLACES=158, PETRI_TRANSITIONS=136} [2024-06-03 22:18:36,887 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 127 predicate places. [2024-06-03 22:18:36,888 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 136 transitions, 1435 flow [2024-06-03 22:18:36,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:36,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:36,888 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,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-03 22:18:36,889 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:18:36,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:36,889 INFO L85 PathProgramCache]: Analyzing trace with hash -608864846, now seen corresponding path program 1 times [2024-06-03 22:18:36,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:36,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015468577] [2024-06-03 22:18:36,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:36,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:42,115 INFO 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,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:42,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015468577] [2024-06-03 22:18:42,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015468577] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:42,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:42,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:18:42,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187466250] [2024-06-03 22:18:42,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:42,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:18:42,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:42,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:18:42,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:18:42,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:18:42,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 136 transitions, 1435 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:42,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:42,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:18:42,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:42,552 INFO L124 PetriNetUnfolderBase]: 409/724 cut-off events. [2024-06-03 22:18:42,552 INFO L125 PetriNetUnfolderBase]: For 36326/36326 co-relation queries the response was YES. [2024-06-03 22:18:42,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4782 conditions, 724 events. 409/724 cut-off events. For 36326/36326 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3157 event pairs, 74 based on Foata normal form. 1/723 useless extension candidates. Maximal degree in co-relation 4705. Up to 656 conditions per place. [2024-06-03 22:18:42,558 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 120 selfloop transitions, 30 changer transitions 0/152 dead transitions. [2024-06-03 22:18:42,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 152 transitions, 1795 flow [2024-06-03 22:18:42,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:18:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:18:42,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2024-06-03 22:18:42,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32386363636363635 [2024-06-03 22:18:42,560 INFO L175 Difference]: Start difference. First operand has 158 places, 136 transitions, 1435 flow. Second operand 11 states and 114 transitions. [2024-06-03 22:18:42,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 152 transitions, 1795 flow [2024-06-03 22:18:42,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 152 transitions, 1682 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-03 22:18:42,642 INFO L231 Difference]: Finished difference. Result has 163 places, 138 transitions, 1419 flow [2024-06-03 22:18:42,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1323, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1419, PETRI_PLACES=163, PETRI_TRANSITIONS=138} [2024-06-03 22:18:42,642 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 132 predicate places. [2024-06-03 22:18:42,643 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 138 transitions, 1419 flow [2024-06-03 22:18:42,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:42,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:42,643 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:42,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-03 22:18:42,644 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:18:42,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:42,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1404548095, now seen corresponding path program 8 times [2024-06-03 22:18:42,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:42,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691151733] [2024-06-03 22:18:42,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:42,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:46,915 INFO 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:46,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:46,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691151733] [2024-06-03 22:18:46,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691151733] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:46,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:46,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:18:46,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460148341] [2024-06-03 22:18:46,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:46,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:18:46,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:46,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:18:46,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:18:47,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:18:47,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 138 transitions, 1419 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:47,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:47,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:18:47,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:47,346 INFO L124 PetriNetUnfolderBase]: 405/718 cut-off events. [2024-06-03 22:18:47,346 INFO L125 PetriNetUnfolderBase]: For 36269/36269 co-relation queries the response was YES. [2024-06-03 22:18:47,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4596 conditions, 718 events. 405/718 cut-off events. For 36269/36269 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3149 event pairs, 58 based on Foata normal form. 2/718 useless extension candidates. Maximal degree in co-relation 4518. Up to 343 conditions per place. [2024-06-03 22:18:47,351 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 95 selfloop transitions, 63 changer transitions 0/160 dead transitions. [2024-06-03 22:18:47,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 160 transitions, 2095 flow [2024-06-03 22:18:47,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:18:47,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:18:47,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-03 22:18:47,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-03 22:18:47,353 INFO L175 Difference]: Start difference. First operand has 163 places, 138 transitions, 1419 flow. Second operand 10 states and 125 transitions. [2024-06-03 22:18:47,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 160 transitions, 2095 flow [2024-06-03 22:18:47,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 160 transitions, 2024 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-03 22:18:47,452 INFO L231 Difference]: Finished difference. Result has 164 places, 139 transitions, 1491 flow [2024-06-03 22:18:47,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1348, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1491, PETRI_PLACES=164, PETRI_TRANSITIONS=139} [2024-06-03 22:18:47,453 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 133 predicate places. [2024-06-03 22:18:47,453 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 139 transitions, 1491 flow [2024-06-03 22:18:47,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:47,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:47,453 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:47,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-03 22:18:47,454 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:18:47,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:47,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1394423036, now seen corresponding path program 2 times [2024-06-03 22:18:47,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:47,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116786644] [2024-06-03 22:18:47,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:47,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:51,986 INFO 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:51,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:51,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116786644] [2024-06-03 22:18:51,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116786644] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:51,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:51,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:18:51,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220293005] [2024-06-03 22:18:51,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:51,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:18:51,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:51,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:18:51,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:18:52,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:18:52,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 139 transitions, 1491 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:52,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:52,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:18:52,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:52,492 INFO L124 PetriNetUnfolderBase]: 397/705 cut-off events. [2024-06-03 22:18:52,492 INFO L125 PetriNetUnfolderBase]: For 35502/35502 co-relation queries the response was YES. [2024-06-03 22:18:52,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4512 conditions, 705 events. 397/705 cut-off events. For 35502/35502 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3073 event pairs, 57 based on Foata normal form. 3/706 useless extension candidates. Maximal degree in co-relation 4433. Up to 415 conditions per place. [2024-06-03 22:18:52,498 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 95 selfloop transitions, 62 changer transitions 0/159 dead transitions. [2024-06-03 22:18:52,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 159 transitions, 2059 flow [2024-06-03 22:18:52,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:18:52,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:18:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-03 22:18:52,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-03 22:18:52,499 INFO L175 Difference]: Start difference. First operand has 164 places, 139 transitions, 1491 flow. Second operand 10 states and 120 transitions. [2024-06-03 22:18:52,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 159 transitions, 2059 flow [2024-06-03 22:18:52,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 159 transitions, 1929 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-03 22:18:52,568 INFO L231 Difference]: Finished difference. Result has 167 places, 139 transitions, 1494 flow [2024-06-03 22:18:52,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1361, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1494, PETRI_PLACES=167, PETRI_TRANSITIONS=139} [2024-06-03 22:18:52,569 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 136 predicate places. [2024-06-03 22:18:52,569 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 139 transitions, 1494 flow [2024-06-03 22:18:52,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:52,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:52,569 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:52,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-03 22:18:52,569 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:18:52,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:52,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1148047585, now seen corresponding path program 9 times [2024-06-03 22:18:52,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:52,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224564252] [2024-06-03 22:18:52,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:52,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:56,918 INFO 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:56,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:56,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224564252] [2024-06-03 22:18:56,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224564252] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:56,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:56,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:18:56,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626258089] [2024-06-03 22:18:56,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:56,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:18:56,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:56,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:18:56,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:18:57,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:18:57,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 139 transitions, 1494 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:57,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:57,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:18:57,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:57,425 INFO L124 PetriNetUnfolderBase]: 403/715 cut-off events. [2024-06-03 22:18:57,425 INFO L125 PetriNetUnfolderBase]: For 35573/35573 co-relation queries the response was YES. [2024-06-03 22:18:57,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4597 conditions, 715 events. 403/715 cut-off events. For 35573/35573 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3155 event pairs, 44 based on Foata normal form. 2/715 useless extension candidates. Maximal degree in co-relation 4517. Up to 338 conditions per place. [2024-06-03 22:18:57,431 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 89 selfloop transitions, 73 changer transitions 0/164 dead transitions. [2024-06-03 22:18:57,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 164 transitions, 2217 flow [2024-06-03 22:18:57,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:18:57,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:18:57,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-03 22:18:57,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-06-03 22:18:57,433 INFO L175 Difference]: Start difference. First operand has 167 places, 139 transitions, 1494 flow. Second operand 11 states and 135 transitions. [2024-06-03 22:18:57,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 164 transitions, 2217 flow [2024-06-03 22:18:57,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 164 transitions, 2063 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-03 22:18:57,502 INFO L231 Difference]: Finished difference. Result has 169 places, 141 transitions, 1522 flow [2024-06-03 22:18:57,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1344, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1522, PETRI_PLACES=169, PETRI_TRANSITIONS=141} [2024-06-03 22:18:57,502 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 138 predicate places. [2024-06-03 22:18:57,503 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 141 transitions, 1522 flow [2024-06-03 22:18:57,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:57,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:57,503 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,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-03 22:18:57,504 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:18:57,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:57,504 INFO L85 PathProgramCache]: Analyzing trace with hash -618061616, now seen corresponding path program 3 times [2024-06-03 22:18:57,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:57,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049734106] [2024-06-03 22:18:57,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:57,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:02,380 INFO 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:02,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:02,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049734106] [2024-06-03 22:19:02,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049734106] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:02,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:02,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:19:02,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577936781] [2024-06-03 22:19:02,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:02,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:19:02,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:02,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:19:02,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:19:02,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:19:02,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 141 transitions, 1522 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:02,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:02,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:19:02,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:02,836 INFO L124 PetriNetUnfolderBase]: 406/720 cut-off events. [2024-06-03 22:19:02,837 INFO L125 PetriNetUnfolderBase]: For 35494/35494 co-relation queries the response was YES. [2024-06-03 22:19:02,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4685 conditions, 720 events. 406/720 cut-off events. For 35494/35494 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3157 event pairs, 68 based on Foata normal form. 1/719 useless extension candidates. Maximal degree in co-relation 4604. Up to 652 conditions per place. [2024-06-03 22:19:02,842 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 125 selfloop transitions, 30 changer transitions 0/157 dead transitions. [2024-06-03 22:19:02,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 157 transitions, 1899 flow [2024-06-03 22:19:02,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:19:02,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:19:02,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-03 22:19:02,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32670454545454547 [2024-06-03 22:19:02,845 INFO L175 Difference]: Start difference. First operand has 169 places, 141 transitions, 1522 flow. Second operand 11 states and 115 transitions. [2024-06-03 22:19:02,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 157 transitions, 1899 flow [2024-06-03 22:19:02,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 157 transitions, 1661 flow, removed 9 selfloop flow, removed 12 redundant places. [2024-06-03 22:19:02,919 INFO L231 Difference]: Finished difference. Result has 168 places, 143 transitions, 1388 flow [2024-06-03 22:19:02,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1291, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1388, PETRI_PLACES=168, PETRI_TRANSITIONS=143} [2024-06-03 22:19:02,920 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 137 predicate places. [2024-06-03 22:19:02,920 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 143 transitions, 1388 flow [2024-06-03 22:19:02,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:02,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:02,920 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:02,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-03 22:19:02,920 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:19:02,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:02,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1366577095, now seen corresponding path program 10 times [2024-06-03 22:19:02,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:02,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367790536] [2024-06-03 22:19:02,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:02,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:07,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:19:07,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:07,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367790536] [2024-06-03 22:19:07,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367790536] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:07,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:07,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:19:07,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89334032] [2024-06-03 22:19:07,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:07,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:19:07,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:07,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:19:07,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:19:07,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:19:07,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 143 transitions, 1388 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:07,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:07,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:19:07,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:08,239 INFO L124 PetriNetUnfolderBase]: 428/756 cut-off events. [2024-06-03 22:19:08,239 INFO L125 PetriNetUnfolderBase]: For 43233/43233 co-relation queries the response was YES. [2024-06-03 22:19:08,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4743 conditions, 756 events. 428/756 cut-off events. For 43233/43233 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3356 event pairs, 51 based on Foata normal form. 4/758 useless extension candidates. Maximal degree in co-relation 4663. Up to 357 conditions per place. [2024-06-03 22:19:08,245 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 94 selfloop transitions, 76 changer transitions 0/172 dead transitions. [2024-06-03 22:19:08,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 172 transitions, 2172 flow [2024-06-03 22:19:08,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:19:08,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:19:08,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-03 22:19:08,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-03 22:19:08,247 INFO L175 Difference]: Start difference. First operand has 168 places, 143 transitions, 1388 flow. Second operand 11 states and 136 transitions. [2024-06-03 22:19:08,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 172 transitions, 2172 flow [2024-06-03 22:19:08,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 172 transitions, 2099 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-03 22:19:08,334 INFO L231 Difference]: Finished difference. Result has 170 places, 149 transitions, 1541 flow [2024-06-03 22:19:08,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1541, PETRI_PLACES=170, PETRI_TRANSITIONS=149} [2024-06-03 22:19:08,335 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 139 predicate places. [2024-06-03 22:19:08,335 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 149 transitions, 1541 flow [2024-06-03 22:19:08,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:08,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:08,335 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:08,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-03 22:19:08,335 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:19:08,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:08,336 INFO L85 PathProgramCache]: Analyzing trace with hash -608865125, now seen corresponding path program 11 times [2024-06-03 22:19:08,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:08,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613738625] [2024-06-03 22:19:08,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:08,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:12,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:19:12,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:12,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613738625] [2024-06-03 22:19:12,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613738625] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:12,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:12,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:19:12,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825058433] [2024-06-03 22:19:12,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:12,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:19:12,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:12,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:19:12,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:19:12,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:19:12,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 149 transitions, 1541 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:12,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:12,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:19:12,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:13,332 INFO L124 PetriNetUnfolderBase]: 422/748 cut-off events. [2024-06-03 22:19:13,332 INFO L125 PetriNetUnfolderBase]: For 39443/39443 co-relation queries the response was YES. [2024-06-03 22:19:13,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4665 conditions, 748 events. 422/748 cut-off events. For 39443/39443 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3328 event pairs, 47 based on Foata normal form. 4/750 useless extension candidates. Maximal degree in co-relation 4584. Up to 356 conditions per place. [2024-06-03 22:19:13,337 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 89 selfloop transitions, 81 changer transitions 0/172 dead transitions. [2024-06-03 22:19:13,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 172 transitions, 2267 flow [2024-06-03 22:19:13,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:19:13,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:19:13,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-03 22:19:13,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-03 22:19:13,340 INFO L175 Difference]: Start difference. First operand has 170 places, 149 transitions, 1541 flow. Second operand 11 states and 134 transitions. [2024-06-03 22:19:13,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 172 transitions, 2267 flow [2024-06-03 22:19:13,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 172 transitions, 2112 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-03 22:19:13,424 INFO L231 Difference]: Finished difference. Result has 174 places, 149 transitions, 1557 flow [2024-06-03 22:19:13,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1386, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1557, PETRI_PLACES=174, PETRI_TRANSITIONS=149} [2024-06-03 22:19:13,424 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 143 predicate places. [2024-06-03 22:19:13,424 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 149 transitions, 1557 flow [2024-06-03 22:19:13,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:13,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:13,425 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:13,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-03 22:19:13,425 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:19:13,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:13,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1138516666, now seen corresponding path program 4 times [2024-06-03 22:19:13,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:13,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999101597] [2024-06-03 22:19:13,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:13,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:18,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:19:18,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:18,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999101597] [2024-06-03 22:19:18,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999101597] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:18,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:18,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:19:18,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835535352] [2024-06-03 22:19:18,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:18,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:19:18,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:18,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:19:18,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:19:18,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:19:18,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 149 transitions, 1557 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:18,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:18,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:19:18,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:19,212 INFO L124 PetriNetUnfolderBase]: 418/741 cut-off events. [2024-06-03 22:19:19,212 INFO L125 PetriNetUnfolderBase]: For 34903/34903 co-relation queries the response was YES. [2024-06-03 22:19:19,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4600 conditions, 741 events. 418/741 cut-off events. For 34903/34903 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3263 event pairs, 69 based on Foata normal form. 1/740 useless extension candidates. Maximal degree in co-relation 4518. Up to 664 conditions per place. [2024-06-03 22:19:19,218 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 128 selfloop transitions, 35 changer transitions 0/165 dead transitions. [2024-06-03 22:19:19,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 165 transitions, 1932 flow [2024-06-03 22:19:19,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:19:19,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:19:19,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 123 transitions. [2024-06-03 22:19:19,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3203125 [2024-06-03 22:19:19,219 INFO L175 Difference]: Start difference. First operand has 174 places, 149 transitions, 1557 flow. Second operand 12 states and 123 transitions. [2024-06-03 22:19:19,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 165 transitions, 1932 flow [2024-06-03 22:19:19,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 165 transitions, 1750 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-03 22:19:19,295 INFO L231 Difference]: Finished difference. Result has 176 places, 150 transitions, 1467 flow [2024-06-03 22:19:19,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1467, PETRI_PLACES=176, PETRI_TRANSITIONS=150} [2024-06-03 22:19:19,295 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 145 predicate places. [2024-06-03 22:19:19,296 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 150 transitions, 1467 flow [2024-06-03 22:19:19,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:19,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:19,296 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,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-03 22:19:19,296 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:19:19,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:19,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1324106634, now seen corresponding path program 1 times [2024-06-03 22:19:19,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:19,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765620947] [2024-06-03 22:19:19,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:19,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:23,729 INFO 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:23,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:23,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765620947] [2024-06-03 22:19:23,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765620947] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:23,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:23,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:19:23,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039527762] [2024-06-03 22:19:23,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:23,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:19:23,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:23,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:19:23,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:19:23,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:19:23,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 150 transitions, 1467 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:23,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:23,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:19:23,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:24,192 INFO L124 PetriNetUnfolderBase]: 422/749 cut-off events. [2024-06-03 22:19:24,192 INFO L125 PetriNetUnfolderBase]: For 37406/37406 co-relation queries the response was YES. [2024-06-03 22:19:24,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4507 conditions, 749 events. 422/749 cut-off events. For 37406/37406 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3344 event pairs, 49 based on Foata normal form. 2/749 useless extension candidates. Maximal degree in co-relation 4424. Up to 671 conditions per place. [2024-06-03 22:19:24,197 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 156 selfloop transitions, 13 changer transitions 0/171 dead transitions. [2024-06-03 22:19:24,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 171 transitions, 1859 flow [2024-06-03 22:19:24,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:19:24,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:19:24,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2024-06-03 22:19:24,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31875 [2024-06-03 22:19:24,207 INFO L175 Difference]: Start difference. First operand has 176 places, 150 transitions, 1467 flow. Second operand 10 states and 102 transitions. [2024-06-03 22:19:24,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 171 transitions, 1859 flow [2024-06-03 22:19:24,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 171 transitions, 1774 flow, removed 9 selfloop flow, removed 10 redundant places. [2024-06-03 22:19:24,276 INFO L231 Difference]: Finished difference. Result has 176 places, 151 transitions, 1422 flow [2024-06-03 22:19:24,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1382, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1422, PETRI_PLACES=176, PETRI_TRANSITIONS=151} [2024-06-03 22:19:24,277 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 145 predicate places. [2024-06-03 22:19:24,277 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 151 transitions, 1422 flow [2024-06-03 22:19:24,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:24,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:24,277 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:24,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-03 22:19:24,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:19:24,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:24,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1310729562, now seen corresponding path program 1 times [2024-06-03 22:19:24,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:24,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614662124] [2024-06-03 22:19:24,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:24,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:29,035 INFO 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:29,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:29,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614662124] [2024-06-03 22:19:29,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614662124] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:29,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:29,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:19:29,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290161077] [2024-06-03 22:19:29,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:29,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:19:29,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:29,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:19:29,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:19:29,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:19:29,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 151 transitions, 1422 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:29,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:29,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:19:29,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:29,456 INFO L124 PetriNetUnfolderBase]: 419/744 cut-off events. [2024-06-03 22:19:29,456 INFO L125 PetriNetUnfolderBase]: For 35290/35290 co-relation queries the response was YES. [2024-06-03 22:19:29,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4391 conditions, 744 events. 419/744 cut-off events. For 35290/35290 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3316 event pairs, 60 based on Foata normal form. 1/743 useless extension candidates. Maximal degree in co-relation 4307. Up to 666 conditions per place. [2024-06-03 22:19:29,462 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 144 selfloop transitions, 25 changer transitions 0/171 dead transitions. [2024-06-03 22:19:29,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 171 transitions, 1814 flow [2024-06-03 22:19:29,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:19:29,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:19:29,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-03 22:19:29,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.334375 [2024-06-03 22:19:29,463 INFO L175 Difference]: Start difference. First operand has 176 places, 151 transitions, 1422 flow. Second operand 10 states and 107 transitions. [2024-06-03 22:19:29,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 171 transitions, 1814 flow [2024-06-03 22:19:29,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 171 transitions, 1780 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-03 22:19:29,535 INFO L231 Difference]: Finished difference. Result has 178 places, 151 transitions, 1446 flow [2024-06-03 22:19:29,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1446, PETRI_PLACES=178, PETRI_TRANSITIONS=151} [2024-06-03 22:19:29,535 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 147 predicate places. [2024-06-03 22:19:29,536 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 151 transitions, 1446 flow [2024-06-03 22:19:29,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:29,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:29,536 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:29,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-03 22:19:29,536 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:19:29,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:29,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1265894214, now seen corresponding path program 2 times [2024-06-03 22:19:29,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:29,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340008862] [2024-06-03 22:19:29,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:29,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:33,991 INFO 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:33,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:33,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340008862] [2024-06-03 22:19:33,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340008862] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:33,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:33,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:19:33,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943724197] [2024-06-03 22:19:33,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:33,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:19:33,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:33,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:19:33,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:19:34,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:19:34,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 151 transitions, 1446 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:34,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:34,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:19:34,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:34,469 INFO L124 PetriNetUnfolderBase]: 423/752 cut-off events. [2024-06-03 22:19:34,469 INFO L125 PetriNetUnfolderBase]: For 38156/38156 co-relation queries the response was YES. [2024-06-03 22:19:34,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4466 conditions, 752 events. 423/752 cut-off events. For 38156/38156 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3374 event pairs, 62 based on Foata normal form. 2/752 useless extension candidates. Maximal degree in co-relation 4381. Up to 677 conditions per place. [2024-06-03 22:19:34,475 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 148 selfloop transitions, 22 changer transitions 0/172 dead transitions. [2024-06-03 22:19:34,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 172 transitions, 1848 flow [2024-06-03 22:19:34,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:19:34,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:19:34,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-03 22:19:34,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33125 [2024-06-03 22:19:34,476 INFO L175 Difference]: Start difference. First operand has 178 places, 151 transitions, 1446 flow. Second operand 10 states and 106 transitions. [2024-06-03 22:19:34,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 172 transitions, 1848 flow [2024-06-03 22:19:34,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 172 transitions, 1670 flow, removed 6 selfloop flow, removed 12 redundant places. [2024-06-03 22:19:34,544 INFO L231 Difference]: Finished difference. Result has 176 places, 152 transitions, 1329 flow [2024-06-03 22:19:34,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1268, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1329, PETRI_PLACES=176, PETRI_TRANSITIONS=152} [2024-06-03 22:19:34,545 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 145 predicate places. [2024-06-03 22:19:34,545 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 152 transitions, 1329 flow [2024-06-03 22:19:34,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:34,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:34,545 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:34,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-03 22:19:34,546 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:19:34,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:34,546 INFO L85 PathProgramCache]: Analyzing trace with hash 44462096, now seen corresponding path program 3 times [2024-06-03 22:19:34,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:34,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701908922] [2024-06-03 22:19:34,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:34,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:39,448 INFO 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:39,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:39,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701908922] [2024-06-03 22:19:39,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701908922] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:39,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:39,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:19:39,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321646198] [2024-06-03 22:19:39,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:39,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:19:39,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:39,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:19:39,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:19:39,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:19:39,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 152 transitions, 1329 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:39,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:39,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:19:39,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:39,980 INFO L124 PetriNetUnfolderBase]: 427/760 cut-off events. [2024-06-03 22:19:39,980 INFO L125 PetriNetUnfolderBase]: For 37784/37784 co-relation queries the response was YES. [2024-06-03 22:19:39,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4371 conditions, 760 events. 427/760 cut-off events. For 37784/37784 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3429 event pairs, 62 based on Foata normal form. 2/760 useless extension candidates. Maximal degree in co-relation 4285. Up to 669 conditions per place. [2024-06-03 22:19:39,987 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 149 selfloop transitions, 22 changer transitions 0/173 dead transitions. [2024-06-03 22:19:39,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 173 transitions, 1733 flow [2024-06-03 22:19:39,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:19:39,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:19:39,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-03 22:19:39,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.334375 [2024-06-03 22:19:39,988 INFO L175 Difference]: Start difference. First operand has 176 places, 152 transitions, 1329 flow. Second operand 10 states and 107 transitions. [2024-06-03 22:19:39,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 173 transitions, 1733 flow [2024-06-03 22:19:40,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 173 transitions, 1684 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-03 22:19:40,064 INFO L231 Difference]: Finished difference. Result has 178 places, 153 transitions, 1342 flow [2024-06-03 22:19:40,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1280, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1342, PETRI_PLACES=178, PETRI_TRANSITIONS=153} [2024-06-03 22:19:40,064 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 147 predicate places. [2024-06-03 22:19:40,064 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 153 transitions, 1342 flow [2024-06-03 22:19:40,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:40,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:40,065 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:40,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-03 22:19:40,065 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:19:40,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:40,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1266014184, now seen corresponding path program 4 times [2024-06-03 22:19:40,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:40,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979096961] [2024-06-03 22:19:40,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:40,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:44,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:19:44,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:44,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979096961] [2024-06-03 22:19:44,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979096961] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:44,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:44,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:19:44,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165669159] [2024-06-03 22:19:44,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:44,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:19:44,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:44,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:19:44,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:19:44,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:19:44,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 153 transitions, 1342 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:44,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:44,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:19:44,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:45,095 INFO L124 PetriNetUnfolderBase]: 431/768 cut-off events. [2024-06-03 22:19:45,096 INFO L125 PetriNetUnfolderBase]: For 39250/39250 co-relation queries the response was YES. [2024-06-03 22:19:45,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4432 conditions, 768 events. 431/768 cut-off events. For 39250/39250 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3491 event pairs, 64 based on Foata normal form. 2/768 useless extension candidates. Maximal degree in co-relation 4345. Up to 653 conditions per place. [2024-06-03 22:19:45,102 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 150 selfloop transitions, 22 changer transitions 0/174 dead transitions. [2024-06-03 22:19:45,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 174 transitions, 1748 flow [2024-06-03 22:19:45,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:19:45,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:19:45,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-03 22:19:45,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3375 [2024-06-03 22:19:45,109 INFO L175 Difference]: Start difference. First operand has 178 places, 153 transitions, 1342 flow. Second operand 10 states and 108 transitions. [2024-06-03 22:19:45,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 174 transitions, 1748 flow [2024-06-03 22:19:45,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 174 transitions, 1696 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-03 22:19:45,176 INFO L231 Difference]: Finished difference. Result has 180 places, 154 transitions, 1354 flow [2024-06-03 22:19:45,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1290, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1354, PETRI_PLACES=180, PETRI_TRANSITIONS=154} [2024-06-03 22:19:45,177 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 149 predicate places. [2024-06-03 22:19:45,177 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 154 transitions, 1354 flow [2024-06-03 22:19:45,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:45,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:45,177 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,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-03 22:19:45,178 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:19:45,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:45,178 INFO L85 PathProgramCache]: Analyzing trace with hash 724348090, now seen corresponding path program 5 times [2024-06-03 22:19:45,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:45,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385880346] [2024-06-03 22:19:45,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:45,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:49,787 INFO 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:49,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:49,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385880346] [2024-06-03 22:19:49,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385880346] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:49,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:49,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:19:49,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472407263] [2024-06-03 22:19:49,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:49,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:19:49,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:49,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:19:49,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:19:49,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:19:49,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 154 transitions, 1354 flow. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:49,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:49,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:19:49,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:50,167 INFO L124 PetriNetUnfolderBase]: 435/776 cut-off events. [2024-06-03 22:19:50,167 INFO L125 PetriNetUnfolderBase]: For 40656/40656 co-relation queries the response was YES. [2024-06-03 22:19:50,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4493 conditions, 776 events. 435/776 cut-off events. For 40656/40656 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3548 event pairs, 41 based on Foata normal form. 2/776 useless extension candidates. Maximal degree in co-relation 4405. Up to 593 conditions per place. [2024-06-03 22:19:50,173 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 120 selfloop transitions, 51 changer transitions 0/173 dead transitions. [2024-06-03 22:19:50,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 173 transitions, 1760 flow [2024-06-03 22:19:50,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:19:50,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:19:50,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-03 22:19:50,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353125 [2024-06-03 22:19:50,175 INFO L175 Difference]: Start difference. First operand has 180 places, 154 transitions, 1354 flow. Second operand 10 states and 113 transitions. [2024-06-03 22:19:50,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 173 transitions, 1760 flow [2024-06-03 22:19:50,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 173 transitions, 1706 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-03 22:19:50,255 INFO L231 Difference]: Finished difference. Result has 182 places, 155 transitions, 1424 flow [2024-06-03 22:19:50,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1424, PETRI_PLACES=182, PETRI_TRANSITIONS=155} [2024-06-03 22:19:50,256 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 151 predicate places. [2024-06-03 22:19:50,256 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 155 transitions, 1424 flow [2024-06-03 22:19:50,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:50,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:50,256 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:50,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-03 22:19:50,256 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:19:50,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:50,257 INFO L85 PathProgramCache]: Analyzing trace with hash 547216570, now seen corresponding path program 6 times [2024-06-03 22:19:50,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:50,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522176438] [2024-06-03 22:19:50,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:50,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:54,856 INFO 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:54,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:54,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522176438] [2024-06-03 22:19:54,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522176438] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:54,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:54,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:19:54,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119185001] [2024-06-03 22:19:54,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:54,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:19:54,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:54,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:19:54,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:19:54,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:19:54,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 155 transitions, 1424 flow. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:54,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:54,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:19:54,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:55,233 INFO L124 PetriNetUnfolderBase]: 439/784 cut-off events. [2024-06-03 22:19:55,233 INFO L125 PetriNetUnfolderBase]: For 42179/42179 co-relation queries the response was YES. [2024-06-03 22:19:55,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4629 conditions, 784 events. 439/784 cut-off events. For 42179/42179 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3607 event pairs, 47 based on Foata normal form. 2/784 useless extension candidates. Maximal degree in co-relation 4540. Up to 601 conditions per place. [2024-06-03 22:19:55,239 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 127 selfloop transitions, 45 changer transitions 0/174 dead transitions. [2024-06-03 22:19:55,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 174 transitions, 1834 flow [2024-06-03 22:19:55,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:19:55,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:19:55,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-03 22:19:55,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.346875 [2024-06-03 22:19:55,244 INFO L175 Difference]: Start difference. First operand has 182 places, 155 transitions, 1424 flow. Second operand 10 states and 111 transitions. [2024-06-03 22:19:55,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 174 transitions, 1834 flow [2024-06-03 22:19:55,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 174 transitions, 1720 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-03 22:19:55,324 INFO L231 Difference]: Finished difference. Result has 184 places, 156 transitions, 1424 flow [2024-06-03 22:19:55,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1424, PETRI_PLACES=184, PETRI_TRANSITIONS=156} [2024-06-03 22:19:55,324 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 153 predicate places. [2024-06-03 22:19:55,324 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 156 transitions, 1424 flow [2024-06-03 22:19:55,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:55,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:55,325 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:55,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-03 22:19:55,325 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:19:55,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:55,325 INFO L85 PathProgramCache]: Analyzing trace with hash 717919000, now seen corresponding path program 7 times [2024-06-03 22:19:55,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:55,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912045668] [2024-06-03 22:19:55,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:55,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:00,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:00,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:00,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912045668] [2024-06-03 22:20:00,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912045668] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:00,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:00,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:20:00,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35883392] [2024-06-03 22:20:00,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:00,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:20:00,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:00,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:20:00,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:20:00,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:20:00,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 156 transitions, 1424 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:00,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:00,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:20:00,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:00,756 INFO L124 PetriNetUnfolderBase]: 443/792 cut-off events. [2024-06-03 22:20:00,756 INFO L125 PetriNetUnfolderBase]: For 43572/43572 co-relation queries the response was YES. [2024-06-03 22:20:00,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4668 conditions, 792 events. 443/792 cut-off events. For 43572/43572 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3646 event pairs, 43 based on Foata normal form. 2/792 useless extension candidates. Maximal degree in co-relation 4578. Up to 609 conditions per place. [2024-06-03 22:20:00,762 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 125 selfloop transitions, 48 changer transitions 0/175 dead transitions. [2024-06-03 22:20:00,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 175 transitions, 1838 flow [2024-06-03 22:20:00,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:20:00,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:20:00,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-03 22:20:00,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353125 [2024-06-03 22:20:00,764 INFO L175 Difference]: Start difference. First operand has 184 places, 156 transitions, 1424 flow. Second operand 10 states and 113 transitions. [2024-06-03 22:20:00,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 175 transitions, 1838 flow [2024-06-03 22:20:00,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 175 transitions, 1734 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-03 22:20:00,848 INFO L231 Difference]: Finished difference. Result has 186 places, 157 transitions, 1442 flow [2024-06-03 22:20:00,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1320, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1442, PETRI_PLACES=186, PETRI_TRANSITIONS=157} [2024-06-03 22:20:00,848 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 155 predicate places. [2024-06-03 22:20:00,848 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 157 transitions, 1442 flow [2024-06-03 22:20:00,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:00,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:00,849 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:00,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-03 22:20:00,849 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:20:00,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:00,849 INFO L85 PathProgramCache]: Analyzing trace with hash 547211920, now seen corresponding path program 8 times [2024-06-03 22:20:00,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:00,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910032860] [2024-06-03 22:20:00,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:00,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:05,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:05,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:05,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910032860] [2024-06-03 22:20:05,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910032860] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:05,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:05,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:20:05,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530460867] [2024-06-03 22:20:05,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:05,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:20:05,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:05,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:20:05,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:20:05,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:20:05,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 157 transitions, 1442 flow. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:05,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:05,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:20:05,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:05,826 INFO L124 PetriNetUnfolderBase]: 447/800 cut-off events. [2024-06-03 22:20:05,830 INFO L125 PetriNetUnfolderBase]: For 45001/45001 co-relation queries the response was YES. [2024-06-03 22:20:05,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4731 conditions, 800 events. 447/800 cut-off events. For 45001/45001 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3714 event pairs, 49 based on Foata normal form. 2/800 useless extension candidates. Maximal degree in co-relation 4640. Up to 603 conditions per place. [2024-06-03 22:20:05,837 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 128 selfloop transitions, 46 changer transitions 0/176 dead transitions. [2024-06-03 22:20:05,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 176 transitions, 1858 flow [2024-06-03 22:20:05,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:20:05,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:20:05,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-03 22:20:05,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-03 22:20:05,838 INFO L175 Difference]: Start difference. First operand has 186 places, 157 transitions, 1442 flow. Second operand 10 states and 112 transitions. [2024-06-03 22:20:05,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 176 transitions, 1858 flow [2024-06-03 22:20:05,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 176 transitions, 1746 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-03 22:20:05,918 INFO L231 Difference]: Finished difference. Result has 188 places, 158 transitions, 1450 flow [2024-06-03 22:20:05,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1330, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1450, PETRI_PLACES=188, PETRI_TRANSITIONS=158} [2024-06-03 22:20:05,918 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 157 predicate places. [2024-06-03 22:20:05,918 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 158 transitions, 1450 flow [2024-06-03 22:20:05,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:05,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:05,919 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:05,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-03 22:20:05,919 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:20:05,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:05,919 INFO L85 PathProgramCache]: Analyzing trace with hash 547096600, now seen corresponding path program 9 times [2024-06-03 22:20:05,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:05,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912277720] [2024-06-03 22:20:05,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:05,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:10,859 INFO 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:10,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:10,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912277720] [2024-06-03 22:20:10,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912277720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:10,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:10,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:20:10,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548803518] [2024-06-03 22:20:10,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:10,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:20:10,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:10,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:20:10,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:20:11,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:20:11,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 158 transitions, 1450 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:11,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:11,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:20:11,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:11,321 INFO L124 PetriNetUnfolderBase]: 451/808 cut-off events. [2024-06-03 22:20:11,322 INFO L125 PetriNetUnfolderBase]: For 46474/46474 co-relation queries the response was YES. [2024-06-03 22:20:11,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4786 conditions, 808 events. 451/808 cut-off events. For 46474/46474 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3761 event pairs, 53 based on Foata normal form. 2/808 useless extension candidates. Maximal degree in co-relation 4694. Up to 534 conditions per place. [2024-06-03 22:20:11,328 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 126 selfloop transitions, 50 changer transitions 0/178 dead transitions. [2024-06-03 22:20:11,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 178 transitions, 2000 flow [2024-06-03 22:20:11,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:20:11,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:20:11,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-03 22:20:11,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-03 22:20:11,329 INFO L175 Difference]: Start difference. First operand has 188 places, 158 transitions, 1450 flow. Second operand 10 states and 112 transitions. [2024-06-03 22:20:11,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 178 transitions, 2000 flow [2024-06-03 22:20:11,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 178 transitions, 1890 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-03 22:20:11,422 INFO L231 Difference]: Finished difference. Result has 190 places, 159 transitions, 1468 flow [2024-06-03 22:20:11,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1468, PETRI_PLACES=190, PETRI_TRANSITIONS=159} [2024-06-03 22:20:11,422 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 159 predicate places. [2024-06-03 22:20:11,423 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 159 transitions, 1468 flow [2024-06-03 22:20:11,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:11,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:11,423 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:11,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-03 22:20:11,423 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:20:11,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:11,424 INFO L85 PathProgramCache]: Analyzing trace with hash 717914350, now seen corresponding path program 10 times [2024-06-03 22:20:11,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:11,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698332467] [2024-06-03 22:20:11,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:11,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:16,042 INFO 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:16,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:16,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698332467] [2024-06-03 22:20:16,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698332467] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:16,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:16,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:20:16,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511262142] [2024-06-03 22:20:16,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:16,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:20:16,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:16,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:20:16,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:20:16,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:20:16,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 159 transitions, 1468 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:16,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:16,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:20:16,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:16,556 INFO L124 PetriNetUnfolderBase]: 455/816 cut-off events. [2024-06-03 22:20:16,556 INFO L125 PetriNetUnfolderBase]: For 48106/48106 co-relation queries the response was YES. [2024-06-03 22:20:16,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4857 conditions, 816 events. 455/816 cut-off events. For 48106/48106 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3823 event pairs, 47 based on Foata normal form. 2/816 useless extension candidates. Maximal degree in co-relation 4764. Up to 613 conditions per place. [2024-06-03 22:20:16,561 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 126 selfloop transitions, 50 changer transitions 0/178 dead transitions. [2024-06-03 22:20:16,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 178 transitions, 1892 flow [2024-06-03 22:20:16,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:20:16,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:20:16,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-03 22:20:16,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353125 [2024-06-03 22:20:16,562 INFO L175 Difference]: Start difference. First operand has 190 places, 159 transitions, 1468 flow. Second operand 10 states and 113 transitions. [2024-06-03 22:20:16,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 178 transitions, 1892 flow [2024-06-03 22:20:16,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 178 transitions, 1734 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-06-03 22:20:16,658 INFO L231 Difference]: Finished difference. Result has 191 places, 160 transitions, 1442 flow [2024-06-03 22:20:16,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1442, PETRI_PLACES=191, PETRI_TRANSITIONS=160} [2024-06-03 22:20:16,659 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 160 predicate places. [2024-06-03 22:20:16,659 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 160 transitions, 1442 flow [2024-06-03 22:20:16,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:16,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:16,659 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:16,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-03 22:20:16,659 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:20:16,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:16,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1684820302, now seen corresponding path program 1 times [2024-06-03 22:20:16,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:16,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121745339] [2024-06-03 22:20:16,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:16,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:21,689 INFO 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:21,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:21,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121745339] [2024-06-03 22:20:21,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121745339] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:21,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:21,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:20:21,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185780257] [2024-06-03 22:20:21,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:21,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:20:21,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:21,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:20:21,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:20:21,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:20:21,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 160 transitions, 1442 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:21,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:21,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:20:21,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:22,249 INFO L124 PetriNetUnfolderBase]: 459/824 cut-off events. [2024-06-03 22:20:22,249 INFO L125 PetriNetUnfolderBase]: For 49122/49122 co-relation queries the response was YES. [2024-06-03 22:20:22,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4780 conditions, 824 events. 459/824 cut-off events. For 49122/49122 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3865 event pairs, 52 based on Foata normal form. 2/824 useless extension candidates. Maximal degree in co-relation 4688. Up to 494 conditions per place. [2024-06-03 22:20:22,256 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 98 selfloop transitions, 85 changer transitions 0/185 dead transitions. [2024-06-03 22:20:22,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 185 transitions, 2018 flow [2024-06-03 22:20:22,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-03 22:20:22,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-03 22:20:22,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 146 transitions. [2024-06-03 22:20:22,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35096153846153844 [2024-06-03 22:20:22,257 INFO L175 Difference]: Start difference. First operand has 191 places, 160 transitions, 1442 flow. Second operand 13 states and 146 transitions. [2024-06-03 22:20:22,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 185 transitions, 2018 flow [2024-06-03 22:20:22,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 185 transitions, 1889 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-03 22:20:22,356 INFO L231 Difference]: Finished difference. Result has 195 places, 161 transitions, 1503 flow [2024-06-03 22:20:22,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1503, PETRI_PLACES=195, PETRI_TRANSITIONS=161} [2024-06-03 22:20:22,356 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 164 predicate places. [2024-06-03 22:20:22,357 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 161 transitions, 1503 flow [2024-06-03 22:20:22,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:22,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:22,357 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,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-03 22:20:22,357 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:20:22,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:22,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1348300724, now seen corresponding path program 11 times [2024-06-03 22:20:22,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:22,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112932196] [2024-06-03 22:20:22,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:22,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:27,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:27,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:27,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112932196] [2024-06-03 22:20:27,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112932196] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:27,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:27,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:20:27,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130009586] [2024-06-03 22:20:27,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:27,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:20:27,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:27,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:20:27,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:20:27,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:20:27,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 161 transitions, 1503 flow. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:27,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:27,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:20:27,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:27,453 INFO L124 PetriNetUnfolderBase]: 463/832 cut-off events. [2024-06-03 22:20:27,454 INFO L125 PetriNetUnfolderBase]: For 50720/50720 co-relation queries the response was YES. [2024-06-03 22:20:27,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4896 conditions, 832 events. 463/832 cut-off events. For 50720/50720 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3920 event pairs, 57 based on Foata normal form. 2/832 useless extension candidates. Maximal degree in co-relation 4804. Up to 622 conditions per place. [2024-06-03 22:20:27,460 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 131 selfloop transitions, 47 changer transitions 0/180 dead transitions. [2024-06-03 22:20:27,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 180 transitions, 2058 flow [2024-06-03 22:20:27,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:20:27,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:20:27,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-03 22:20:27,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35625 [2024-06-03 22:20:27,478 INFO L175 Difference]: Start difference. First operand has 195 places, 161 transitions, 1503 flow. Second operand 10 states and 114 transitions. [2024-06-03 22:20:27,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 180 transitions, 2058 flow [2024-06-03 22:20:27,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 180 transitions, 1934 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-03 22:20:27,576 INFO L231 Difference]: Finished difference. Result has 197 places, 162 transitions, 1498 flow [2024-06-03 22:20:27,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1379, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1498, PETRI_PLACES=197, PETRI_TRANSITIONS=162} [2024-06-03 22:20:27,578 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 166 predicate places. [2024-06-03 22:20:27,578 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 162 transitions, 1498 flow [2024-06-03 22:20:27,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:27,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:27,579 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:27,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-03 22:20:27,579 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:20:27,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:27,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1980285766, now seen corresponding path program 12 times [2024-06-03 22:20:27,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:27,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280022571] [2024-06-03 22:20:27,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:27,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:32,637 INFO 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:32,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:32,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280022571] [2024-06-03 22:20:32,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280022571] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:32,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:32,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:20:32,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607791555] [2024-06-03 22:20:32,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:32,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:20:32,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:32,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:20:32,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:20:32,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:20:32,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 162 transitions, 1498 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:32,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:32,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:20:32,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:33,124 INFO L124 PetriNetUnfolderBase]: 467/840 cut-off events. [2024-06-03 22:20:33,124 INFO L125 PetriNetUnfolderBase]: For 52550/52550 co-relation queries the response was YES. [2024-06-03 22:20:33,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4900 conditions, 840 events. 467/840 cut-off events. For 52550/52550 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3997 event pairs, 49 based on Foata normal form. 2/840 useless extension candidates. Maximal degree in co-relation 4807. Up to 657 conditions per place. [2024-06-03 22:20:33,130 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 129 selfloop transitions, 51 changer transitions 0/182 dead transitions. [2024-06-03 22:20:33,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 182 transitions, 1931 flow [2024-06-03 22:20:33,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:20:33,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:20:33,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-03 22:20:33,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-03 22:20:33,132 INFO L175 Difference]: Start difference. First operand has 197 places, 162 transitions, 1498 flow. Second operand 11 states and 121 transitions. [2024-06-03 22:20:33,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 182 transitions, 1931 flow [2024-06-03 22:20:33,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 182 transitions, 1807 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-03 22:20:33,235 INFO L231 Difference]: Finished difference. Result has 200 places, 163 transitions, 1505 flow [2024-06-03 22:20:33,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1376, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1505, PETRI_PLACES=200, PETRI_TRANSITIONS=163} [2024-06-03 22:20:33,235 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 169 predicate places. [2024-06-03 22:20:33,236 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 163 transitions, 1505 flow [2024-06-03 22:20:33,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:33,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:33,236 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:33,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-03 22:20:33,236 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:20:33,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:33,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1980278822, now seen corresponding path program 1 times [2024-06-03 22:20:33,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:33,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920190001] [2024-06-03 22:20:33,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:33,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:37,885 INFO 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:37,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:37,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920190001] [2024-06-03 22:20:37,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920190001] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:37,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:37,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:20:37,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009204187] [2024-06-03 22:20:37,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:37,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:20:37,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:37,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:20:37,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:20:38,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:20:38,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 163 transitions, 1505 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:38,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:38,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:20:38,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:38,440 INFO L124 PetriNetUnfolderBase]: 463/834 cut-off events. [2024-06-03 22:20:38,440 INFO L125 PetriNetUnfolderBase]: For 48966/48966 co-relation queries the response was YES. [2024-06-03 22:20:38,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4727 conditions, 834 events. 463/834 cut-off events. For 48966/48966 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3952 event pairs, 54 based on Foata normal form. 2/834 useless extension candidates. Maximal degree in co-relation 4633. Up to 544 conditions per place. [2024-06-03 22:20:38,447 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 108 selfloop transitions, 73 changer transitions 0/183 dead transitions. [2024-06-03 22:20:38,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 183 transitions, 1923 flow [2024-06-03 22:20:38,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:20:38,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:20:38,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-03 22:20:38,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3664772727272727 [2024-06-03 22:20:38,448 INFO L175 Difference]: Start difference. First operand has 200 places, 163 transitions, 1505 flow. Second operand 11 states and 129 transitions. [2024-06-03 22:20:38,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 183 transitions, 1923 flow [2024-06-03 22:20:38,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 183 transitions, 1797 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-03 22:20:38,541 INFO L231 Difference]: Finished difference. Result has 202 places, 163 transitions, 1534 flow [2024-06-03 22:20:38,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1379, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1534, PETRI_PLACES=202, PETRI_TRANSITIONS=163} [2024-06-03 22:20:38,542 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 171 predicate places. [2024-06-03 22:20:38,542 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 163 transitions, 1534 flow [2024-06-03 22:20:38,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:38,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:38,542 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:38,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-03 22:20:38,543 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:20:38,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:38,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1684464112, now seen corresponding path program 2 times [2024-06-03 22:20:38,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:38,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419580226] [2024-06-03 22:20:38,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:38,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:43,747 INFO 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:43,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:43,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419580226] [2024-06-03 22:20:43,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419580226] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:43,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:43,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:20:43,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174778016] [2024-06-03 22:20:43,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:43,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:20:43,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:43,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:20:43,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:20:43,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:20:43,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 163 transitions, 1534 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:43,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:43,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:20:43,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:44,382 INFO L124 PetriNetUnfolderBase]: 503/914 cut-off events. [2024-06-03 22:20:44,382 INFO L125 PetriNetUnfolderBase]: For 79778/79778 co-relation queries the response was YES. [2024-06-03 22:20:44,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5866 conditions, 914 events. 503/914 cut-off events. For 79778/79778 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4433 event pairs, 66 based on Foata normal form. 2/914 useless extension candidates. Maximal degree in co-relation 5771. Up to 481 conditions per place. [2024-06-03 22:20:44,390 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 105 selfloop transitions, 88 changer transitions 0/195 dead transitions. [2024-06-03 22:20:44,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 195 transitions, 2318 flow [2024-06-03 22:20:44,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-03 22:20:44,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-03 22:20:44,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 151 transitions. [2024-06-03 22:20:44,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3629807692307692 [2024-06-03 22:20:44,391 INFO L175 Difference]: Start difference. First operand has 202 places, 163 transitions, 1534 flow. Second operand 13 states and 151 transitions. [2024-06-03 22:20:44,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 195 transitions, 2318 flow [2024-06-03 22:20:44,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 195 transitions, 2106 flow, removed 1 selfloop flow, removed 12 redundant places. [2024-06-03 22:20:44,526 INFO L231 Difference]: Finished difference. Result has 203 places, 165 transitions, 1532 flow [2024-06-03 22:20:44,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1322, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1532, PETRI_PLACES=203, PETRI_TRANSITIONS=165} [2024-06-03 22:20:44,526 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 172 predicate places. [2024-06-03 22:20:44,527 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 165 transitions, 1532 flow [2024-06-03 22:20:44,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:44,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:44,527 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:44,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-03 22:20:44,527 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:20:44,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:44,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1980039502, now seen corresponding path program 3 times [2024-06-03 22:20:44,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:44,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585151972] [2024-06-03 22:20:44,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:44,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:49,362 INFO 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:49,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:49,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585151972] [2024-06-03 22:20:49,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585151972] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:49,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:49,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:20:49,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695796653] [2024-06-03 22:20:49,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:49,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:20:49,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:49,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:20:49,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:20:49,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:20:49,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 165 transitions, 1532 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:49,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:49,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:20:49,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:49,957 INFO L124 PetriNetUnfolderBase]: 523/958 cut-off events. [2024-06-03 22:20:49,957 INFO L125 PetriNetUnfolderBase]: For 106887/106887 co-relation queries the response was YES. [2024-06-03 22:20:49,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6074 conditions, 958 events. 523/958 cut-off events. For 106887/106887 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4740 event pairs, 78 based on Foata normal form. 12/968 useless extension candidates. Maximal degree in co-relation 5978. Up to 620 conditions per place. [2024-06-03 22:20:49,965 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 111 selfloop transitions, 70 changer transitions 9/192 dead transitions. [2024-06-03 22:20:49,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 192 transitions, 2010 flow [2024-06-03 22:20:49,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:20:49,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:20:49,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-03 22:20:49,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-03 22:20:49,966 INFO L175 Difference]: Start difference. First operand has 203 places, 165 transitions, 1532 flow. Second operand 12 states and 141 transitions. [2024-06-03 22:20:49,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 192 transitions, 2010 flow [2024-06-03 22:20:50,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 192 transitions, 1875 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-03 22:20:50,113 INFO L231 Difference]: Finished difference. Result has 206 places, 162 transitions, 1525 flow [2024-06-03 22:20:50,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1525, PETRI_PLACES=206, PETRI_TRANSITIONS=162} [2024-06-03 22:20:50,113 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 175 predicate places. [2024-06-03 22:20:50,113 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 162 transitions, 1525 flow [2024-06-03 22:20:50,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:50,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:50,114 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:50,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-03 22:20:50,114 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:20:50,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:50,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1694939632, now seen corresponding path program 4 times [2024-06-03 22:20:50,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:50,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674654863] [2024-06-03 22:20:50,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:50,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:55,169 INFO 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:55,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:55,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674654863] [2024-06-03 22:20:55,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674654863] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:55,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:55,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:20:55,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100409016] [2024-06-03 22:20:55,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:55,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:20:55,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:55,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:20:55,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:20:55,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:20:55,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 162 transitions, 1525 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:55,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:55,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:20:55,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:55,706 INFO L124 PetriNetUnfolderBase]: 502/929 cut-off events. [2024-06-03 22:20:55,706 INFO L125 PetriNetUnfolderBase]: For 104343/104343 co-relation queries the response was YES. [2024-06-03 22:20:55,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5718 conditions, 929 events. 502/929 cut-off events. For 104343/104343 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4610 event pairs, 77 based on Foata normal form. 14/941 useless extension candidates. Maximal degree in co-relation 5620. Up to 595 conditions per place. [2024-06-03 22:20:55,714 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 105 selfloop transitions, 73 changer transitions 8/188 dead transitions. [2024-06-03 22:20:55,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 188 transitions, 1979 flow [2024-06-03 22:20:55,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:20:55,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:20:55,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-03 22:20:55,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-03 22:20:55,715 INFO L175 Difference]: Start difference. First operand has 206 places, 162 transitions, 1525 flow. Second operand 12 states and 141 transitions. [2024-06-03 22:20:55,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 188 transitions, 1979 flow [2024-06-03 22:20:55,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 188 transitions, 1809 flow, removed 13 selfloop flow, removed 12 redundant places. [2024-06-03 22:20:55,875 INFO L231 Difference]: Finished difference. Result has 207 places, 159 transitions, 1483 flow [2024-06-03 22:20:55,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1483, PETRI_PLACES=207, PETRI_TRANSITIONS=159} [2024-06-03 22:20:55,876 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 176 predicate places. [2024-06-03 22:20:55,876 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 159 transitions, 1483 flow [2024-06-03 22:20:55,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:55,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:55,876 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:55,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-03 22:20:55,876 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:20:55,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:55,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1348296074, now seen corresponding path program 13 times [2024-06-03 22:20:55,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:55,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739464579] [2024-06-03 22:20:55,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:55,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:00,411 INFO 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:00,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:00,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739464579] [2024-06-03 22:21:00,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739464579] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:00,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:00,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:21:00,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922435733] [2024-06-03 22:21:00,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:00,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:21:00,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:00,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:21:00,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:21:00,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:21:00,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 159 transitions, 1483 flow. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:00,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:00,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:21:00,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:00,773 INFO L124 PetriNetUnfolderBase]: 480/887 cut-off events. [2024-06-03 22:21:00,773 INFO L125 PetriNetUnfolderBase]: For 76002/76002 co-relation queries the response was YES. [2024-06-03 22:21:00,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5603 conditions, 887 events. 480/887 cut-off events. For 76002/76002 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4373 event pairs, 75 based on Foata normal form. 2/887 useless extension candidates. Maximal degree in co-relation 5504. Up to 704 conditions per place. [2024-06-03 22:21:00,781 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 130 selfloop transitions, 45 changer transitions 0/177 dead transitions. [2024-06-03 22:21:00,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 177 transitions, 1900 flow [2024-06-03 22:21:00,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:21:00,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:21:00,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-03 22:21:00,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-03 22:21:00,782 INFO L175 Difference]: Start difference. First operand has 207 places, 159 transitions, 1483 flow. Second operand 10 states and 112 transitions. [2024-06-03 22:21:00,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 177 transitions, 1900 flow [2024-06-03 22:21:00,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 177 transitions, 1712 flow, removed 5 selfloop flow, removed 14 redundant places. [2024-06-03 22:21:00,896 INFO L231 Difference]: Finished difference. Result has 203 places, 160 transitions, 1414 flow [2024-06-03 22:21:00,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1414, PETRI_PLACES=203, PETRI_TRANSITIONS=160} [2024-06-03 22:21:00,897 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 172 predicate places. [2024-06-03 22:21:00,897 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 160 transitions, 1414 flow [2024-06-03 22:21:00,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:00,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:00,897 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:21:00,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-03 22:21:00,897 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:21:00,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:00,898 INFO L85 PathProgramCache]: Analyzing trace with hash -591323550, now seen corresponding path program 14 times [2024-06-03 22:21:00,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:00,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764887793] [2024-06-03 22:21:00,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:00,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:05,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:05,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764887793] [2024-06-03 22:21:05,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764887793] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:05,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:05,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:21:05,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415739464] [2024-06-03 22:21:05,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:05,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:21:05,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:05,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:21:05,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:21:05,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:21:05,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 160 transitions, 1414 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:05,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:05,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:21:05,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:05,925 INFO L124 PetriNetUnfolderBase]: 477/882 cut-off events. [2024-06-03 22:21:05,925 INFO L125 PetriNetUnfolderBase]: For 70597/70597 co-relation queries the response was YES. [2024-06-03 22:21:05,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5295 conditions, 882 events. 477/882 cut-off events. For 70597/70597 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4351 event pairs, 74 based on Foata normal form. 2/882 useless extension candidates. Maximal degree in co-relation 5196. Up to 699 conditions per place. [2024-06-03 22:21:05,932 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 132 selfloop transitions, 44 changer transitions 0/178 dead transitions. [2024-06-03 22:21:05,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 178 transitions, 1814 flow [2024-06-03 22:21:05,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:21:05,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:21:05,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-03 22:21:05,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353125 [2024-06-03 22:21:05,933 INFO L175 Difference]: Start difference. First operand has 203 places, 160 transitions, 1414 flow. Second operand 10 states and 113 transitions. [2024-06-03 22:21:05,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 178 transitions, 1814 flow [2024-06-03 22:21:06,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 178 transitions, 1688 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-03 22:21:06,052 INFO L231 Difference]: Finished difference. Result has 205 places, 160 transitions, 1380 flow [2024-06-03 22:21:06,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1380, PETRI_PLACES=205, PETRI_TRANSITIONS=160} [2024-06-03 22:21:06,052 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 174 predicate places. [2024-06-03 22:21:06,052 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 160 transitions, 1380 flow [2024-06-03 22:21:06,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:06,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:06,053 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:21:06,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-03 22:21:06,053 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:21:06,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:06,053 INFO L85 PathProgramCache]: Analyzing trace with hash -591077286, now seen corresponding path program 5 times [2024-06-03 22:21:06,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:06,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838417738] [2024-06-03 22:21:06,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:06,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:11,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:11,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:11,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838417738] [2024-06-03 22:21:11,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838417738] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:11,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:11,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:21:11,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431199711] [2024-06-03 22:21:11,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:11,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:21:11,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:11,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:21:11,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:21:11,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:21:11,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 160 transitions, 1380 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:11,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:11,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:21:11,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:11,564 INFO L124 PetriNetUnfolderBase]: 474/877 cut-off events. [2024-06-03 22:21:11,564 INFO L125 PetriNetUnfolderBase]: For 66506/66506 co-relation queries the response was YES. [2024-06-03 22:21:11,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5072 conditions, 877 events. 474/877 cut-off events. For 66506/66506 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4335 event pairs, 91 based on Foata normal form. 2/877 useless extension candidates. Maximal degree in co-relation 4972. Up to 803 conditions per place. [2024-06-03 22:21:11,571 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 144 selfloop transitions, 30 changer transitions 0/176 dead transitions. [2024-06-03 22:21:11,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 176 transitions, 1768 flow [2024-06-03 22:21:11,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:21:11,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:21:11,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2024-06-03 22:21:11,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32386363636363635 [2024-06-03 22:21:11,572 INFO L175 Difference]: Start difference. First operand has 205 places, 160 transitions, 1380 flow. Second operand 11 states and 114 transitions. [2024-06-03 22:21:11,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 176 transitions, 1768 flow [2024-06-03 22:21:11,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 176 transitions, 1630 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-03 22:21:11,684 INFO L231 Difference]: Finished difference. Result has 207 places, 161 transitions, 1317 flow [2024-06-03 22:21:11,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1317, PETRI_PLACES=207, PETRI_TRANSITIONS=161} [2024-06-03 22:21:11,684 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 176 predicate places. [2024-06-03 22:21:11,684 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 161 transitions, 1317 flow [2024-06-03 22:21:11,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:11,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:11,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:21:11,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-03 22:21:11,685 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:21:11,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:11,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1902368654, now seen corresponding path program 1 times [2024-06-03 22:21:11,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:11,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481440597] [2024-06-03 22:21:11,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:11,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:16,106 INFO 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,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:16,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481440597] [2024-06-03 22:21:16,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481440597] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:16,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:16,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:21:16,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245113805] [2024-06-03 22:21:16,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:16,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:21:16,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:16,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:21:16,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:21:16,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:21:16,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 161 transitions, 1317 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:16,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:16,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:21:16,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:16,546 INFO L124 PetriNetUnfolderBase]: 478/885 cut-off events. [2024-06-03 22:21:16,546 INFO L125 PetriNetUnfolderBase]: For 68037/68037 co-relation queries the response was YES. [2024-06-03 22:21:16,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5018 conditions, 885 events. 478/885 cut-off events. For 68037/68037 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4393 event pairs, 74 based on Foata normal form. 2/885 useless extension candidates. Maximal degree in co-relation 4916. Up to 799 conditions per place. [2024-06-03 22:21:16,553 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 168 selfloop transitions, 14 changer transitions 0/184 dead transitions. [2024-06-03 22:21:16,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 184 transitions, 1737 flow [2024-06-03 22:21:16,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:21:16,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:21:16,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2024-06-03 22:21:16,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3125 [2024-06-03 22:21:16,554 INFO L175 Difference]: Start difference. First operand has 207 places, 161 transitions, 1317 flow. Second operand 11 states and 110 transitions. [2024-06-03 22:21:16,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 184 transitions, 1737 flow [2024-06-03 22:21:16,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 184 transitions, 1581 flow, removed 8 selfloop flow, removed 10 redundant places. [2024-06-03 22:21:16,679 INFO L231 Difference]: Finished difference. Result has 208 places, 162 transitions, 1201 flow [2024-06-03 22:21:16,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1201, PETRI_PLACES=208, PETRI_TRANSITIONS=162} [2024-06-03 22:21:16,680 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 177 predicate places. [2024-06-03 22:21:16,680 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 162 transitions, 1201 flow [2024-06-03 22:21:16,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:16,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:16,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] [2024-06-03 22:21:16,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-03 22:21:16,681 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:21:16,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:16,681 INFO L85 PathProgramCache]: Analyzing trace with hash -591732692, now seen corresponding path program 2 times [2024-06-03 22:21:16,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:16,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650756225] [2024-06-03 22:21:16,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:16,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:21,511 INFO 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:21,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:21,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650756225] [2024-06-03 22:21:21,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650756225] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:21,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:21,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:21:21,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496837611] [2024-06-03 22:21:21,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:21,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:21:21,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:21,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:21:21,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:21:21,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:21:21,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 162 transitions, 1201 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:21,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:21,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:21:21,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:21,933 INFO L124 PetriNetUnfolderBase]: 460/847 cut-off events. [2024-06-03 22:21:21,933 INFO L125 PetriNetUnfolderBase]: For 46524/46524 co-relation queries the response was YES. [2024-06-03 22:21:21,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4127 conditions, 847 events. 460/847 cut-off events. For 46524/46524 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4211 event pairs, 69 based on Foata normal form. 2/847 useless extension candidates. Maximal degree in co-relation 4026. Up to 694 conditions per place. [2024-06-03 22:21:21,940 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 161 selfloop transitions, 24 changer transitions 0/187 dead transitions. [2024-06-03 22:21:21,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 187 transitions, 1793 flow [2024-06-03 22:21:21,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:21:21,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:21:21,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2024-06-03 22:21:21,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3380681818181818 [2024-06-03 22:21:21,942 INFO L175 Difference]: Start difference. First operand has 208 places, 162 transitions, 1201 flow. Second operand 11 states and 119 transitions. [2024-06-03 22:21:21,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 187 transitions, 1793 flow [2024-06-03 22:21:22,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 187 transitions, 1741 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-03 22:21:22,052 INFO L231 Difference]: Finished difference. Result has 209 places, 164 transitions, 1219 flow [2024-06-03 22:21:22,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1219, PETRI_PLACES=209, PETRI_TRANSITIONS=164} [2024-06-03 22:21:22,052 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 178 predicate places. [2024-06-03 22:21:22,052 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 164 transitions, 1219 flow [2024-06-03 22:21:22,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:22,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:22,053 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:22,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-03 22:21:22,053 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:21:22,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:22,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1977906340, now seen corresponding path program 3 times [2024-06-03 22:21:22,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:22,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843462951] [2024-06-03 22:21:22,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:22,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:26,647 INFO 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:26,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:26,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843462951] [2024-06-03 22:21:26,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843462951] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:26,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:26,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:21:26,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440738994] [2024-06-03 22:21:26,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:26,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:21:26,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:26,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:21:26,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:21:26,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:21:26,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 164 transitions, 1219 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:26,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:26,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:21:26,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:27,124 INFO L124 PetriNetUnfolderBase]: 471/868 cut-off events. [2024-06-03 22:21:27,124 INFO L125 PetriNetUnfolderBase]: For 53734/53734 co-relation queries the response was YES. [2024-06-03 22:21:27,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4344 conditions, 868 events. 471/868 cut-off events. For 53734/53734 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4329 event pairs, 70 based on Foata normal form. 2/868 useless extension candidates. Maximal degree in co-relation 4243. Up to 763 conditions per place. [2024-06-03 22:21:27,131 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 161 selfloop transitions, 26 changer transitions 0/189 dead transitions. [2024-06-03 22:21:27,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 189 transitions, 1821 flow [2024-06-03 22:21:27,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:21:27,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:21:27,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2024-06-03 22:21:27,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33238636363636365 [2024-06-03 22:21:27,132 INFO L175 Difference]: Start difference. First operand has 209 places, 164 transitions, 1219 flow. Second operand 11 states and 117 transitions. [2024-06-03 22:21:27,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 189 transitions, 1821 flow [2024-06-03 22:21:27,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 189 transitions, 1783 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-03 22:21:27,244 INFO L231 Difference]: Finished difference. Result has 213 places, 166 transitions, 1255 flow [2024-06-03 22:21:27,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1185, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1255, PETRI_PLACES=213, PETRI_TRANSITIONS=166} [2024-06-03 22:21:27,245 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 182 predicate places. [2024-06-03 22:21:27,245 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 166 transitions, 1255 flow [2024-06-03 22:21:27,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:27,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:27,245 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:27,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-03 22:21:27,245 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:21:27,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:27,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1977762190, now seen corresponding path program 4 times [2024-06-03 22:21:27,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:27,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837337481] [2024-06-03 22:21:27,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:27,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:31,942 INFO 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:31,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:31,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837337481] [2024-06-03 22:21:31,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837337481] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:31,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:31,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:21:31,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461200] [2024-06-03 22:21:31,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:31,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:21:31,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:31,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:21:31,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:21:32,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:21:32,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 166 transitions, 1255 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:32,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:32,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:21:32,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:32,521 INFO L124 PetriNetUnfolderBase]: 468/863 cut-off events. [2024-06-03 22:21:32,521 INFO L125 PetriNetUnfolderBase]: For 49098/49098 co-relation queries the response was YES. [2024-06-03 22:21:32,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4225 conditions, 863 events. 468/863 cut-off events. For 49098/49098 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4310 event pairs, 67 based on Foata normal form. 2/863 useless extension candidates. Maximal degree in co-relation 4122. Up to 734 conditions per place. [2024-06-03 22:21:32,528 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 161 selfloop transitions, 26 changer transitions 0/189 dead transitions. [2024-06-03 22:21:32,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 189 transitions, 1841 flow [2024-06-03 22:21:32,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:21:32,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:21:32,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-03 22:21:32,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3352272727272727 [2024-06-03 22:21:32,530 INFO L175 Difference]: Start difference. First operand has 213 places, 166 transitions, 1255 flow. Second operand 11 states and 118 transitions. [2024-06-03 22:21:32,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 189 transitions, 1841 flow [2024-06-03 22:21:32,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 189 transitions, 1807 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-03 22:21:32,640 INFO L231 Difference]: Finished difference. Result has 217 places, 166 transitions, 1277 flow [2024-06-03 22:21:32,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1221, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1277, PETRI_PLACES=217, PETRI_TRANSITIONS=166} [2024-06-03 22:21:32,640 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 186 predicate places. [2024-06-03 22:21:32,640 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 166 transitions, 1277 flow [2024-06-03 22:21:32,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:32,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:32,641 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:32,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-03 22:21:32,641 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:21:32,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:32,641 INFO L85 PathProgramCache]: Analyzing trace with hash -588008042, now seen corresponding path program 5 times [2024-06-03 22:21:32,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:32,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669933402] [2024-06-03 22:21:32,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:32,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:37,044 INFO 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,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:37,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669933402] [2024-06-03 22:21:37,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669933402] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:37,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:37,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:21:37,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498392847] [2024-06-03 22:21:37,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:37,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:21:37,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:37,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:21:37,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:21:37,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:21:37,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 166 transitions, 1277 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:37,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:37,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:21:37,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:37,525 INFO L124 PetriNetUnfolderBase]: 465/858 cut-off events. [2024-06-03 22:21:37,525 INFO L125 PetriNetUnfolderBase]: For 44208/44208 co-relation queries the response was YES. [2024-06-03 22:21:37,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4112 conditions, 858 events. 465/858 cut-off events. For 44208/44208 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4276 event pairs, 70 based on Foata normal form. 2/858 useless extension candidates. Maximal degree in co-relation 4007. Up to 772 conditions per place. [2024-06-03 22:21:37,533 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 160 selfloop transitions, 26 changer transitions 0/188 dead transitions. [2024-06-03 22:21:37,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 188 transitions, 1707 flow [2024-06-03 22:21:37,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:21:37,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:21:37,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-03 22:21:37,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32670454545454547 [2024-06-03 22:21:37,535 INFO L175 Difference]: Start difference. First operand has 217 places, 166 transitions, 1277 flow. Second operand 11 states and 115 transitions. [2024-06-03 22:21:37,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 188 transitions, 1707 flow [2024-06-03 22:21:37,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 188 transitions, 1627 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-03 22:21:37,638 INFO L231 Difference]: Finished difference. Result has 217 places, 166 transitions, 1254 flow [2024-06-03 22:21:37,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1197, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1254, PETRI_PLACES=217, PETRI_TRANSITIONS=166} [2024-06-03 22:21:37,638 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 186 predicate places. [2024-06-03 22:21:37,638 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 166 transitions, 1254 flow [2024-06-03 22:21:37,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:37,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:37,639 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,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-03 22:21:37,639 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:21:37,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:37,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1262543020, now seen corresponding path program 1 times [2024-06-03 22:21:37,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:37,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036716200] [2024-06-03 22:21:37,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:37,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:42,566 INFO 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:42,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:42,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036716200] [2024-06-03 22:21:42,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036716200] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:42,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:42,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:21:42,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710358868] [2024-06-03 22:21:42,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:42,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:21:42,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:42,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:21:42,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:21:42,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:21:42,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 166 transitions, 1254 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:42,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:42,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:21:42,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:43,112 INFO L124 PetriNetUnfolderBase]: 481/894 cut-off events. [2024-06-03 22:21:43,112 INFO L125 PetriNetUnfolderBase]: For 70722/70722 co-relation queries the response was YES. [2024-06-03 22:21:43,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4169 conditions, 894 events. 481/894 cut-off events. For 70722/70722 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4504 event pairs, 58 based on Foata normal form. 10/902 useless extension candidates. Maximal degree in co-relation 4064. Up to 533 conditions per place. [2024-06-03 22:21:43,117 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 106 selfloop transitions, 69 changer transitions 13/190 dead transitions. [2024-06-03 22:21:43,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 190 transitions, 1706 flow [2024-06-03 22:21:43,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:21:43,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:21:43,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-03 22:21:43,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-03 22:21:43,119 INFO L175 Difference]: Start difference. First operand has 217 places, 166 transitions, 1254 flow. Second operand 11 states and 131 transitions. [2024-06-03 22:21:43,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 190 transitions, 1706 flow [2024-06-03 22:21:43,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 190 transitions, 1651 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-03 22:21:43,250 INFO L231 Difference]: Finished difference. Result has 218 places, 158 transitions, 1280 flow [2024-06-03 22:21:43,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1199, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1280, PETRI_PLACES=218, PETRI_TRANSITIONS=158} [2024-06-03 22:21:43,251 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 187 predicate places. [2024-06-03 22:21:43,251 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 158 transitions, 1280 flow [2024-06-03 22:21:43,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:43,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:43,251 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:43,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-03 22:21:43,252 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:21:43,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:43,252 INFO L85 PathProgramCache]: Analyzing trace with hash 987589594, now seen corresponding path program 2 times [2024-06-03 22:21:43,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:43,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202860423] [2024-06-03 22:21:43,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:43,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:48,172 INFO 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:48,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:48,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202860423] [2024-06-03 22:21:48,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202860423] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:48,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:48,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:21:48,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881540796] [2024-06-03 22:21:48,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:48,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:21:48,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:48,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:21:48,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:21:48,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:21:48,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 158 transitions, 1280 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:48,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:48,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:21:48,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:48,659 INFO L124 PetriNetUnfolderBase]: 485/926 cut-off events. [2024-06-03 22:21:48,660 INFO L125 PetriNetUnfolderBase]: For 105153/105153 co-relation queries the response was YES. [2024-06-03 22:21:48,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5307 conditions, 926 events. 485/926 cut-off events. For 105153/105153 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4748 event pairs, 74 based on Foata normal form. 8/932 useless extension candidates. Maximal degree in co-relation 5201. Up to 449 conditions per place. [2024-06-03 22:21:48,667 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 105 selfloop transitions, 74 changer transitions 6/187 dead transitions. [2024-06-03 22:21:48,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 187 transitions, 1912 flow [2024-06-03 22:21:48,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:21:48,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:21:48,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-03 22:21:48,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-03 22:21:48,670 INFO L175 Difference]: Start difference. First operand has 218 places, 158 transitions, 1280 flow. Second operand 11 states and 134 transitions. [2024-06-03 22:21:48,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 187 transitions, 1912 flow [2024-06-03 22:21:48,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 187 transitions, 1759 flow, removed 2 selfloop flow, removed 13 redundant places. [2024-06-03 22:21:48,868 INFO L231 Difference]: Finished difference. Result has 216 places, 157 transitions, 1275 flow [2024-06-03 22:21:48,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1275, PETRI_PLACES=216, PETRI_TRANSITIONS=157} [2024-06-03 22:21:48,868 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 185 predicate places. [2024-06-03 22:21:48,869 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 157 transitions, 1275 flow [2024-06-03 22:21:48,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:48,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:48,869 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:48,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-03 22:21:48,869 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:21:48,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:48,870 INFO L85 PathProgramCache]: Analyzing trace with hash 987580294, now seen corresponding path program 3 times [2024-06-03 22:21:48,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:48,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842345122] [2024-06-03 22:21:48,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:48,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:53,822 INFO 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:53,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:53,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842345122] [2024-06-03 22:21:53,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842345122] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:53,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:53,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:21:53,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444994176] [2024-06-03 22:21:53,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:53,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:21:53,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:53,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:21:53,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:21:53,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:21:53,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 157 transitions, 1275 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:53,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:53,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:21:53,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:54,280 INFO L124 PetriNetUnfolderBase]: 475/912 cut-off events. [2024-06-03 22:21:54,280 INFO L125 PetriNetUnfolderBase]: For 105327/105327 co-relation queries the response was YES. [2024-06-03 22:21:54,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4930 conditions, 912 events. 475/912 cut-off events. For 105327/105327 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4708 event pairs, 78 based on Foata normal form. 12/922 useless extension candidates. Maximal degree in co-relation 4825. Up to 529 conditions per place. [2024-06-03 22:21:54,288 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 100 selfloop transitions, 73 changer transitions 7/182 dead transitions. [2024-06-03 22:21:54,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 182 transitions, 1719 flow [2024-06-03 22:21:54,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:21:54,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:21:54,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-03 22:21:54,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-03 22:21:54,289 INFO L175 Difference]: Start difference. First operand has 216 places, 157 transitions, 1275 flow. Second operand 11 states and 131 transitions. [2024-06-03 22:21:54,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 182 transitions, 1719 flow [2024-06-03 22:21:54,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 182 transitions, 1569 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-03 22:21:54,451 INFO L231 Difference]: Finished difference. Result has 216 places, 155 transitions, 1266 flow [2024-06-03 22:21:54,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1266, PETRI_PLACES=216, PETRI_TRANSITIONS=155} [2024-06-03 22:21:54,453 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 185 predicate places. [2024-06-03 22:21:54,453 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 155 transitions, 1266 flow [2024-06-03 22:21:54,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:54,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:54,453 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:54,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-03 22:21:54,453 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:21:54,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:54,454 INFO L85 PathProgramCache]: Analyzing trace with hash 979961238, now seen corresponding path program 6 times [2024-06-03 22:21:54,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:54,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970324185] [2024-06-03 22:21:54,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:54,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:59,029 INFO 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:59,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:59,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970324185] [2024-06-03 22:21:59,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970324185] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:59,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:59,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:21:59,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911651699] [2024-06-03 22:21:59,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:59,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:21:59,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:59,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:21:59,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:21:59,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:21:59,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 155 transitions, 1266 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:59,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:59,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:21:59,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:59,447 INFO L124 PetriNetUnfolderBase]: 433/826 cut-off events. [2024-06-03 22:21:59,447 INFO L125 PetriNetUnfolderBase]: For 46396/46396 co-relation queries the response was YES. [2024-06-03 22:21:59,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4052 conditions, 826 events. 433/826 cut-off events. For 46396/46396 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4212 event pairs, 62 based on Foata normal form. 2/826 useless extension candidates. Maximal degree in co-relation 3947. Up to 491 conditions per place. [2024-06-03 22:21:59,454 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 105 selfloop transitions, 69 changer transitions 0/176 dead transitions. [2024-06-03 22:21:59,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 176 transitions, 1678 flow [2024-06-03 22:21:59,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:21:59,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:21:59,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2024-06-03 22:21:59,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35511363636363635 [2024-06-03 22:21:59,456 INFO L175 Difference]: Start difference. First operand has 216 places, 155 transitions, 1266 flow. Second operand 11 states and 125 transitions. [2024-06-03 22:21:59,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 176 transitions, 1678 flow [2024-06-03 22:21:59,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 176 transitions, 1514 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-03 22:21:59,596 INFO L231 Difference]: Finished difference. Result has 217 places, 156 transitions, 1256 flow [2024-06-03 22:21:59,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1256, PETRI_PLACES=217, PETRI_TRANSITIONS=156} [2024-06-03 22:21:59,597 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 186 predicate places. [2024-06-03 22:21:59,597 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 156 transitions, 1256 flow [2024-06-03 22:21:59,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:59,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:59,597 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:59,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-03 22:21:59,598 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:21:59,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:59,598 INFO L85 PathProgramCache]: Analyzing trace with hash 979955658, now seen corresponding path program 7 times [2024-06-03 22:21:59,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:59,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31526713] [2024-06-03 22:21:59,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:59,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:04,282 INFO 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,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:04,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31526713] [2024-06-03 22:22:04,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31526713] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:04,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:04,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:22:04,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93661137] [2024-06-03 22:22:04,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:04,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:22:04,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:04,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:22:04,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:22:04,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:22:04,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 156 transitions, 1256 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:04,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:04,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:22:04,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:04,783 INFO L124 PetriNetUnfolderBase]: 437/834 cut-off events. [2024-06-03 22:22:04,783 INFO L125 PetriNetUnfolderBase]: For 47692/47692 co-relation queries the response was YES. [2024-06-03 22:22:04,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4063 conditions, 834 events. 437/834 cut-off events. For 47692/47692 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4264 event pairs, 60 based on Foata normal form. 2/834 useless extension candidates. Maximal degree in co-relation 3957. Up to 479 conditions per place. [2024-06-03 22:22:04,788 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 104 selfloop transitions, 71 changer transitions 0/177 dead transitions. [2024-06-03 22:22:04,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 177 transitions, 1670 flow [2024-06-03 22:22:04,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:22:04,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:22:04,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-03 22:22:04,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35795454545454547 [2024-06-03 22:22:04,790 INFO L175 Difference]: Start difference. First operand has 217 places, 156 transitions, 1256 flow. Second operand 11 states and 126 transitions. [2024-06-03 22:22:04,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 177 transitions, 1670 flow [2024-06-03 22:22:04,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 177 transitions, 1526 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-03 22:22:04,913 INFO L231 Difference]: Finished difference. Result has 219 places, 157 transitions, 1272 flow [2024-06-03 22:22:04,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1272, PETRI_PLACES=219, PETRI_TRANSITIONS=157} [2024-06-03 22:22:04,914 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 188 predicate places. [2024-06-03 22:22:04,914 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 157 transitions, 1272 flow [2024-06-03 22:22:04,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:04,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:04,914 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:04,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-03 22:22:04,915 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:22:04,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:04,915 INFO L85 PathProgramCache]: Analyzing trace with hash 780659448, now seen corresponding path program 8 times [2024-06-03 22:22:04,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:04,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164446970] [2024-06-03 22:22:04,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:04,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:09,586 INFO 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:09,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:09,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164446970] [2024-06-03 22:22:09,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164446970] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:09,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:09,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:22:09,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562495150] [2024-06-03 22:22:09,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:09,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:22:09,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:09,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:22:09,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:22:09,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:22:09,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 157 transitions, 1272 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:09,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:09,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:22:09,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:10,125 INFO L124 PetriNetUnfolderBase]: 441/842 cut-off events. [2024-06-03 22:22:10,126 INFO L125 PetriNetUnfolderBase]: For 48897/48897 co-relation queries the response was YES. [2024-06-03 22:22:10,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4120 conditions, 842 events. 441/842 cut-off events. For 48897/48897 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4321 event pairs, 62 based on Foata normal form. 2/842 useless extension candidates. Maximal degree in co-relation 4013. Up to 561 conditions per place. [2024-06-03 22:22:10,132 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 117 selfloop transitions, 59 changer transitions 0/178 dead transitions. [2024-06-03 22:22:10,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 178 transitions, 1692 flow [2024-06-03 22:22:10,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:22:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:22:10,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2024-06-03 22:22:10,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3494318181818182 [2024-06-03 22:22:10,133 INFO L175 Difference]: Start difference. First operand has 219 places, 157 transitions, 1272 flow. Second operand 11 states and 123 transitions. [2024-06-03 22:22:10,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 178 transitions, 1692 flow [2024-06-03 22:22:10,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 178 transitions, 1542 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-03 22:22:10,276 INFO L231 Difference]: Finished difference. Result has 221 places, 158 transitions, 1260 flow [2024-06-03 22:22:10,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1260, PETRI_PLACES=221, PETRI_TRANSITIONS=158} [2024-06-03 22:22:10,277 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 190 predicate places. [2024-06-03 22:22:10,277 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 158 transitions, 1260 flow [2024-06-03 22:22:10,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:10,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:10,277 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:10,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-03 22:22:10,277 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:22:10,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:10,278 INFO L85 PathProgramCache]: Analyzing trace with hash 780653868, now seen corresponding path program 9 times [2024-06-03 22:22:10,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:10,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656507317] [2024-06-03 22:22:10,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:10,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:14,954 INFO 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:14,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:14,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656507317] [2024-06-03 22:22:14,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656507317] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:14,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:14,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:22:14,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396459643] [2024-06-03 22:22:14,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:14,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:22:14,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:14,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:22:14,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:22:15,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:22:15,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 158 transitions, 1260 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:15,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:15,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:22:15,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:15,573 INFO L124 PetriNetUnfolderBase]: 445/850 cut-off events. [2024-06-03 22:22:15,574 INFO L125 PetriNetUnfolderBase]: For 50038/50038 co-relation queries the response was YES. [2024-06-03 22:22:15,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4135 conditions, 850 events. 445/850 cut-off events. For 50038/50038 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4368 event pairs, 68 based on Foata normal form. 2/850 useless extension candidates. Maximal degree in co-relation 4027. Up to 555 conditions per place. [2024-06-03 22:22:15,579 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 117 selfloop transitions, 60 changer transitions 0/179 dead transitions. [2024-06-03 22:22:15,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 179 transitions, 1682 flow [2024-06-03 22:22:15,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:22:15,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:22:15,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-03 22:22:15,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-03 22:22:15,580 INFO L175 Difference]: Start difference. First operand has 221 places, 158 transitions, 1260 flow. Second operand 11 states and 124 transitions. [2024-06-03 22:22:15,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 179 transitions, 1682 flow [2024-06-03 22:22:15,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 179 transitions, 1554 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-03 22:22:15,724 INFO L231 Difference]: Finished difference. Result has 223 places, 159 transitions, 1274 flow [2024-06-03 22:22:15,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1274, PETRI_PLACES=223, PETRI_TRANSITIONS=159} [2024-06-03 22:22:15,724 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 192 predicate places. [2024-06-03 22:22:15,724 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 159 transitions, 1274 flow [2024-06-03 22:22:15,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:15,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:15,725 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:15,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-03 22:22:15,725 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:22:15,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:15,725 INFO L85 PathProgramCache]: Analyzing trace with hash 780509718, now seen corresponding path program 10 times [2024-06-03 22:22:15,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:15,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894018912] [2024-06-03 22:22:15,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:15,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:20,213 INFO 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:20,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:20,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894018912] [2024-06-03 22:22:20,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894018912] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:20,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:20,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:22:20,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133446277] [2024-06-03 22:22:20,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:20,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:22:20,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:20,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:22:20,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:22:20,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:22:20,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 159 transitions, 1274 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:20,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:20,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:22:20,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:20,575 INFO L124 PetriNetUnfolderBase]: 449/858 cut-off events. [2024-06-03 22:22:20,575 INFO L125 PetriNetUnfolderBase]: For 51407/51407 co-relation queries the response was YES. [2024-06-03 22:22:20,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4188 conditions, 858 events. 449/858 cut-off events. For 51407/51407 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4436 event pairs, 66 based on Foata normal form. 2/858 useless extension candidates. Maximal degree in co-relation 4079. Up to 461 conditions per place. [2024-06-03 22:22:20,582 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 107 selfloop transitions, 71 changer transitions 0/180 dead transitions. [2024-06-03 22:22:20,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 180 transitions, 1698 flow [2024-06-03 22:22:20,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:22:20,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:22:20,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-03 22:22:20,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35795454545454547 [2024-06-03 22:22:20,583 INFO L175 Difference]: Start difference. First operand has 223 places, 159 transitions, 1274 flow. Second operand 11 states and 126 transitions. [2024-06-03 22:22:20,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 180 transitions, 1698 flow [2024-06-03 22:22:20,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 180 transitions, 1566 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-03 22:22:20,731 INFO L231 Difference]: Finished difference. Result has 225 places, 160 transitions, 1308 flow [2024-06-03 22:22:20,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1308, PETRI_PLACES=225, PETRI_TRANSITIONS=160} [2024-06-03 22:22:20,731 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 194 predicate places. [2024-06-03 22:22:20,732 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 160 transitions, 1308 flow [2024-06-03 22:22:20,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:20,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:20,732 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,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-03 22:22:20,732 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:22:20,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:20,732 INFO L85 PathProgramCache]: Analyzing trace with hash -216148586, now seen corresponding path program 11 times [2024-06-03 22:22:20,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:20,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888577581] [2024-06-03 22:22:20,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:20,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:25,677 INFO 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,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:25,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888577581] [2024-06-03 22:22:25,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888577581] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:25,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:25,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:22:25,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487480428] [2024-06-03 22:22:25,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:25,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:22:25,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:25,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:22:25,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:22:25,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:22:25,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 160 transitions, 1308 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:25,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:25,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:22:25,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:26,291 INFO L124 PetriNetUnfolderBase]: 453/866 cut-off events. [2024-06-03 22:22:26,291 INFO L125 PetriNetUnfolderBase]: For 52732/52732 co-relation queries the response was YES. [2024-06-03 22:22:26,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4271 conditions, 866 events. 453/866 cut-off events. For 52732/52732 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4486 event pairs, 82 based on Foata normal form. 2/866 useless extension candidates. Maximal degree in co-relation 4161. Up to 585 conditions per place. [2024-06-03 22:22:26,298 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 121 selfloop transitions, 58 changer transitions 0/181 dead transitions. [2024-06-03 22:22:26,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 181 transitions, 1740 flow [2024-06-03 22:22:26,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:22:26,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:22:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-03 22:22:26,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-03 22:22:26,299 INFO L175 Difference]: Start difference. First operand has 225 places, 160 transitions, 1308 flow. Second operand 11 states and 121 transitions. [2024-06-03 22:22:26,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 181 transitions, 1740 flow [2024-06-03 22:22:26,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 181 transitions, 1584 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-03 22:22:26,450 INFO L231 Difference]: Finished difference. Result has 227 places, 161 transitions, 1294 flow [2024-06-03 22:22:26,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1152, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1294, PETRI_PLACES=227, PETRI_TRANSITIONS=161} [2024-06-03 22:22:26,451 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 196 predicate places. [2024-06-03 22:22:26,451 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 161 transitions, 1294 flow [2024-06-03 22:22:26,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:26,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:26,451 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,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-03 22:22:26,451 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:22:26,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:26,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1750329930, now seen corresponding path program 12 times [2024-06-03 22:22:26,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:26,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577007315] [2024-06-03 22:22:26,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:26,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:31,058 INFO 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:31,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:31,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577007315] [2024-06-03 22:22:31,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577007315] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:31,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:31,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:22:31,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829585577] [2024-06-03 22:22:31,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:31,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:22:31,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:31,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:22:31,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:22:31,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:22:31,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 161 transitions, 1294 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:31,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:31,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:22:31,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:31,522 INFO L124 PetriNetUnfolderBase]: 457/874 cut-off events. [2024-06-03 22:22:31,522 INFO L125 PetriNetUnfolderBase]: For 53954/53954 co-relation queries the response was YES. [2024-06-03 22:22:31,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4284 conditions, 874 events. 457/874 cut-off events. For 53954/53954 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4564 event pairs, 76 based on Foata normal form. 2/874 useless extension candidates. Maximal degree in co-relation 4173. Up to 525 conditions per place. [2024-06-03 22:22:31,530 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 108 selfloop transitions, 72 changer transitions 0/182 dead transitions. [2024-06-03 22:22:31,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 182 transitions, 1728 flow [2024-06-03 22:22:31,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:22:31,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:22:31,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-03 22:22:31,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-03 22:22:31,539 INFO L175 Difference]: Start difference. First operand has 227 places, 161 transitions, 1294 flow. Second operand 11 states and 124 transitions. [2024-06-03 22:22:31,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 182 transitions, 1728 flow [2024-06-03 22:22:31,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 182 transitions, 1628 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-03 22:22:31,688 INFO L231 Difference]: Finished difference. Result has 230 places, 162 transitions, 1366 flow [2024-06-03 22:22:31,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1194, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1366, PETRI_PLACES=230, PETRI_TRANSITIONS=162} [2024-06-03 22:22:31,689 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 199 predicate places. [2024-06-03 22:22:31,689 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 162 transitions, 1366 flow [2024-06-03 22:22:31,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:31,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:31,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] [2024-06-03 22:22:31,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-03 22:22:31,693 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:22:31,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:31,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1750185780, now seen corresponding path program 13 times [2024-06-03 22:22:31,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:31,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609763307] [2024-06-03 22:22:31,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:31,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:36,422 INFO 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:36,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:36,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609763307] [2024-06-03 22:22:36,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609763307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:36,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:36,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:22:36,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791952644] [2024-06-03 22:22:36,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:36,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:22:36,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:36,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:22:36,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:22:36,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:22:36,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 162 transitions, 1366 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:36,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:36,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:22:36,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:37,003 INFO L124 PetriNetUnfolderBase]: 461/882 cut-off events. [2024-06-03 22:22:37,004 INFO L125 PetriNetUnfolderBase]: For 55446/55446 co-relation queries the response was YES. [2024-06-03 22:22:37,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4393 conditions, 882 events. 461/882 cut-off events. For 55446/55446 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4621 event pairs, 76 based on Foata normal form. 2/882 useless extension candidates. Maximal degree in co-relation 4281. Up to 565 conditions per place. [2024-06-03 22:22:37,011 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 121 selfloop transitions, 60 changer transitions 0/183 dead transitions. [2024-06-03 22:22:37,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 183 transitions, 1802 flow [2024-06-03 22:22:37,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:22:37,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:22:37,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2024-06-03 22:22:37,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3494318181818182 [2024-06-03 22:22:37,012 INFO L175 Difference]: Start difference. First operand has 230 places, 162 transitions, 1366 flow. Second operand 11 states and 123 transitions. [2024-06-03 22:22:37,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 183 transitions, 1802 flow [2024-06-03 22:22:37,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 183 transitions, 1640 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-03 22:22:37,168 INFO L231 Difference]: Finished difference. Result has 232 places, 163 transitions, 1354 flow [2024-06-03 22:22:37,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1204, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1354, PETRI_PLACES=232, PETRI_TRANSITIONS=163} [2024-06-03 22:22:37,169 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 201 predicate places. [2024-06-03 22:22:37,169 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 163 transitions, 1354 flow [2024-06-03 22:22:37,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:37,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:37,169 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:37,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-03 22:22:37,170 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:22:37,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:37,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1746610860, now seen corresponding path program 14 times [2024-06-03 22:22:37,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:37,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494893166] [2024-06-03 22:22:37,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:37,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:41,770 INFO 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:41,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:41,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494893166] [2024-06-03 22:22:41,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494893166] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:41,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:41,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:22:41,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484072304] [2024-06-03 22:22:41,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:41,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:22:41,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:41,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:22:41,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:22:41,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:22:41,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 163 transitions, 1354 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:41,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:41,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:22:41,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:42,204 INFO L124 PetriNetUnfolderBase]: 465/890 cut-off events. [2024-06-03 22:22:42,205 INFO L125 PetriNetUnfolderBase]: For 56901/56901 co-relation queries the response was YES. [2024-06-03 22:22:42,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4414 conditions, 890 events. 465/890 cut-off events. For 56901/56901 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4664 event pairs, 80 based on Foata normal form. 2/890 useless extension candidates. Maximal degree in co-relation 4301. Up to 398 conditions per place. [2024-06-03 22:22:42,212 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 115 selfloop transitions, 68 changer transitions 0/185 dead transitions. [2024-06-03 22:22:42,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 185 transitions, 1974 flow [2024-06-03 22:22:42,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:22:42,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:22:42,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2024-06-03 22:22:42,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3494318181818182 [2024-06-03 22:22:42,215 INFO L175 Difference]: Start difference. First operand has 232 places, 163 transitions, 1354 flow. Second operand 11 states and 123 transitions. [2024-06-03 22:22:42,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 185 transitions, 1974 flow [2024-06-03 22:22:42,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 185 transitions, 1834 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-03 22:22:42,371 INFO L231 Difference]: Finished difference. Result has 234 places, 164 transitions, 1380 flow [2024-06-03 22:22:42,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1214, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1380, PETRI_PLACES=234, PETRI_TRANSITIONS=164} [2024-06-03 22:22:42,372 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 203 predicate places. [2024-06-03 22:22:42,372 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 164 transitions, 1380 flow [2024-06-03 22:22:42,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:42,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:42,372 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:42,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-03 22:22:42,373 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:22:42,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:42,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1152501594, now seen corresponding path program 15 times [2024-06-03 22:22:42,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:42,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16929039] [2024-06-03 22:22:42,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:42,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:42,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:47,191 INFO 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:47,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:47,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16929039] [2024-06-03 22:22:47,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16929039] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:47,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:47,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:22:47,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796618301] [2024-06-03 22:22:47,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:47,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:22:47,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:47,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:22:47,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:22:47,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:22:47,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 164 transitions, 1380 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:47,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:47,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:22:47,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:47,815 INFO L124 PetriNetUnfolderBase]: 469/898 cut-off events. [2024-06-03 22:22:47,815 INFO L125 PetriNetUnfolderBase]: For 58272/58272 co-relation queries the response was YES. [2024-06-03 22:22:47,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4493 conditions, 898 events. 469/898 cut-off events. For 58272/58272 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4721 event pairs, 84 based on Foata normal form. 2/898 useless extension candidates. Maximal degree in co-relation 4379. Up to 617 conditions per place. [2024-06-03 22:22:47,821 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 124 selfloop transitions, 58 changer transitions 0/184 dead transitions. [2024-06-03 22:22:47,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 184 transitions, 1822 flow [2024-06-03 22:22:47,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:22:47,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:22:47,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-03 22:22:47,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-03 22:22:47,822 INFO L175 Difference]: Start difference. First operand has 234 places, 164 transitions, 1380 flow. Second operand 11 states and 124 transitions. [2024-06-03 22:22:47,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 184 transitions, 1822 flow [2024-06-03 22:22:47,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 184 transitions, 1679 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-03 22:22:47,983 INFO L231 Difference]: Finished difference. Result has 236 places, 165 transitions, 1387 flow [2024-06-03 22:22:47,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1387, PETRI_PLACES=236, PETRI_TRANSITIONS=165} [2024-06-03 22:22:47,983 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 205 predicate places. [2024-06-03 22:22:47,983 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 165 transitions, 1387 flow [2024-06-03 22:22:47,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:47,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:47,984 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,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-03 22:22:47,984 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:22:47,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:47,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1152496014, now seen corresponding path program 16 times [2024-06-03 22:22:47,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:47,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097177324] [2024-06-03 22:22:47,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:47,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:52,967 INFO 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:52,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:52,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097177324] [2024-06-03 22:22:52,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097177324] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:52,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:52,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:22:52,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383718216] [2024-06-03 22:22:52,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:52,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:22:52,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:52,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:22:52,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:22:53,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:22:53,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 165 transitions, 1387 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:53,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:53,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:22:53,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:53,614 INFO L124 PetriNetUnfolderBase]: 473/906 cut-off events. [2024-06-03 22:22:53,614 INFO L125 PetriNetUnfolderBase]: For 59328/59328 co-relation queries the response was YES. [2024-06-03 22:22:53,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4480 conditions, 906 events. 473/906 cut-off events. For 59328/59328 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4798 event pairs, 84 based on Foata normal form. 2/906 useless extension candidates. Maximal degree in co-relation 4366. Up to 611 conditions per place. [2024-06-03 22:22:53,621 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 124 selfloop transitions, 59 changer transitions 0/185 dead transitions. [2024-06-03 22:22:53,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 185 transitions, 1826 flow [2024-06-03 22:22:53,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:22:53,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:22:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2024-06-03 22:22:53,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35511363636363635 [2024-06-03 22:22:53,623 INFO L175 Difference]: Start difference. First operand has 236 places, 165 transitions, 1387 flow. Second operand 11 states and 125 transitions. [2024-06-03 22:22:53,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 185 transitions, 1826 flow [2024-06-03 22:22:53,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 185 transitions, 1676 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-03 22:22:53,787 INFO L231 Difference]: Finished difference. Result has 238 places, 166 transitions, 1386 flow [2024-06-03 22:22:53,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1386, PETRI_PLACES=238, PETRI_TRANSITIONS=166} [2024-06-03 22:22:53,788 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 207 predicate places. [2024-06-03 22:22:53,788 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 166 transitions, 1386 flow [2024-06-03 22:22:53,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:53,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:53,789 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:53,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-03 22:22:53,789 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:22:53,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:53,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1152351864, now seen corresponding path program 17 times [2024-06-03 22:22:53,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:53,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817880897] [2024-06-03 22:22:53,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:53,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:58,942 INFO 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:58,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:58,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817880897] [2024-06-03 22:22:58,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817880897] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:58,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:58,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:22:58,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269929780] [2024-06-03 22:22:58,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:58,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:22:58,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:58,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:22:58,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:22:59,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:22:59,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 166 transitions, 1386 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:59,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:59,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:22:59,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:59,482 INFO L124 PetriNetUnfolderBase]: 477/914 cut-off events. [2024-06-03 22:22:59,482 INFO L125 PetriNetUnfolderBase]: For 60774/60774 co-relation queries the response was YES. [2024-06-03 22:22:59,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4519 conditions, 914 events. 477/914 cut-off events. For 60774/60774 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4838 event pairs, 86 based on Foata normal form. 2/914 useless extension candidates. Maximal degree in co-relation 4404. Up to 554 conditions per place. [2024-06-03 22:22:59,490 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 123 selfloop transitions, 62 changer transitions 0/187 dead transitions. [2024-06-03 22:22:59,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 187 transitions, 2015 flow [2024-06-03 22:22:59,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:22:59,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:22:59,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-03 22:22:59,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35795454545454547 [2024-06-03 22:22:59,491 INFO L175 Difference]: Start difference. First operand has 238 places, 166 transitions, 1386 flow. Second operand 11 states and 126 transitions. [2024-06-03 22:22:59,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 187 transitions, 2015 flow [2024-06-03 22:22:59,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 187 transitions, 1877 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-03 22:22:59,658 INFO L231 Difference]: Finished difference. Result has 240 places, 167 transitions, 1403 flow [2024-06-03 22:22:59,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1403, PETRI_PLACES=240, PETRI_TRANSITIONS=167} [2024-06-03 22:22:59,658 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 209 predicate places. [2024-06-03 22:22:59,658 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 167 transitions, 1403 flow [2024-06-03 22:22:59,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:59,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:59,659 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:59,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-03 22:22:59,659 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:22:59,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:59,659 INFO L85 PathProgramCache]: Analyzing trace with hash -212054454, now seen corresponding path program 4 times [2024-06-03 22:22:59,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:59,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308038809] [2024-06-03 22:22:59,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:59,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:04,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:23:04,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:04,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308038809] [2024-06-03 22:23:04,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308038809] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:04,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:04,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:23:04,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284853542] [2024-06-03 22:23:04,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:04,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:23:04,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:04,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:23:04,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:23:04,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:23:04,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 167 transitions, 1403 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:04,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:04,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:23:04,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:04,908 INFO L124 PetriNetUnfolderBase]: 493/950 cut-off events. [2024-06-03 22:23:04,908 INFO L125 PetriNetUnfolderBase]: For 96370/96370 co-relation queries the response was YES. [2024-06-03 22:23:04,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4606 conditions, 950 events. 493/950 cut-off events. For 96370/96370 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5044 event pairs, 94 based on Foata normal form. 10/958 useless extension candidates. Maximal degree in co-relation 4490. Up to 608 conditions per place. [2024-06-03 22:23:04,917 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 125 selfloop transitions, 54 changer transitions 10/191 dead transitions. [2024-06-03 22:23:04,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 191 transitions, 1855 flow [2024-06-03 22:23:04,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:23:04,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:23:04,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-03 22:23:04,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3693181818181818 [2024-06-03 22:23:04,918 INFO L175 Difference]: Start difference. First operand has 240 places, 167 transitions, 1403 flow. Second operand 11 states and 130 transitions. [2024-06-03 22:23:04,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 191 transitions, 1855 flow [2024-06-03 22:23:05,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 191 transitions, 1689 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-03 22:23:05,088 INFO L231 Difference]: Finished difference. Result has 242 places, 162 transitions, 1311 flow [2024-06-03 22:23:05,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1311, PETRI_PLACES=242, PETRI_TRANSITIONS=162} [2024-06-03 22:23:05,088 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 211 predicate places. [2024-06-03 22:23:05,088 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 162 transitions, 1311 flow [2024-06-03 22:23:05,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:05,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:05,089 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:23:05,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-03 22:23:05,089 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:23:05,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:05,089 INFO L85 PathProgramCache]: Analyzing trace with hash 540051950, now seen corresponding path program 18 times [2024-06-03 22:23:05,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:05,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018147512] [2024-06-03 22:23:05,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:05,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:09,847 INFO 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:09,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:09,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018147512] [2024-06-03 22:23:09,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018147512] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:09,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:09,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:23:09,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583278236] [2024-06-03 22:23:09,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:09,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:23:09,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:09,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:23:09,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:23:09,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:23:09,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 162 transitions, 1311 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:09,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:09,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:23:09,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:10,371 INFO L124 PetriNetUnfolderBase]: 479/936 cut-off events. [2024-06-03 22:23:10,372 INFO L125 PetriNetUnfolderBase]: For 107136/107136 co-relation queries the response was YES. [2024-06-03 22:23:10,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4493 conditions, 936 events. 479/936 cut-off events. For 107136/107136 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5046 event pairs, 82 based on Foata normal form. 12/946 useless extension candidates. Maximal degree in co-relation 4376. Up to 575 conditions per place. [2024-06-03 22:23:10,381 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 115 selfloop transitions, 65 changer transitions 7/189 dead transitions. [2024-06-03 22:23:10,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 189 transitions, 1792 flow [2024-06-03 22:23:10,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:23:10,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:23:10,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 144 transitions. [2024-06-03 22:23:10,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-03 22:23:10,382 INFO L175 Difference]: Start difference. First operand has 242 places, 162 transitions, 1311 flow. Second operand 12 states and 144 transitions. [2024-06-03 22:23:10,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 189 transitions, 1792 flow [2024-06-03 22:23:10,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 189 transitions, 1674 flow, removed 1 selfloop flow, removed 13 redundant places. [2024-06-03 22:23:10,568 INFO L231 Difference]: Finished difference. Result has 241 places, 160 transitions, 1338 flow [2024-06-03 22:23:10,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1193, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1338, PETRI_PLACES=241, PETRI_TRANSITIONS=160} [2024-06-03 22:23:10,569 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 210 predicate places. [2024-06-03 22:23:10,569 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 160 transitions, 1338 flow [2024-06-03 22:23:10,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:10,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:10,569 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:23:10,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-03 22:23:10,570 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:23:10,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:10,570 INFO L85 PathProgramCache]: Analyzing trace with hash 540328656, now seen corresponding path program 5 times [2024-06-03 22:23:10,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:10,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292461088] [2024-06-03 22:23:10,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:10,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:15,398 INFO 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:15,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:15,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292461088] [2024-06-03 22:23:15,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292461088] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:15,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:15,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:23:15,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30830322] [2024-06-03 22:23:15,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:15,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:23:15,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:15,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:23:15,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:23:15,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:23:15,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 160 transitions, 1338 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:15,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:15,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:23:15,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:15,975 INFO L124 PetriNetUnfolderBase]: 489/962 cut-off events. [2024-06-03 22:23:15,976 INFO L125 PetriNetUnfolderBase]: For 124126/124126 co-relation queries the response was YES. [2024-06-03 22:23:15,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5392 conditions, 962 events. 489/962 cut-off events. For 124126/124126 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5182 event pairs, 90 based on Foata normal form. 8/968 useless extension candidates. Maximal degree in co-relation 5276. Up to 559 conditions per place. [2024-06-03 22:23:15,984 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 117 selfloop transitions, 62 changer transitions 8/189 dead transitions. [2024-06-03 22:23:15,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 189 transitions, 2011 flow [2024-06-03 22:23:15,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:23:15,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:23:15,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2024-06-03 22:23:15,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3776041666666667 [2024-06-03 22:23:15,985 INFO L175 Difference]: Start difference. First operand has 241 places, 160 transitions, 1338 flow. Second operand 12 states and 145 transitions. [2024-06-03 22:23:15,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 189 transitions, 2011 flow [2024-06-03 22:23:16,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 189 transitions, 1854 flow, removed 12 selfloop flow, removed 11 redundant places. [2024-06-03 22:23:16,243 INFO L231 Difference]: Finished difference. Result has 242 places, 157 transitions, 1289 flow [2024-06-03 22:23:16,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1289, PETRI_PLACES=242, PETRI_TRANSITIONS=157} [2024-06-03 22:23:16,244 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 211 predicate places. [2024-06-03 22:23:16,244 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 157 transitions, 1289 flow [2024-06-03 22:23:16,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:16,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:16,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] [2024-06-03 22:23:16,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-03 22:23:16,244 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:23:16,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:16,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1259309674, now seen corresponding path program 19 times [2024-06-03 22:23:16,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:16,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886754518] [2024-06-03 22:23:16,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:16,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:20,981 INFO 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:20,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:20,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886754518] [2024-06-03 22:23:20,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886754518] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:20,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:20,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:23:20,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614063477] [2024-06-03 22:23:20,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:20,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:23:20,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:20,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:23:20,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:23:21,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:23:21,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 157 transitions, 1289 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:21,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:21,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:23:21,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:21,450 INFO L124 PetriNetUnfolderBase]: 467/916 cut-off events. [2024-06-03 22:23:21,451 INFO L125 PetriNetUnfolderBase]: For 91633/91633 co-relation queries the response was YES. [2024-06-03 22:23:21,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5013 conditions, 916 events. 467/916 cut-off events. For 91633/91633 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4877 event pairs, 91 based on Foata normal form. 2/916 useless extension candidates. Maximal degree in co-relation 4896. Up to 635 conditions per place. [2024-06-03 22:23:21,462 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 118 selfloop transitions, 59 changer transitions 0/179 dead transitions. [2024-06-03 22:23:21,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 179 transitions, 1728 flow [2024-06-03 22:23:21,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:23:21,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:23:21,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 132 transitions. [2024-06-03 22:23:21,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-03 22:23:21,464 INFO L175 Difference]: Start difference. First operand has 242 places, 157 transitions, 1289 flow. Second operand 12 states and 132 transitions. [2024-06-03 22:23:21,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 179 transitions, 1728 flow [2024-06-03 22:23:21,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 179 transitions, 1600 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-03 22:23:21,709 INFO L231 Difference]: Finished difference. Result has 239 places, 158 transitions, 1314 flow [2024-06-03 22:23:21,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1314, PETRI_PLACES=239, PETRI_TRANSITIONS=158} [2024-06-03 22:23:21,717 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 208 predicate places. [2024-06-03 22:23:21,717 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 158 transitions, 1314 flow [2024-06-03 22:23:21,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:21,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:21,724 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:23:21,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-03 22:23:21,724 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:23:21,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:21,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1151153938, now seen corresponding path program 20 times [2024-06-03 22:23:21,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:21,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162726341] [2024-06-03 22:23:21,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:21,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:26,438 INFO 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:26,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:26,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162726341] [2024-06-03 22:23:26,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162726341] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:26,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:26,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:23:26,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155742077] [2024-06-03 22:23:26,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:26,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:23:26,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:26,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:23:26,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:23:26,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:23:26,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 158 transitions, 1314 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:26,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:26,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:23:26,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:26,944 INFO L124 PetriNetUnfolderBase]: 471/924 cut-off events. [2024-06-03 22:23:26,944 INFO L125 PetriNetUnfolderBase]: For 86072/86072 co-relation queries the response was YES. [2024-06-03 22:23:26,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5053 conditions, 924 events. 471/924 cut-off events. For 86072/86072 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4925 event pairs, 105 based on Foata normal form. 2/924 useless extension candidates. Maximal degree in co-relation 4938. Up to 643 conditions per place. [2024-06-03 22:23:26,954 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 126 selfloop transitions, 51 changer transitions 0/179 dead transitions. [2024-06-03 22:23:26,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 179 transitions, 1753 flow [2024-06-03 22:23:26,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:23:26,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:23:26,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-03 22:23:26,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-03 22:23:26,956 INFO L175 Difference]: Start difference. First operand has 239 places, 158 transitions, 1314 flow. Second operand 11 states and 124 transitions. [2024-06-03 22:23:26,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 179 transitions, 1753 flow [2024-06-03 22:23:27,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 179 transitions, 1618 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-03 22:23:27,185 INFO L231 Difference]: Finished difference. Result has 241 places, 159 transitions, 1318 flow [2024-06-03 22:23:27,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1318, PETRI_PLACES=241, PETRI_TRANSITIONS=159} [2024-06-03 22:23:27,186 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 210 predicate places. [2024-06-03 22:23:27,186 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 159 transitions, 1318 flow [2024-06-03 22:23:27,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:27,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:27,186 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:23:27,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-03 22:23:27,187 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:23:27,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:27,187 INFO L85 PathProgramCache]: Analyzing trace with hash -18330370, now seen corresponding path program 21 times [2024-06-03 22:23:27,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:27,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855183973] [2024-06-03 22:23:27,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:27,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:31,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:31,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:31,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855183973] [2024-06-03 22:23:31,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855183973] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:31,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:31,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:23:31,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502789107] [2024-06-03 22:23:31,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:31,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:23:31,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:31,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:23:31,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:23:32,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:23:32,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 159 transitions, 1318 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:32,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:32,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:23:32,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:32,442 INFO L124 PetriNetUnfolderBase]: 511/1004 cut-off events. [2024-06-03 22:23:32,442 INFO L125 PetriNetUnfolderBase]: For 143568/143568 co-relation queries the response was YES. [2024-06-03 22:23:32,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6486 conditions, 1004 events. 511/1004 cut-off events. For 143568/143568 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5440 event pairs, 121 based on Foata normal form. 2/1004 useless extension candidates. Maximal degree in co-relation 6370. Up to 606 conditions per place. [2024-06-03 22:23:32,451 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 124 selfloop transitions, 60 changer transitions 0/186 dead transitions. [2024-06-03 22:23:32,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 186 transitions, 2014 flow [2024-06-03 22:23:32,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:23:32,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:23:32,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-03 22:23:32,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-03 22:23:32,452 INFO L175 Difference]: Start difference. First operand has 241 places, 159 transitions, 1318 flow. Second operand 11 states and 134 transitions. [2024-06-03 22:23:32,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 186 transitions, 2014 flow [2024-06-03 22:23:32,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 186 transitions, 1875 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-03 22:23:32,772 INFO L231 Difference]: Finished difference. Result has 243 places, 161 transitions, 1371 flow [2024-06-03 22:23:32,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1371, PETRI_PLACES=243, PETRI_TRANSITIONS=161} [2024-06-03 22:23:32,772 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 212 predicate places. [2024-06-03 22:23:32,772 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 161 transitions, 1371 flow [2024-06-03 22:23:32,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:32,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:32,773 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:23:32,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-03 22:23:32,773 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:23:32,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:32,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1359155034, now seen corresponding path program 22 times [2024-06-03 22:23:32,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:32,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124214624] [2024-06-03 22:23:32,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:32,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:37,818 INFO 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:37,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:37,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124214624] [2024-06-03 22:23:37,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124214624] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:37,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:37,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:23:37,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628282040] [2024-06-03 22:23:37,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:37,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:23:37,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:37,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:23:37,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:23:37,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:23:37,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 161 transitions, 1371 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:37,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:37,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:23:37,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:38,354 INFO L124 PetriNetUnfolderBase]: 508/999 cut-off events. [2024-06-03 22:23:38,355 INFO L125 PetriNetUnfolderBase]: For 137337/137337 co-relation queries the response was YES. [2024-06-03 22:23:38,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6259 conditions, 999 events. 508/999 cut-off events. For 137337/137337 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5410 event pairs, 126 based on Foata normal form. 2/999 useless extension candidates. Maximal degree in co-relation 6142. Up to 718 conditions per place. [2024-06-03 22:23:38,363 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 127 selfloop transitions, 52 changer transitions 0/181 dead transitions. [2024-06-03 22:23:38,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 181 transitions, 1783 flow [2024-06-03 22:23:38,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:23:38,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:23:38,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-03 22:23:38,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-03 22:23:38,364 INFO L175 Difference]: Start difference. First operand has 243 places, 161 transitions, 1371 flow. Second operand 11 states and 124 transitions. [2024-06-03 22:23:38,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 181 transitions, 1783 flow [2024-06-03 22:23:38,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 181 transitions, 1679 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-03 22:23:38,680 INFO L231 Difference]: Finished difference. Result has 247 places, 161 transitions, 1375 flow [2024-06-03 22:23:38,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1375, PETRI_PLACES=247, PETRI_TRANSITIONS=161} [2024-06-03 22:23:38,681 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 216 predicate places. [2024-06-03 22:23:38,681 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 161 transitions, 1375 flow [2024-06-03 22:23:38,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:38,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:38,681 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:23:38,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-03 22:23:38,681 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:23:38,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:38,682 INFO L85 PathProgramCache]: Analyzing trace with hash 739837700, now seen corresponding path program 6 times [2024-06-03 22:23:38,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:38,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663650411] [2024-06-03 22:23:38,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:38,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:43,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:43,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663650411] [2024-06-03 22:23:43,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663650411] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:43,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:43,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:23:43,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805222295] [2024-06-03 22:23:43,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:43,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:23:43,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:43,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:23:43,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:23:43,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:23:43,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 161 transitions, 1375 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:43,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:43,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:23:43,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:44,092 INFO L124 PetriNetUnfolderBase]: 495/976 cut-off events. [2024-06-03 22:23:44,092 INFO L125 PetriNetUnfolderBase]: For 130416/130416 co-relation queries the response was YES. [2024-06-03 22:23:44,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5294 conditions, 976 events. 495/976 cut-off events. For 130416/130416 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5281 event pairs, 111 based on Foata normal form. 10/984 useless extension candidates. Maximal degree in co-relation 5175. Up to 624 conditions per place. [2024-06-03 22:23:44,100 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 120 selfloop transitions, 56 changer transitions 7/185 dead transitions. [2024-06-03 22:23:44,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 185 transitions, 1815 flow [2024-06-03 22:23:44,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:23:44,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:23:44,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-03 22:23:44,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-03 22:23:44,102 INFO L175 Difference]: Start difference. First operand has 247 places, 161 transitions, 1375 flow. Second operand 11 states and 132 transitions. [2024-06-03 22:23:44,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 185 transitions, 1815 flow [2024-06-03 22:23:44,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 185 transitions, 1665 flow, removed 15 selfloop flow, removed 11 redundant places. [2024-06-03 22:23:44,357 INFO L231 Difference]: Finished difference. Result has 247 places, 158 transitions, 1323 flow [2024-06-03 22:23:44,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1323, PETRI_PLACES=247, PETRI_TRANSITIONS=158} [2024-06-03 22:23:44,358 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 216 predicate places. [2024-06-03 22:23:44,358 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 158 transitions, 1323 flow [2024-06-03 22:23:44,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:44,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:44,358 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:23:44,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-03 22:23:44,358 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:23:44,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:44,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1359431740, now seen corresponding path program 7 times [2024-06-03 22:23:44,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:44,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143108884] [2024-06-03 22:23:44,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:44,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:49,073 INFO 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:49,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:49,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143108884] [2024-06-03 22:23:49,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143108884] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:49,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:49,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:23:49,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093362402] [2024-06-03 22:23:49,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:49,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:23:49,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:49,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:23:49,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:23:49,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:23:49,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 158 transitions, 1323 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:49,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:49,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:23:49,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:49,579 INFO L124 PetriNetUnfolderBase]: 498/989 cut-off events. [2024-06-03 22:23:49,579 INFO L125 PetriNetUnfolderBase]: For 151252/151252 co-relation queries the response was YES. [2024-06-03 22:23:49,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5837 conditions, 989 events. 498/989 cut-off events. For 151252/151252 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5368 event pairs, 116 based on Foata normal form. 8/995 useless extension candidates. Maximal degree in co-relation 5717. Up to 590 conditions per place. [2024-06-03 22:23:49,588 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 121 selfloop transitions, 53 changer transitions 8/184 dead transitions. [2024-06-03 22:23:49,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 184 transitions, 1957 flow [2024-06-03 22:23:49,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:23:49,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:23:49,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-03 22:23:49,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3778409090909091 [2024-06-03 22:23:49,589 INFO L175 Difference]: Start difference. First operand has 247 places, 158 transitions, 1323 flow. Second operand 11 states and 133 transitions. [2024-06-03 22:23:49,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 184 transitions, 1957 flow [2024-06-03 22:23:49,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 184 transitions, 1837 flow, removed 2 selfloop flow, removed 12 redundant places. [2024-06-03 22:23:49,910 INFO L231 Difference]: Finished difference. Result has 246 places, 155 transitions, 1294 flow [2024-06-03 22:23:49,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1294, PETRI_PLACES=246, PETRI_TRANSITIONS=155} [2024-06-03 22:23:49,911 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 215 predicate places. [2024-06-03 22:23:49,911 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 155 transitions, 1294 flow [2024-06-03 22:23:49,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:49,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:49,911 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:23:49,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-03 22:23:49,914 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:23:49,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:49,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1259315254, now seen corresponding path program 23 times [2024-06-03 22:23:49,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:49,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27489995] [2024-06-03 22:23:49,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:49,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:54,849 INFO 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:54,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:54,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27489995] [2024-06-03 22:23:54,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27489995] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:54,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:54,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:23:54,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834672873] [2024-06-03 22:23:54,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:54,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:23:54,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:54,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:23:54,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:23:55,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:23:55,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 155 transitions, 1294 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:55,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:55,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:23:55,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:55,539 INFO L124 PetriNetUnfolderBase]: 512/1015 cut-off events. [2024-06-03 22:23:55,540 INFO L125 PetriNetUnfolderBase]: For 170683/170683 co-relation queries the response was YES. [2024-06-03 22:23:55,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6911 conditions, 1015 events. 512/1015 cut-off events. For 170683/170683 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5522 event pairs, 119 based on Foata normal form. 2/1015 useless extension candidates. Maximal degree in co-relation 6791. Up to 620 conditions per place. [2024-06-03 22:23:55,549 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 113 selfloop transitions, 67 changer transitions 0/182 dead transitions. [2024-06-03 22:23:55,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 182 transitions, 1959 flow [2024-06-03 22:23:55,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:23:55,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:23:55,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 140 transitions. [2024-06-03 22:23:55,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-03 22:23:55,550 INFO L175 Difference]: Start difference. First operand has 246 places, 155 transitions, 1294 flow. Second operand 12 states and 140 transitions. [2024-06-03 22:23:55,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 182 transitions, 1959 flow [2024-06-03 22:23:55,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 182 transitions, 1844 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-03 22:23:55,939 INFO L231 Difference]: Finished difference. Result has 244 places, 156 transitions, 1358 flow [2024-06-03 22:23:55,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1185, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1358, PETRI_PLACES=244, PETRI_TRANSITIONS=156} [2024-06-03 22:23:55,940 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 213 predicate places. [2024-06-03 22:23:55,940 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 156 transitions, 1358 flow [2024-06-03 22:23:55,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:55,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:55,940 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:23:55,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-03 22:23:55,940 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:23:55,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:55,941 INFO L85 PathProgramCache]: Analyzing trace with hash -110432648, now seen corresponding path program 24 times [2024-06-03 22:23:55,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:55,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571275980] [2024-06-03 22:23:55,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:55,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:00,900 INFO 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:00,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:00,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571275980] [2024-06-03 22:24:00,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571275980] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:00,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:00,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:24:00,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235045949] [2024-06-03 22:24:00,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:00,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:24:00,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:00,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:24:00,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:24:01,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:24:01,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 156 transitions, 1358 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:01,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:01,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:24:01,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:01,446 INFO L124 PetriNetUnfolderBase]: 509/1010 cut-off events. [2024-06-03 22:24:01,447 INFO L125 PetriNetUnfolderBase]: For 154885/154885 co-relation queries the response was YES. [2024-06-03 22:24:01,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6663 conditions, 1010 events. 509/1010 cut-off events. For 154885/154885 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5497 event pairs, 126 based on Foata normal form. 2/1010 useless extension candidates. Maximal degree in co-relation 6545. Up to 729 conditions per place. [2024-06-03 22:24:01,456 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 114 selfloop transitions, 61 changer transitions 0/177 dead transitions. [2024-06-03 22:24:01,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 177 transitions, 1764 flow [2024-06-03 22:24:01,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:24:01,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:24:01,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 131 transitions. [2024-06-03 22:24:01,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3411458333333333 [2024-06-03 22:24:01,458 INFO L175 Difference]: Start difference. First operand has 244 places, 156 transitions, 1358 flow. Second operand 12 states and 131 transitions. [2024-06-03 22:24:01,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 177 transitions, 1764 flow [2024-06-03 22:24:01,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 177 transitions, 1553 flow, removed 27 selfloop flow, removed 10 redundant places. [2024-06-03 22:24:01,852 INFO L231 Difference]: Finished difference. Result has 246 places, 156 transitions, 1273 flow [2024-06-03 22:24:01,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1273, PETRI_PLACES=246, PETRI_TRANSITIONS=156} [2024-06-03 22:24:01,853 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 215 predicate places. [2024-06-03 22:24:01,853 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 156 transitions, 1273 flow [2024-06-03 22:24:01,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:01,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:01,853 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:24:01,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-03 22:24:01,853 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:24:01,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:01,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1003529240, now seen corresponding path program 8 times [2024-06-03 22:24:01,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:01,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561949947] [2024-06-03 22:24:01,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:01,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:07,017 INFO 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:07,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:07,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561949947] [2024-06-03 22:24:07,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561949947] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:07,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:07,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:24:07,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23446582] [2024-06-03 22:24:07,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:07,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:24:07,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:07,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:24:07,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:24:07,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:24:07,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 156 transitions, 1273 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:07,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:07,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:24:07,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:07,558 INFO L124 PetriNetUnfolderBase]: 496/987 cut-off events. [2024-06-03 22:24:07,558 INFO L125 PetriNetUnfolderBase]: For 147754/147754 co-relation queries the response was YES. [2024-06-03 22:24:07,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5496 conditions, 987 events. 496/987 cut-off events. For 147754/147754 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5354 event pairs, 111 based on Foata normal form. 10/995 useless extension candidates. Maximal degree in co-relation 5378. Up to 644 conditions per place. [2024-06-03 22:24:07,567 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 108 selfloop transitions, 63 changer transitions 8/181 dead transitions. [2024-06-03 22:24:07,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 181 transitions, 1707 flow [2024-06-03 22:24:07,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:24:07,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:24:07,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2024-06-03 22:24:07,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-03 22:24:07,568 INFO L175 Difference]: Start difference. First operand has 246 places, 156 transitions, 1273 flow. Second operand 12 states and 138 transitions. [2024-06-03 22:24:07,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 181 transitions, 1707 flow [2024-06-03 22:24:07,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 181 transitions, 1486 flow, removed 5 selfloop flow, removed 14 redundant places. [2024-06-03 22:24:07,872 INFO L231 Difference]: Finished difference. Result has 244 places, 152 transitions, 1158 flow [2024-06-03 22:24:07,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1158, PETRI_PLACES=244, PETRI_TRANSITIONS=152} [2024-06-03 22:24:07,873 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 213 predicate places. [2024-06-03 22:24:07,873 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 152 transitions, 1158 flow [2024-06-03 22:24:07,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:07,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:07,873 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:24:07,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-03 22:24:07,873 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:24:07,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:07,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1003519940, now seen corresponding path program 9 times [2024-06-03 22:24:07,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:07,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641891456] [2024-06-03 22:24:07,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:07,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:13,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:24:13,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:13,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641891456] [2024-06-03 22:24:13,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641891456] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:13,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:13,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:24:13,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987892177] [2024-06-03 22:24:13,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:13,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:24:13,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:13,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:24:13,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:24:13,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:24:13,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 152 transitions, 1158 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:13,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:13,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:24:13,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:13,714 INFO L124 PetriNetUnfolderBase]: 497/998 cut-off events. [2024-06-03 22:24:13,714 INFO L125 PetriNetUnfolderBase]: For 169369/169369 co-relation queries the response was YES. [2024-06-03 22:24:13,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5957 conditions, 998 events. 497/998 cut-off events. For 169369/169369 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5458 event pairs, 120 based on Foata normal form. 8/1004 useless extension candidates. Maximal degree in co-relation 5838. Up to 620 conditions per place. [2024-06-03 22:24:13,723 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 109 selfloop transitions, 58 changer transitions 11/180 dead transitions. [2024-06-03 22:24:13,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 180 transitions, 1790 flow [2024-06-03 22:24:13,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:24:13,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:24:13,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-03 22:24:13,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-03 22:24:13,724 INFO L175 Difference]: Start difference. First operand has 244 places, 152 transitions, 1158 flow. Second operand 12 states and 141 transitions. [2024-06-03 22:24:13,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 180 transitions, 1790 flow [2024-06-03 22:24:14,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 180 transitions, 1623 flow, removed 2 selfloop flow, removed 14 redundant places. [2024-06-03 22:24:14,124 INFO L231 Difference]: Finished difference. Result has 242 places, 146 transitions, 1078 flow [2024-06-03 22:24:14,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=993, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1078, PETRI_PLACES=242, PETRI_TRANSITIONS=146} [2024-06-03 22:24:14,125 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 211 predicate places. [2024-06-03 22:24:14,125 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 146 transitions, 1078 flow [2024-06-03 22:24:14,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:14,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:14,125 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:24:14,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-03 22:24:14,126 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:24:14,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:14,126 INFO L85 PathProgramCache]: Analyzing trace with hash -993076218, now seen corresponding path program 10 times [2024-06-03 22:24:14,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:14,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746037547] [2024-06-03 22:24:14,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:14,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:19,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:24:19,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:19,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746037547] [2024-06-03 22:24:19,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746037547] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:19,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:19,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:24:19,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932436502] [2024-06-03 22:24:19,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:19,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:24:19,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:19,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:24:19,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:24:19,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:24:19,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 146 transitions, 1078 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:19,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:19,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:24:19,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:19,906 INFO L124 PetriNetUnfolderBase]: 484/979 cut-off events. [2024-06-03 22:24:19,907 INFO L125 PetriNetUnfolderBase]: For 178735/178735 co-relation queries the response was YES. [2024-06-03 22:24:19,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5983 conditions, 979 events. 484/979 cut-off events. For 178735/178735 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5316 event pairs, 123 based on Foata normal form. 8/985 useless extension candidates. Maximal degree in co-relation 5865. Up to 518 conditions per place. [2024-06-03 22:24:19,915 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 104 selfloop transitions, 57 changer transitions 11/174 dead transitions. [2024-06-03 22:24:19,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 174 transitions, 1690 flow [2024-06-03 22:24:19,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-03 22:24:19,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-03 22:24:19,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 143 transitions. [2024-06-03 22:24:19,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-03 22:24:19,916 INFO L175 Difference]: Start difference. First operand has 242 places, 146 transitions, 1078 flow. Second operand 13 states and 143 transitions. [2024-06-03 22:24:19,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 174 transitions, 1690 flow [2024-06-03 22:24:20,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 174 transitions, 1555 flow, removed 10 selfloop flow, removed 14 redundant places. [2024-06-03 22:24:20,230 INFO L231 Difference]: Finished difference. Result has 236 places, 141 transitions, 1039 flow [2024-06-03 22:24:20,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=953, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1039, PETRI_PLACES=236, PETRI_TRANSITIONS=141} [2024-06-03 22:24:20,230 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 205 predicate places. [2024-06-03 22:24:20,230 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 141 transitions, 1039 flow [2024-06-03 22:24:20,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:20,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:20,231 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:20,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-03 22:24:20,231 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:24:20,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:20,231 INFO L85 PathProgramCache]: Analyzing trace with hash -380780201, now seen corresponding path program 1 times [2024-06-03 22:24:20,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:20,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593515990] [2024-06-03 22:24:20,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:20,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:25,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:24:25,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:25,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593515990] [2024-06-03 22:24:25,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593515990] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:25,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:25,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:24:25,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498436471] [2024-06-03 22:24:25,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:25,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:24:25,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:25,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:24:25,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:24:25,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:24:25,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 141 transitions, 1039 flow. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:25,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:25,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:24:25,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:26,130 INFO L124 PetriNetUnfolderBase]: 466/941 cut-off events. [2024-06-03 22:24:26,130 INFO L125 PetriNetUnfolderBase]: For 155650/155650 co-relation queries the response was YES. [2024-06-03 22:24:26,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5741 conditions, 941 events. 466/941 cut-off events. For 155650/155650 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5005 event pairs, 133 based on Foata normal form. 6/945 useless extension candidates. Maximal degree in co-relation 5627. Up to 831 conditions per place. [2024-06-03 22:24:26,138 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 134 selfloop transitions, 8 changer transitions 23/167 dead transitions. [2024-06-03 22:24:26,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 167 transitions, 1431 flow [2024-06-03 22:24:26,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:24:26,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:24:26,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 119 transitions. [2024-06-03 22:24:26,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3098958333333333 [2024-06-03 22:24:26,139 INFO L175 Difference]: Start difference. First operand has 236 places, 141 transitions, 1039 flow. Second operand 12 states and 119 transitions. [2024-06-03 22:24:26,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 167 transitions, 1431 flow [2024-06-03 22:24:26,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 167 transitions, 1282 flow, removed 6 selfloop flow, removed 13 redundant places. [2024-06-03 22:24:26,418 INFO L231 Difference]: Finished difference. Result has 230 places, 135 transitions, 879 flow [2024-06-03 22:24:26,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=879, PETRI_PLACES=230, PETRI_TRANSITIONS=135} [2024-06-03 22:24:26,420 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 199 predicate places. [2024-06-03 22:24:26,420 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 135 transitions, 879 flow [2024-06-03 22:24:26,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:26,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:26,420 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,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-03 22:24:26,420 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:24:26,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:26,436 INFO L85 PathProgramCache]: Analyzing trace with hash -332378057, now seen corresponding path program 2 times [2024-06-03 22:24:26,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:26,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874413622] [2024-06-03 22:24:26,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:26,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:31,416 INFO 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,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:31,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874413622] [2024-06-03 22:24:31,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874413622] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:31,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:31,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:24:31,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107577738] [2024-06-03 22:24:31,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:31,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:24:31,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:31,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:24:31,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:24:31,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:24:31,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 135 transitions, 879 flow. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:31,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:31,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:24:31,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:31,858 INFO L124 PetriNetUnfolderBase]: 438/887 cut-off events. [2024-06-03 22:24:31,858 INFO L125 PetriNetUnfolderBase]: For 145623/145623 co-relation queries the response was YES. [2024-06-03 22:24:31,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5291 conditions, 887 events. 438/887 cut-off events. For 145623/145623 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4665 event pairs, 76 based on Foata normal form. 6/891 useless extension candidates. Maximal degree in co-relation 5180. Up to 278 conditions per place. [2024-06-03 22:24:31,865 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 75 selfloop transitions, 54 changer transitions 22/153 dead transitions. [2024-06-03 22:24:31,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 153 transitions, 1221 flow [2024-06-03 22:24:31,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:24:31,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:24:31,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2024-06-03 22:24:31,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29829545454545453 [2024-06-03 22:24:31,866 INFO L175 Difference]: Start difference. First operand has 230 places, 135 transitions, 879 flow. Second operand 11 states and 105 transitions. [2024-06-03 22:24:31,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 153 transitions, 1221 flow [2024-06-03 22:24:32,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 153 transitions, 1193 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-03 22:24:32,102 INFO L231 Difference]: Finished difference. Result has 219 places, 123 transitions, 897 flow [2024-06-03 22:24:32,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=851, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=897, PETRI_PLACES=219, PETRI_TRANSITIONS=123} [2024-06-03 22:24:32,103 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 188 predicate places. [2024-06-03 22:24:32,103 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 123 transitions, 897 flow [2024-06-03 22:24:32,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:32,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:32,128 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,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-03 22:24:32,128 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:24:32,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:32,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1701567083, now seen corresponding path program 3 times [2024-06-03 22:24:32,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:32,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540384937] [2024-06-03 22:24:32,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:32,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:37,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:37,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:37,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540384937] [2024-06-03 22:24:37,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540384937] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:37,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:37,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:24:37,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491836004] [2024-06-03 22:24:37,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:37,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:24:37,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:37,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:24:37,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:24:37,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:24:37,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 123 transitions, 897 flow. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:37,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:37,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:24:37,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:38,166 INFO L124 PetriNetUnfolderBase]: 396/813 cut-off events. [2024-06-03 22:24:38,166 INFO L125 PetriNetUnfolderBase]: For 130074/130074 co-relation queries the response was YES. [2024-06-03 22:24:38,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5059 conditions, 813 events. 396/813 cut-off events. For 130074/130074 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4219 event pairs, 111 based on Foata normal form. 6/817 useless extension candidates. Maximal degree in co-relation 4953. Up to 687 conditions per place. [2024-06-03 22:24:38,172 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 117 selfloop transitions, 17 changer transitions 10/146 dead transitions. [2024-06-03 22:24:38,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 146 transitions, 1243 flow [2024-06-03 22:24:38,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:24:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:24:38,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 118 transitions. [2024-06-03 22:24:38,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3072916666666667 [2024-06-03 22:24:38,174 INFO L175 Difference]: Start difference. First operand has 219 places, 123 transitions, 897 flow. Second operand 12 states and 118 transitions. [2024-06-03 22:24:38,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 146 transitions, 1243 flow [2024-06-03 22:24:38,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 146 transitions, 1117 flow, removed 9 selfloop flow, removed 15 redundant places. [2024-06-03 22:24:38,334 INFO L231 Difference]: Finished difference. Result has 204 places, 119 transitions, 784 flow [2024-06-03 22:24:38,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=784, PETRI_PLACES=204, PETRI_TRANSITIONS=119} [2024-06-03 22:24:38,335 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 173 predicate places. [2024-06-03 22:24:38,335 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 119 transitions, 784 flow [2024-06-03 22:24:38,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:38,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:38,335 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:38,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-03 22:24:38,335 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:24:38,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:38,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1048378739, now seen corresponding path program 4 times [2024-06-03 22:24:38,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:38,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315036582] [2024-06-03 22:24:38,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:38,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:43,803 INFO 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:43,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:43,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315036582] [2024-06-03 22:24:43,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315036582] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:43,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:43,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:24:43,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803585165] [2024-06-03 22:24:43,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:43,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:24:43,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:43,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:24:43,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:24:43,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:24:43,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 119 transitions, 784 flow. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:43,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:43,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:24:43,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:44,285 INFO L124 PetriNetUnfolderBase]: 384/793 cut-off events. [2024-06-03 22:24:44,286 INFO L125 PetriNetUnfolderBase]: For 106581/106581 co-relation queries the response was YES. [2024-06-03 22:24:44,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4640 conditions, 793 events. 384/793 cut-off events. For 106581/106581 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4092 event pairs, 113 based on Foata normal form. 6/797 useless extension candidates. Maximal degree in co-relation 4542. Up to 683 conditions per place. [2024-06-03 22:24:44,292 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 111 selfloop transitions, 12 changer transitions 17/142 dead transitions. [2024-06-03 22:24:44,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 142 transitions, 1124 flow [2024-06-03 22:24:44,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:24:44,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:24:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 116 transitions. [2024-06-03 22:24:44,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3020833333333333 [2024-06-03 22:24:44,293 INFO L175 Difference]: Start difference. First operand has 204 places, 119 transitions, 784 flow. Second operand 12 states and 116 transitions. [2024-06-03 22:24:44,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 142 transitions, 1124 flow [2024-06-03 22:24:44,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 142 transitions, 1084 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-03 22:24:44,454 INFO L231 Difference]: Finished difference. Result has 200 places, 112 transitions, 719 flow [2024-06-03 22:24:44,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=719, PETRI_PLACES=200, PETRI_TRANSITIONS=112} [2024-06-03 22:24:44,454 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 169 predicate places. [2024-06-03 22:24:44,454 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 112 transitions, 719 flow [2024-06-03 22:24:44,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:44,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:44,455 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:44,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-03 22:24:44,455 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:24:44,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:44,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1053020369, now seen corresponding path program 5 times [2024-06-03 22:24:44,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:44,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395546534] [2024-06-03 22:24:44,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:44,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:49,524 INFO 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:49,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:49,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395546534] [2024-06-03 22:24:49,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395546534] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:49,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:49,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:24:49,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100943640] [2024-06-03 22:24:49,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:49,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:24:49,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:49,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:24:49,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:24:49,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:24:49,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 112 transitions, 719 flow. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:49,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:49,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:24:49,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:50,012 INFO L124 PetriNetUnfolderBase]: 366/759 cut-off events. [2024-06-03 22:24:50,012 INFO L125 PetriNetUnfolderBase]: For 101233/101233 co-relation queries the response was YES. [2024-06-03 22:24:50,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4440 conditions, 759 events. 366/759 cut-off events. For 101233/101233 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3887 event pairs, 91 based on Foata normal form. 6/763 useless extension candidates. Maximal degree in co-relation 4357. Up to 340 conditions per place. [2024-06-03 22:24:50,016 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 64 selfloop transitions, 37 changer transitions 27/130 dead transitions. [2024-06-03 22:24:50,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 130 transitions, 1017 flow [2024-06-03 22:24:50,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:24:50,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:24:50,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 111 transitions. [2024-06-03 22:24:50,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3153409090909091 [2024-06-03 22:24:50,018 INFO L175 Difference]: Start difference. First operand has 200 places, 112 transitions, 719 flow. Second operand 11 states and 111 transitions. [2024-06-03 22:24:50,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 130 transitions, 1017 flow [2024-06-03 22:24:50,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 130 transitions, 985 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-03 22:24:50,173 INFO L231 Difference]: Finished difference. Result has 191 places, 93 transitions, 650 flow [2024-06-03 22:24:50,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=650, PETRI_PLACES=191, PETRI_TRANSITIONS=93} [2024-06-03 22:24:50,173 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 160 predicate places. [2024-06-03 22:24:50,173 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 93 transitions, 650 flow [2024-06-03 22:24:50,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:50,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:50,174 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:50,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-03 22:24:50,174 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:24:50,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:50,174 INFO L85 PathProgramCache]: Analyzing trace with hash 541929835, now seen corresponding path program 6 times [2024-06-03 22:24:50,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:50,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993724874] [2024-06-03 22:24:50,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:50,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:55,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:55,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:55,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993724874] [2024-06-03 22:24:55,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993724874] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:55,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:55,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:24:55,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110012201] [2024-06-03 22:24:55,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:55,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:24:55,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:55,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:24:55,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:24:55,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:24:55,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 93 transitions, 650 flow. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:55,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:55,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:24:55,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:55,614 INFO L124 PetriNetUnfolderBase]: 291/608 cut-off events. [2024-06-03 22:24:55,614 INFO L125 PetriNetUnfolderBase]: For 77696/77696 co-relation queries the response was YES. [2024-06-03 22:24:55,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3549 conditions, 608 events. 291/608 cut-off events. For 77696/77696 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2933 event pairs, 76 based on Foata normal form. 6/612 useless extension candidates. Maximal degree in co-relation 3469. Up to 333 conditions per place. [2024-06-03 22:24:55,619 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 60 selfloop transitions, 30 changer transitions 19/111 dead transitions. [2024-06-03 22:24:55,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 111 transitions, 914 flow [2024-06-03 22:24:55,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:24:55,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:24:55,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2024-06-03 22:24:55,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3125 [2024-06-03 22:24:55,620 INFO L175 Difference]: Start difference. First operand has 191 places, 93 transitions, 650 flow. Second operand 11 states and 110 transitions. [2024-06-03 22:24:55,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 111 transitions, 914 flow [2024-06-03 22:24:55,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 111 transitions, 804 flow, removed 17 selfloop flow, removed 22 redundant places. [2024-06-03 22:24:55,728 INFO L231 Difference]: Finished difference. Result has 162 places, 81 transitions, 550 flow [2024-06-03 22:24:55,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=550, PETRI_PLACES=162, PETRI_TRANSITIONS=81} [2024-06-03 22:24:55,728 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 131 predicate places. [2024-06-03 22:24:55,729 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 81 transitions, 550 flow [2024-06-03 22:24:55,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:55,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:55,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] [2024-06-03 22:24:55,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-03 22:24:55,729 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:24:55,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:55,730 INFO L85 PathProgramCache]: Analyzing trace with hash 313855705, now seen corresponding path program 7 times [2024-06-03 22:24:55,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:55,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527625858] [2024-06-03 22:24:55,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:55,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:00,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:25:00,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:00,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527625858] [2024-06-03 22:25:00,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527625858] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:00,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:00,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:25:00,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334835298] [2024-06-03 22:25:00,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:00,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:25:00,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:00,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:25:00,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:25:01,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:25:01,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 81 transitions, 550 flow. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:01,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:01,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:25:01,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:01,391 INFO L124 PetriNetUnfolderBase]: 253/538 cut-off events. [2024-06-03 22:25:01,391 INFO L125 PetriNetUnfolderBase]: For 53934/53934 co-relation queries the response was YES. [2024-06-03 22:25:01,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2985 conditions, 538 events. 253/538 cut-off events. For 53934/53934 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2495 event pairs, 70 based on Foata normal form. 6/542 useless extension candidates. Maximal degree in co-relation 2918. Up to 279 conditions per place. [2024-06-03 22:25:01,395 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 44 selfloop transitions, 18 changer transitions 35/99 dead transitions. [2024-06-03 22:25:01,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 99 transitions, 784 flow [2024-06-03 22:25:01,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:25:01,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:25:01,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 108 transitions. [2024-06-03 22:25:01,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3068181818181818 [2024-06-03 22:25:01,396 INFO L175 Difference]: Start difference. First operand has 162 places, 81 transitions, 550 flow. Second operand 11 states and 108 transitions. [2024-06-03 22:25:01,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 99 transitions, 784 flow [2024-06-03 22:25:01,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 99 transitions, 706 flow, removed 9 selfloop flow, removed 17 redundant places. [2024-06-03 22:25:01,454 INFO L231 Difference]: Finished difference. Result has 146 places, 60 transitions, 401 flow [2024-06-03 22:25:01,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=401, PETRI_PLACES=146, PETRI_TRANSITIONS=60} [2024-06-03 22:25:01,455 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 115 predicate places. [2024-06-03 22:25:01,455 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 60 transitions, 401 flow [2024-06-03 22:25:01,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:01,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:01,455 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:01,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-03 22:25:01,455 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:25:01,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:01,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1728994633, now seen corresponding path program 8 times [2024-06-03 22:25:01,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:01,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387709634] [2024-06-03 22:25:01,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:01,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:07,240 INFO 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,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:07,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387709634] [2024-06-03 22:25:07,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387709634] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:07,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:07,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-06-03 22:25:07,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836446944] [2024-06-03 22:25:07,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:07,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-03 22:25:07,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:07,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-03 22:25:07,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-06-03 22:25:07,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:25:07,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 60 transitions, 401 flow. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:07,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:07,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:25:07,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:07,729 INFO L124 PetriNetUnfolderBase]: 186/400 cut-off events. [2024-06-03 22:25:07,729 INFO L125 PetriNetUnfolderBase]: For 40418/40418 co-relation queries the response was YES. [2024-06-03 22:25:07,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2356 conditions, 400 events. 186/400 cut-off events. For 40418/40418 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1751 event pairs, 68 based on Foata normal form. 6/405 useless extension candidates. Maximal degree in co-relation 2297. Up to 263 conditions per place. [2024-06-03 22:25:07,732 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 44 selfloop transitions, 18 changer transitions 12/76 dead transitions. [2024-06-03 22:25:07,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 76 transitions, 583 flow [2024-06-03 22:25:07,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:25:07,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:25:07,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 110 transitions. [2024-06-03 22:25:07,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2864583333333333 [2024-06-03 22:25:07,733 INFO L175 Difference]: Start difference. First operand has 146 places, 60 transitions, 401 flow. Second operand 12 states and 110 transitions. [2024-06-03 22:25:07,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 76 transitions, 583 flow [2024-06-03 22:25:07,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 76 transitions, 499 flow, removed 15 selfloop flow, removed 25 redundant places. [2024-06-03 22:25:07,760 INFO L231 Difference]: Finished difference. Result has 115 places, 56 transitions, 336 flow [2024-06-03 22:25:07,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=336, PETRI_PLACES=115, PETRI_TRANSITIONS=56} [2024-06-03 22:25:07,760 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 84 predicate places. [2024-06-03 22:25:07,760 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 56 transitions, 336 flow [2024-06-03 22:25:07,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:07,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:07,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:25:07,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-03 22:25:07,761 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:25:07,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:07,761 INFO L85 PathProgramCache]: Analyzing trace with hash -383892851, now seen corresponding path program 9 times [2024-06-03 22:25:07,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:07,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164774726] [2024-06-03 22:25:07,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:07,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:12,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:25:12,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:12,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164774726] [2024-06-03 22:25:12,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164774726] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:12,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:12,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:25:12,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321613703] [2024-06-03 22:25:12,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:12,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:25:12,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:12,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:25:12,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:25:13,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:25:13,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 56 transitions, 336 flow. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:13,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:13,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:25:13,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:13,543 INFO L124 PetriNetUnfolderBase]: 162/348 cut-off events. [2024-06-03 22:25:13,543 INFO L125 PetriNetUnfolderBase]: For 17266/17266 co-relation queries the response was YES. [2024-06-03 22:25:13,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1643 conditions, 348 events. 162/348 cut-off events. For 17266/17266 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1440 event pairs, 55 based on Foata normal form. 6/353 useless extension candidates. Maximal degree in co-relation 1598. Up to 220 conditions per place. [2024-06-03 22:25:13,547 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 41 selfloop transitions, 16 changer transitions 11/70 dead transitions. [2024-06-03 22:25:13,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 70 transitions, 502 flow [2024-06-03 22:25:13,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:25:13,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:25:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 101 transitions. [2024-06-03 22:25:13,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2869318181818182 [2024-06-03 22:25:13,548 INFO L175 Difference]: Start difference. First operand has 115 places, 56 transitions, 336 flow. Second operand 11 states and 101 transitions. [2024-06-03 22:25:13,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 70 transitions, 502 flow [2024-06-03 22:25:13,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 70 transitions, 458 flow, removed 4 selfloop flow, removed 12 redundant places. [2024-06-03 22:25:13,560 INFO L231 Difference]: Finished difference. Result has 108 places, 53 transitions, 312 flow [2024-06-03 22:25:13,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=312, PETRI_PLACES=108, PETRI_TRANSITIONS=53} [2024-06-03 22:25:13,560 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 77 predicate places. [2024-06-03 22:25:13,560 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 53 transitions, 312 flow [2024-06-03 22:25:13,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:13,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:13,561 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:13,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-03 22:25:13,561 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:25:13,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:13,561 INFO L85 PathProgramCache]: Analyzing trace with hash -384065831, now seen corresponding path program 10 times [2024-06-03 22:25:13,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:13,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483247494] [2024-06-03 22:25:13,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:13,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:18,923 INFO 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:18,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:18,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483247494] [2024-06-03 22:25:18,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483247494] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:18,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:18,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:25:18,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927636573] [2024-06-03 22:25:18,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:18,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:25:18,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:18,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:25:18,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:25:19,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:25:19,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 53 transitions, 312 flow. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:19,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:19,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:25:19,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:19,407 INFO L124 PetriNetUnfolderBase]: 152/330 cut-off events. [2024-06-03 22:25:19,408 INFO L125 PetriNetUnfolderBase]: For 14677/14677 co-relation queries the response was YES. [2024-06-03 22:25:19,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1530 conditions, 330 events. 152/330 cut-off events. For 14677/14677 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1336 event pairs, 51 based on Foata normal form. 6/335 useless extension candidates. Maximal degree in co-relation 1488. Up to 196 conditions per place. [2024-06-03 22:25:19,409 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 39 selfloop transitions, 15 changer transitions 11/67 dead transitions. [2024-06-03 22:25:19,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 67 transitions, 472 flow [2024-06-03 22:25:19,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:25:19,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:25:19,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 101 transitions. [2024-06-03 22:25:19,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2869318181818182 [2024-06-03 22:25:19,410 INFO L175 Difference]: Start difference. First operand has 108 places, 53 transitions, 312 flow. Second operand 11 states and 101 transitions. [2024-06-03 22:25:19,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 67 transitions, 472 flow [2024-06-03 22:25:19,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 67 transitions, 434 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-03 22:25:19,421 INFO L231 Difference]: Finished difference. Result has 103 places, 48 transitions, 283 flow [2024-06-03 22:25:19,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=283, PETRI_PLACES=103, PETRI_TRANSITIONS=48} [2024-06-03 22:25:19,422 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 72 predicate places. [2024-06-03 22:25:19,422 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 48 transitions, 283 flow [2024-06-03 22:25:19,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:19,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:19,422 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:19,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-03 22:25:19,423 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:25:19,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:19,423 INFO L85 PathProgramCache]: Analyzing trace with hash 871556587, now seen corresponding path program 11 times [2024-06-03 22:25:19,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:19,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249986231] [2024-06-03 22:25:19,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:19,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:24,925 INFO 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:24,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:24,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249986231] [2024-06-03 22:25:24,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249986231] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:24,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:24,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-03 22:25:24,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496929754] [2024-06-03 22:25:24,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:24,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 22:25:24,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:24,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 22:25:24,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-03 22:25:25,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:25:25,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 48 transitions, 283 flow. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:25,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:25,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:25:25,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:25,239 INFO L124 PetriNetUnfolderBase]: 124/270 cut-off events. [2024-06-03 22:25:25,239 INFO L125 PetriNetUnfolderBase]: For 9774/9774 co-relation queries the response was YES. [2024-06-03 22:25:25,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 270 events. 124/270 cut-off events. For 9774/9774 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 996 event pairs, 40 based on Foata normal form. 6/275 useless extension candidates. Maximal degree in co-relation 1110. Up to 159 conditions per place. [2024-06-03 22:25:25,241 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 32 selfloop transitions, 11 changer transitions 17/62 dead transitions. [2024-06-03 22:25:25,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 62 transitions, 433 flow [2024-06-03 22:25:25,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:25:25,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:25:25,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 104 transitions. [2024-06-03 22:25:25,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2708333333333333 [2024-06-03 22:25:25,242 INFO L175 Difference]: Start difference. First operand has 103 places, 48 transitions, 283 flow. Second operand 12 states and 104 transitions. [2024-06-03 22:25:25,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 62 transitions, 433 flow [2024-06-03 22:25:25,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 62 transitions, 393 flow, removed 5 selfloop flow, removed 13 redundant places. [2024-06-03 22:25:25,249 INFO L231 Difference]: Finished difference. Result has 96 places, 42 transitions, 238 flow [2024-06-03 22:25:25,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=238, PETRI_PLACES=96, PETRI_TRANSITIONS=42} [2024-06-03 22:25:25,249 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 65 predicate places. [2024-06-03 22:25:25,250 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 42 transitions, 238 flow [2024-06-03 22:25:25,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:25,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:25,250 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:25,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-03 22:25:25,250 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:25:25,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:25,251 INFO L85 PathProgramCache]: Analyzing trace with hash -815865527, now seen corresponding path program 12 times [2024-06-03 22:25:25,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:25,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16678339] [2024-06-03 22:25:25,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:25,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:30,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:30,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16678339] [2024-06-03 22:25:30,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16678339] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:30,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:30,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:25:30,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652357763] [2024-06-03 22:25:30,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:30,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:25:30,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:30,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:25:30,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:25:30,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:25:30,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 42 transitions, 238 flow. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:30,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:30,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:25:30,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:30,553 INFO L124 PetriNetUnfolderBase]: 98/212 cut-off events. [2024-06-03 22:25:30,553 INFO L125 PetriNetUnfolderBase]: For 5044/5044 co-relation queries the response was YES. [2024-06-03 22:25:30,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 212 events. 98/212 cut-off events. For 5044/5044 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 704 event pairs, 21 based on Foata normal form. 6/217 useless extension candidates. Maximal degree in co-relation 734. Up to 96 conditions per place. [2024-06-03 22:25:30,554 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 26 selfloop transitions, 9 changer transitions 18/55 dead transitions. [2024-06-03 22:25:30,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 55 transitions, 372 flow [2024-06-03 22:25:30,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:25:30,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:25:30,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2024-06-03 22:25:30,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2875 [2024-06-03 22:25:30,555 INFO L175 Difference]: Start difference. First operand has 96 places, 42 transitions, 238 flow. Second operand 10 states and 92 transitions. [2024-06-03 22:25:30,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 55 transitions, 372 flow [2024-06-03 22:25:30,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 55 transitions, 338 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-03 22:25:30,579 INFO L231 Difference]: Finished difference. Result has 82 places, 32 transitions, 177 flow [2024-06-03 22:25:30,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=177, PETRI_PLACES=82, PETRI_TRANSITIONS=32} [2024-06-03 22:25:30,580 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 51 predicate places. [2024-06-03 22:25:30,580 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 32 transitions, 177 flow [2024-06-03 22:25:30,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:30,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:30,580 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:30,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-03 22:25:30,580 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:25:30,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:30,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1043939657, now seen corresponding path program 13 times [2024-06-03 22:25:30,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:30,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682942356] [2024-06-03 22:25:30,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:30,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:35,745 INFO 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:35,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:35,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682942356] [2024-06-03 22:25:35,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682942356] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:35,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:35,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:25:35,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299367035] [2024-06-03 22:25:35,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:35,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:25:35,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:35,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:25:35,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:25:35,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:25:35,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 32 transitions, 177 flow. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:35,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:35,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:25:35,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:36,116 INFO L124 PetriNetUnfolderBase]: 69/157 cut-off events. [2024-06-03 22:25:36,117 INFO L125 PetriNetUnfolderBase]: For 3450/3450 co-relation queries the response was YES. [2024-06-03 22:25:36,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 157 events. 69/157 cut-off events. For 3450/3450 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 447 event pairs, 17 based on Foata normal form. 6/162 useless extension candidates. Maximal degree in co-relation 548. Up to 60 conditions per place. [2024-06-03 22:25:36,118 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 19 selfloop transitions, 5 changer transitions 19/45 dead transitions. [2024-06-03 22:25:36,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 45 transitions, 291 flow [2024-06-03 22:25:36,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:25:36,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:25:36,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 90 transitions. [2024-06-03 22:25:36,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28125 [2024-06-03 22:25:36,119 INFO L175 Difference]: Start difference. First operand has 82 places, 32 transitions, 177 flow. Second operand 10 states and 90 transitions. [2024-06-03 22:25:36,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 45 transitions, 291 flow [2024-06-03 22:25:36,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 45 transitions, 257 flow, removed 8 selfloop flow, removed 14 redundant places. [2024-06-03 22:25:36,121 INFO L231 Difference]: Finished difference. Result has 67 places, 23 transitions, 116 flow [2024-06-03 22:25:36,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=116, PETRI_PLACES=67, PETRI_TRANSITIONS=23} [2024-06-03 22:25:36,122 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 36 predicate places. [2024-06-03 22:25:36,122 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 23 transitions, 116 flow [2024-06-03 22:25:36,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:36,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:36,122 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:36,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-03 22:25:36,122 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:25:36,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:36,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1363170795, now seen corresponding path program 14 times [2024-06-03 22:25:36,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:36,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936001998] [2024-06-03 22:25:36,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:36,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:41,459 INFO 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,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:41,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936001998] [2024-06-03 22:25:41,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936001998] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:41,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:41,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:25:41,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427524787] [2024-06-03 22:25:41,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:41,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:25:41,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:41,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:25:41,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:25:41,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-03 22:25:41,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 23 transitions, 116 flow. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:41,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:41,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-03 22:25:41,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:41,838 INFO L124 PetriNetUnfolderBase]: 27/71 cut-off events. [2024-06-03 22:25:41,838 INFO L125 PetriNetUnfolderBase]: For 870/870 co-relation queries the response was YES. [2024-06-03 22:25:41,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 71 events. 27/71 cut-off events. For 870/870 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 107 event pairs, 0 based on Foata normal form. 6/76 useless extension candidates. Maximal degree in co-relation 182. Up to 24 conditions per place. [2024-06-03 22:25:41,839 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 0 selfloop transitions, 0 changer transitions 31/31 dead transitions. [2024-06-03 22:25:41,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 31 transitions, 156 flow [2024-06-03 22:25:41,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:25:41,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:25:41,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2024-06-03 22:25:41,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25 [2024-06-03 22:25:41,840 INFO L175 Difference]: Start difference. First operand has 67 places, 23 transitions, 116 flow. Second operand 10 states and 80 transitions. [2024-06-03 22:25:41,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 31 transitions, 156 flow [2024-06-03 22:25:41,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 31 transitions, 126 flow, removed 1 selfloop flow, removed 15 redundant places. [2024-06-03 22:25:41,840 INFO L231 Difference]: Finished difference. Result has 49 places, 0 transitions, 0 flow [2024-06-03 22:25:41,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=0, PETRI_PLACES=49, PETRI_TRANSITIONS=0} [2024-06-03 22:25:41,841 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2024-06-03 22:25:41,841 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 0 transitions, 0 flow [2024-06-03 22:25:41,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:41,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-03 22:25:41,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-03 22:25:41,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-03 22:25:41,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-03 22:25:41,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-06-03 22:25:41,844 INFO L445 BasicCegarLoop]: Path program histogram: [24, 14, 14, 11, 10, 7, 6, 5, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:41,846 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-03 22:25:41,846 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-03 22:25:41,854 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-03 22:25:41,854 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-03 22:25:41,855 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.06 10:25:41 BasicIcfg [2024-06-03 22:25:41,855 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-03 22:25:41,855 INFO L158 Benchmark]: Toolchain (without parser) took 653717.43ms. Allocated memory was 159.4MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 77.1MB in the beginning and 938.1MB in the end (delta: -861.1MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-06-03 22:25:41,855 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 110.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 22:25:41,856 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 85.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 22:25:41,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 689.55ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 76.9MB in the beginning and 141.9MB in the end (delta: -65.0MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2024-06-03 22:25:41,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.43ms. Allocated memory is still 213.9MB. Free memory was 141.9MB in the beginning and 127.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-06-03 22:25:41,856 INFO L158 Benchmark]: Boogie Preprocessor took 125.06ms. Allocated memory is still 213.9MB. Free memory was 127.2MB in the beginning and 119.9MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-03 22:25:41,856 INFO L158 Benchmark]: RCFGBuilder took 995.93ms. Allocated memory is still 213.9MB. Free memory was 119.9MB in the beginning and 153.9MB in the end (delta: -34.1MB). Peak memory consumption was 92.8MB. Max. memory is 16.1GB. [2024-06-03 22:25:41,857 INFO L158 Benchmark]: TraceAbstraction took 651801.93ms. Allocated memory was 213.9MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 152.9MB in the beginning and 938.1MB in the end (delta: -785.2MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-06-03 22:25:41,857 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 110.4MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 85.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 689.55ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 76.9MB in the beginning and 141.9MB in the end (delta: -65.0MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.43ms. Allocated memory is still 213.9MB. Free memory was 141.9MB in the beginning and 127.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 125.06ms. Allocated memory is still 213.9MB. Free memory was 127.2MB in the beginning and 119.9MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 995.93ms. Allocated memory is still 213.9MB. Free memory was 119.9MB in the beginning and 153.9MB in the end (delta: -34.1MB). Peak memory consumption was 92.8MB. Max. memory is 16.1GB. * TraceAbstraction took 651801.93ms. Allocated memory was 213.9MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 152.9MB in the beginning and 938.1MB in the end (delta: -785.2MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 803]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 804]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 51 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 651.7s, OverallIterations: 127, TraceHistogramMax: 1, PathProgramHistogramMax: 24, EmptinessCheckTime: 0.0s, AutomataDifference: 69.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7216 SdHoareTripleChecker+Valid, 34.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6194 mSDsluCounter, 4182 SdHoareTripleChecker+Invalid, 30.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3470 mSDsCounter, 1435 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43115 IncrementalHoareTripleChecker+Invalid, 44550 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1435 mSolverCounterUnsat, 712 mSDtfsCounter, 43115 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1386 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1360 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2543 ImplicationChecksByTransitivity, 33.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1557occurred in iteration=57, InterpolantAutomatonStates: 1267, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 577.0s InterpolantComputationTime, 2191 NumberOfCodeBlocks, 2191 NumberOfCodeBlocksAsserted, 127 NumberOfCheckSat, 2064 ConstructedInterpolants, 0 QuantifiedInterpolants, 98669 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 127 InterpolantComputations, 127 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-03 22:25:41,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE