./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe029_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/safe029_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/safe029_power.opt_pso.opt_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe029_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:43:36,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 22:43:37,075 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 22:43:37,081 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 22:43:37,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 22:43:37,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 22:43:37,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 22:43:37,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 22:43:37,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 22:43:37,110 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 22:43:37,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 22:43:37,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 22:43:37,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 22:43:37,112 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 22:43:37,112 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 22:43:37,112 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 22:43:37,112 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 22:43:37,113 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 22:43:37,113 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 22:43:37,113 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 22:43:37,113 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 22:43:37,114 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 22:43:37,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 22:43:37,115 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 22:43:37,115 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 22:43:37,115 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 22:43:37,115 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 22:43:37,116 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 22:43:37,116 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 22:43:37,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 22:43:37,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 22:43:37,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 22:43:37,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:43:37,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 22:43:37,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 22:43:37,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 22:43:37,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 22:43:37,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 22:43:37,118 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 22:43:37,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 22:43:37,119 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 22:43:37,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 22:43:37,119 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 22:43:37,119 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:43:37,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 22:43:37,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 22:43:37,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 22:43:37,370 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 22:43:37,384 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 22:43:37,385 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/safe029_power.opt_pso.opt_rmo.opt.yml/witness.yml [2024-06-03 22:43:37,505 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 22:43:37,505 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 22:43:37,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2024-06-03 22:43:38,511 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 22:43:38,694 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 22:43:38,694 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2024-06-03 22:43:38,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f7df147d/cea36e4a488c46efb6ba1ee94028f63e/FLAGef3a3103a [2024-06-03 22:43:38,714 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f7df147d/cea36e4a488c46efb6ba1ee94028f63e [2024-06-03 22:43:38,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 22:43:38,715 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 22:43:38,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 22:43:38,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 22:43:38,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 22:43:38,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:43:37" (1/2) ... [2024-06-03 22:43:38,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64862efe and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:43:38, skipping insertion in model container [2024-06-03 22:43:38,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:43:37" (1/2) ... [2024-06-03 22:43:38,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@572446c6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:43:38, skipping insertion in model container [2024-06-03 22:43:38,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:43:38" (2/2) ... [2024-06-03 22:43:38,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64862efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:43:38, skipping insertion in model container [2024-06-03 22:43:38,723 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:43:38" (2/2) ... [2024-06-03 22:43:38,723 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 22:43:38,770 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 22:43:38,771 INFO L97 edCorrectnessWitness]: Location invariant before [L794-L794] (((((((((((((! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 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 )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 )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 )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 )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 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)) && ((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 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-03 22:43:38,772 INFO L97 edCorrectnessWitness]: Location invariant before [L793-L793] (((((((((((((! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 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 )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 )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 )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 )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 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)) && ((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 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-03 22:43:38,772 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 22:43:38,772 INFO L106 edCorrectnessWitness]: ghost_update [L791-L791] multithreaded = 1; [2024-06-03 22:43:38,807 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 22:43:39,128 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:43:39,135 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 22:43:39,325 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:43:39,351 INFO L206 MainTranslator]: Completed translation [2024-06-03 22:43:39,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:43:39 WrapperNode [2024-06-03 22:43:39,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 22:43:39,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 22:43:39,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 22:43:39,353 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 22:43:39,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:43:39" (1/1) ... [2024-06-03 22:43:39,376 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:43:39" (1/1) ... [2024-06-03 22:43:39,465 INFO L138 Inliner]: procedures = 174, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 130 [2024-06-03 22:43:39,466 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 22:43:39,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 22:43:39,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 22:43:39,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 22:43:39,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:43:39" (1/1) ... [2024-06-03 22:43:39,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:43:39" (1/1) ... [2024-06-03 22:43:39,492 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:43:39" (1/1) ... [2024-06-03 22:43:39,516 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:43:39,516 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:43:39" (1/1) ... [2024-06-03 22:43:39,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:43:39" (1/1) ... [2024-06-03 22:43:39,533 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:43:39" (1/1) ... [2024-06-03 22:43:39,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:43:39" (1/1) ... [2024-06-03 22:43:39,539 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:43:39" (1/1) ... [2024-06-03 22:43:39,543 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:43:39" (1/1) ... [2024-06-03 22:43:39,552 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 22:43:39,553 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 22:43:39,553 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 22:43:39,554 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 22:43:39,554 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:43:39" (1/1) ... [2024-06-03 22:43:39,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:43:39,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 22:43:39,581 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:43:39,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 22:43:39,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 22:43:39,611 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 22:43:39,611 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 22:43:39,611 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 22:43:39,611 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 22:43:39,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 22:43:39,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 22:43:39,589 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:43:39,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 22:43:39,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 22:43:39,614 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:43:39,747 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 22:43:39,749 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 22:43:40,318 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 22:43:40,318 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 22:43:40,466 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 22:43:40,466 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 22:43:40,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:43:40 BoogieIcfgContainer [2024-06-03 22:43:40,468 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 22:43:40,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 22:43:40,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 22:43:40,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 22:43:40,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:43:37" (1/4) ... [2024-06-03 22:43:40,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a27e4f8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:43:40, skipping insertion in model container [2024-06-03 22:43:40,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 10:43:38" (2/4) ... [2024-06-03 22:43:40,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a27e4f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:43:40, skipping insertion in model container [2024-06-03 22:43:40,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:43:39" (3/4) ... [2024-06-03 22:43:40,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a27e4f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:43:40, skipping insertion in model container [2024-06-03 22:43:40,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:43:40" (4/4) ... [2024-06-03 22:43:40,477 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2024-06-03 22:43:40,489 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 22:43:40,490 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-03 22:43:40,490 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 22:43:40,560 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 22:43:40,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 68 flow [2024-06-03 22:43:40,614 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-06-03 22:43:40,615 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:43:40,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 28 events. 0/28 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/26 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 22:43:40,616 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 30 transitions, 68 flow [2024-06-03 22:43:40,619 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 50 flow [2024-06-03 22:43:40,629 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 22:43:40,635 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;@301df418, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 22:43:40,635 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-03 22:43:40,647 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 22:43:40,647 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 22:43:40,647 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:43:40,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:43:40,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 22:43:40,649 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:43:40,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:43:40,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1322329521, now seen corresponding path program 1 times [2024-06-03 22:43:40,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:43:40,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168489114] [2024-06-03 22:43:40,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:43:40,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:43:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:43:43,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:43:43,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:43:43,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168489114] [2024-06-03 22:43:43,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168489114] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:43:43,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:43:43,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 22:43:43,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243889310] [2024-06-03 22:43:43,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:43:43,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 22:43:43,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:43:43,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 22:43:43,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 22:43:43,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:43:43,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:43:43,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:43:43,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:43:43,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:43:43,273 INFO L124 PetriNetUnfolderBase]: 162/297 cut-off events. [2024-06-03 22:43:43,274 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-03 22:43:43,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 297 events. 162/297 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1013 event pairs, 97 based on Foata normal form. 1/291 useless extension candidates. Maximal degree in co-relation 596. Up to 288 conditions per place. [2024-06-03 22:43:43,278 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 23 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2024-06-03 22:43:43,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 117 flow [2024-06-03 22:43:43,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 22:43:43,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 22:43:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2024-06-03 22:43:43,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2024-06-03 22:43:43,288 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 50 flow. Second operand 3 states and 46 transitions. [2024-06-03 22:43:43,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 117 flow [2024-06-03 22:43:43,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 22:43:43,291 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 69 flow [2024-06-03 22:43:43,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2024-06-03 22:43:43,295 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2024-06-03 22:43:43,295 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 69 flow [2024-06-03 22:43:43,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:43:43,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:43:43,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:43:43,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 22:43:43,296 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:43:43,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:43:43,297 INFO L85 PathProgramCache]: Analyzing trace with hash -551185454, now seen corresponding path program 1 times [2024-06-03 22:43:43,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:43:43,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350648409] [2024-06-03 22:43:43,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:43:43,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:43:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:43:44,839 INFO 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:43:44,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:43:44,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350648409] [2024-06-03 22:43:44,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350648409] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:43:44,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:43:44,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 22:43:44,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881299537] [2024-06-03 22:43:44,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:43:44,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 22:43:44,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:43:44,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 22:43:44,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-03 22:43:44,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:43:44,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 69 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:43:44,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:43:44,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:43:44,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:43:45,027 INFO L124 PetriNetUnfolderBase]: 159/292 cut-off events. [2024-06-03 22:43:45,028 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-06-03 22:43:45,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 292 events. 159/292 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 991 event pairs, 79 based on Foata normal form. 2/292 useless extension candidates. Maximal degree in co-relation 667. Up to 274 conditions per place. [2024-06-03 22:43:45,033 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 27 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2024-06-03 22:43:45,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 159 flow [2024-06-03 22:43:45,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 22:43:45,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 22:43:45,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2024-06-03 22:43:45,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2024-06-03 22:43:45,036 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 69 flow. Second operand 4 states and 58 transitions. [2024-06-03 22:43:45,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 159 flow [2024-06-03 22:43:45,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 22:43:45,039 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 93 flow [2024-06-03 22:43:45,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2024-06-03 22:43:45,040 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2024-06-03 22:43:45,041 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 93 flow [2024-06-03 22:43:45,041 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:43:45,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:43:45,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:43:45,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 22:43:45,042 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:43:45,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:43:45,045 INFO L85 PathProgramCache]: Analyzing trace with hash 79715222, now seen corresponding path program 1 times [2024-06-03 22:43:45,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:43:45,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537394893] [2024-06-03 22:43:45,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:43:45,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:43:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:43:46,582 INFO 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:43:46,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:43:46,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537394893] [2024-06-03 22:43:46,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537394893] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:43:46,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:43:46,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 22:43:46,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052322547] [2024-06-03 22:43:46,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:43:46,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 22:43:46,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:43:46,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 22:43:46,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-03 22:43:46,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:43:46,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 93 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:43:46,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:43:46,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:43:46,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:43:46,774 INFO L124 PetriNetUnfolderBase]: 153/282 cut-off events. [2024-06-03 22:43:46,775 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2024-06-03 22:43:46,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 282 events. 153/282 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 940 event pairs, 43 based on Foata normal form. 4/284 useless extension candidates. Maximal degree in co-relation 714. Up to 246 conditions per place. [2024-06-03 22:43:46,777 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 32 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2024-06-03 22:43:46,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 211 flow [2024-06-03 22:43:46,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:43:46,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:43:46,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2024-06-03 22:43:46,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2024-06-03 22:43:46,780 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 93 flow. Second operand 5 states and 71 transitions. [2024-06-03 22:43:46,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 41 transitions, 211 flow [2024-06-03 22:43:46,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 202 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-03 22:43:46,783 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 117 flow [2024-06-03 22:43:46,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=117, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2024-06-03 22:43:46,784 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2024-06-03 22:43:46,784 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 117 flow [2024-06-03 22:43:46,785 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:43:46,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:43:46,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:43:46,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 22:43:46,785 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:43:46,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:43:46,786 INFO L85 PathProgramCache]: Analyzing trace with hash -703047979, now seen corresponding path program 1 times [2024-06-03 22:43:46,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:43:46,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380416579] [2024-06-03 22:43:46,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:43:46,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:43:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:43:48,882 INFO 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:43:48,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:43:48,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380416579] [2024-06-03 22:43:48,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380416579] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:43:48,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:43:48,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:43:48,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472644044] [2024-06-03 22:43:48,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:43:48,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:43:48,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:43:48,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:43:48,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:43:48,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:43:48,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 117 flow. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 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:43:48,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:43:48,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:43:48,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:43:49,126 INFO L124 PetriNetUnfolderBase]: 149/274 cut-off events. [2024-06-03 22:43:49,126 INFO L125 PetriNetUnfolderBase]: For 269/269 co-relation queries the response was YES. [2024-06-03 22:43:49,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 274 events. 149/274 cut-off events. For 269/269 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 907 event pairs, 24 based on Foata normal form. 4/276 useless extension candidates. Maximal degree in co-relation 756. Up to 220 conditions per place. [2024-06-03 22:43:49,129 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 32 selfloop transitions, 8 changer transitions 0/42 dead transitions. [2024-06-03 22:43:49,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 225 flow [2024-06-03 22:43:49,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:43:49,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:43:49,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2024-06-03 22:43:49,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-03 22:43:49,132 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 117 flow. Second operand 6 states and 78 transitions. [2024-06-03 22:43:49,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 225 flow [2024-06-03 22:43:49,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 210 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-03 22:43:49,134 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 114 flow [2024-06-03 22:43:49,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2024-06-03 22:43:49,135 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2024-06-03 22:43:49,135 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 114 flow [2024-06-03 22:43:49,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 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:43:49,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:43:49,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:43:49,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 22:43:49,136 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:43:49,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:43:49,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1322578618, now seen corresponding path program 1 times [2024-06-03 22:43:49,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:43:49,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827994861] [2024-06-03 22:43:49,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:43:49,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:43:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:43:52,027 INFO 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:43:52,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:43:52,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827994861] [2024-06-03 22:43:52,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827994861] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:43:52,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:43:52,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:43:52,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672496689] [2024-06-03 22:43:52,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:43:52,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:43:52,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:43:52,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:43:52,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:43:52,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:43:52,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 114 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:43:52,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:43:52,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:43:52,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:43:52,213 INFO L124 PetriNetUnfolderBase]: 147/271 cut-off events. [2024-06-03 22:43:52,214 INFO L125 PetriNetUnfolderBase]: For 377/377 co-relation queries the response was YES. [2024-06-03 22:43:52,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 271 events. 147/271 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 886 event pairs, 53 based on Foata normal form. 1/270 useless extension candidates. Maximal degree in co-relation 780. Up to 259 conditions per place. [2024-06-03 22:43:52,215 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 26 selfloop transitions, 6 changer transitions 0/34 dead transitions. [2024-06-03 22:43:52,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 34 transitions, 196 flow [2024-06-03 22:43:52,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:43:52,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:43:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2024-06-03 22:43:52,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36 [2024-06-03 22:43:52,218 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 114 flow. Second operand 5 states and 54 transitions. [2024-06-03 22:43:52,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 34 transitions, 196 flow [2024-06-03 22:43:52,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 34 transitions, 176 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-03 22:43:52,223 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 121 flow [2024-06-03 22:43:52,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2024-06-03 22:43:52,227 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 10 predicate places. [2024-06-03 22:43:52,228 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 121 flow [2024-06-03 22:43:52,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:43:52,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:43:52,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:43:52,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 22:43:52,229 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:43:52,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:43:52,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1949736420, now seen corresponding path program 1 times [2024-06-03 22:43:52,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:43:52,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223259778] [2024-06-03 22:43:52,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:43:52,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:43:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:43:55,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:43:55,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:43:55,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223259778] [2024-06-03 22:43:55,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223259778] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:43:55,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:43:55,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:43:55,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955464505] [2024-06-03 22:43:55,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:43:55,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:43:55,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:43:55,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:43:55,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:43:55,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:43:55,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 121 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:43:55,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:43:55,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:43:55,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:43:55,349 INFO L124 PetriNetUnfolderBase]: 149/276 cut-off events. [2024-06-03 22:43:55,349 INFO L125 PetriNetUnfolderBase]: For 498/501 co-relation queries the response was YES. [2024-06-03 22:43:55,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 276 events. 149/276 cut-off events. For 498/501 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 922 event pairs, 52 based on Foata normal form. 4/277 useless extension candidates. Maximal degree in co-relation 822. Up to 237 conditions per place. [2024-06-03 22:43:55,351 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 28 selfloop transitions, 12 changer transitions 0/42 dead transitions. [2024-06-03 22:43:55,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 249 flow [2024-06-03 22:43:55,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:43:55,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:43:55,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2024-06-03 22:43:55,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37222222222222223 [2024-06-03 22:43:55,353 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 121 flow. Second operand 6 states and 67 transitions. [2024-06-03 22:43:55,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 249 flow [2024-06-03 22:43:55,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 238 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-03 22:43:55,355 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 178 flow [2024-06-03 22:43:55,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2024-06-03 22:43:55,357 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 14 predicate places. [2024-06-03 22:43:55,357 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 178 flow [2024-06-03 22:43:55,358 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:43:55,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:43:55,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:43:55,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 22:43:55,359 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:43:55,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:43:55,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1382704549, now seen corresponding path program 1 times [2024-06-03 22:43:55,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:43:55,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103126779] [2024-06-03 22:43:55,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:43:55,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:43:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:43:57,894 INFO 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:43:57,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:43:57,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103126779] [2024-06-03 22:43:57,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103126779] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:43:57,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:43:57,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:43:57,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111370652] [2024-06-03 22:43:57,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:43:57,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:43:57,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:43:57,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:43:57,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:43:57,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:43:57,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 178 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:43:57,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:43:57,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:43:57,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:43:58,124 INFO L124 PetriNetUnfolderBase]: 156/288 cut-off events. [2024-06-03 22:43:58,124 INFO L125 PetriNetUnfolderBase]: For 702/702 co-relation queries the response was YES. [2024-06-03 22:43:58,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 288 events. 156/288 cut-off events. For 702/702 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 959 event pairs, 51 based on Foata normal form. 1/287 useless extension candidates. Maximal degree in co-relation 989. Up to 264 conditions per place. [2024-06-03 22:43:58,127 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 37 selfloop transitions, 11 changer transitions 0/50 dead transitions. [2024-06-03 22:43:58,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 332 flow [2024-06-03 22:43:58,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:43:58,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:43:58,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2024-06-03 22:43:58,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2024-06-03 22:43:58,129 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 178 flow. Second operand 7 states and 74 transitions. [2024-06-03 22:43:58,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 50 transitions, 332 flow [2024-06-03 22:43:58,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 318 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-03 22:43:58,132 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 233 flow [2024-06-03 22:43:58,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=233, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2024-06-03 22:43:58,133 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 20 predicate places. [2024-06-03 22:43:58,133 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 233 flow [2024-06-03 22:43:58,133 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:43:58,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:43:58,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:43:58,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 22:43:58,134 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:43:58,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:43:58,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1164690619, now seen corresponding path program 2 times [2024-06-03 22:43:58,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:43:58,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660048410] [2024-06-03 22:43:58,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:43:58,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:43:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:00,652 INFO 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:44:00,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:00,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660048410] [2024-06-03 22:44:00,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660048410] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:00,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:00,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:44:00,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868859304] [2024-06-03 22:44:00,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:00,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:44:00,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:00,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:44:00,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:44:00,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:00,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 233 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:44:00,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:00,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:00,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:00,893 INFO L124 PetriNetUnfolderBase]: 159/293 cut-off events. [2024-06-03 22:44:00,893 INFO L125 PetriNetUnfolderBase]: For 952/952 co-relation queries the response was YES. [2024-06-03 22:44:00,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 293 events. 159/293 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 982 event pairs, 50 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1086. Up to 266 conditions per place. [2024-06-03 22:44:00,896 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 36 selfloop transitions, 12 changer transitions 0/50 dead transitions. [2024-06-03 22:44:00,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 370 flow [2024-06-03 22:44:00,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:44:00,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:44:00,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2024-06-03 22:44:00,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2024-06-03 22:44:00,897 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 233 flow. Second operand 6 states and 65 transitions. [2024-06-03 22:44:00,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 370 flow [2024-06-03 22:44:00,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 50 transitions, 349 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-03 22:44:00,899 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 267 flow [2024-06-03 22:44:00,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=267, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-06-03 22:44:00,901 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 22 predicate places. [2024-06-03 22:44:00,901 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 267 flow [2024-06-03 22:44:00,901 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:44:00,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:00,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:44:00,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 22:44:00,902 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:44:00,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:00,902 INFO L85 PathProgramCache]: Analyzing trace with hash 312279589, now seen corresponding path program 3 times [2024-06-03 22:44:00,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:00,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12000098] [2024-06-03 22:44:00,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:00,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:03,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:44:03,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:03,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12000098] [2024-06-03 22:44:03,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12000098] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:03,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:03,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:44:03,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517732271] [2024-06-03 22:44:03,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:03,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:44:03,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:03,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:44:03,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:44:03,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:03,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 267 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:44:03,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:03,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:03,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:03,687 INFO L124 PetriNetUnfolderBase]: 154/286 cut-off events. [2024-06-03 22:44:03,687 INFO L125 PetriNetUnfolderBase]: For 1202/1205 co-relation queries the response was YES. [2024-06-03 22:44:03,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1108 conditions, 286 events. 154/286 cut-off events. For 1202/1205 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 960 event pairs, 53 based on Foata normal form. 4/286 useless extension candidates. Maximal degree in co-relation 1081. Up to 239 conditions per place. [2024-06-03 22:44:03,689 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 30 selfloop transitions, 16 changer transitions 0/48 dead transitions. [2024-06-03 22:44:03,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 48 transitions, 375 flow [2024-06-03 22:44:03,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:44:03,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:44:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2024-06-03 22:44:03,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-03 22:44:03,690 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 267 flow. Second operand 6 states and 66 transitions. [2024-06-03 22:44:03,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 48 transitions, 375 flow [2024-06-03 22:44:03,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 345 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-03 22:44:03,694 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 276 flow [2024-06-03 22:44:03,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=276, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2024-06-03 22:44:03,695 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 24 predicate places. [2024-06-03 22:44:03,695 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 276 flow [2024-06-03 22:44:03,695 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:44:03,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:03,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:44:03,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 22:44:03,696 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:44:03,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:03,696 INFO L85 PathProgramCache]: Analyzing trace with hash 312287525, now seen corresponding path program 1 times [2024-06-03 22:44:03,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:03,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731437012] [2024-06-03 22:44:03,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:03,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:06,481 INFO 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:44:06,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:06,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731437012] [2024-06-03 22:44:06,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731437012] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:06,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:06,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:44:06,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811282313] [2024-06-03 22:44:06,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:06,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:44:06,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:06,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:44:06,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:44:06,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:06,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 276 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:44:06,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:06,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:06,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:06,754 INFO L124 PetriNetUnfolderBase]: 173/319 cut-off events. [2024-06-03 22:44:06,755 INFO L125 PetriNetUnfolderBase]: For 1243/1243 co-relation queries the response was YES. [2024-06-03 22:44:06,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1202 conditions, 319 events. 173/319 cut-off events. For 1243/1243 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1115 event pairs, 38 based on Foata normal form. 4/318 useless extension candidates. Maximal degree in co-relation 1174. Up to 192 conditions per place. [2024-06-03 22:44:06,757 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 39 selfloop transitions, 23 changer transitions 0/64 dead transitions. [2024-06-03 22:44:06,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 64 transitions, 504 flow [2024-06-03 22:44:06,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:44:06,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:44:06,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2024-06-03 22:44:06,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-03 22:44:06,758 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 276 flow. Second operand 7 states and 85 transitions. [2024-06-03 22:44:06,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 64 transitions, 504 flow [2024-06-03 22:44:06,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 459 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 22:44:06,762 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 352 flow [2024-06-03 22:44:06,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=352, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2024-06-03 22:44:06,763 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 27 predicate places. [2024-06-03 22:44:06,763 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 352 flow [2024-06-03 22:44:06,764 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:44:06,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:06,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:44:06,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 22:44:06,764 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:44:06,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:06,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1229324189, now seen corresponding path program 1 times [2024-06-03 22:44:06,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:06,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831919231] [2024-06-03 22:44:06,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:06,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:09,204 INFO 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:44:09,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:09,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831919231] [2024-06-03 22:44:09,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831919231] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:09,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:09,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:44:09,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110991851] [2024-06-03 22:44:09,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:09,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:44:09,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:09,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:44:09,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:44:09,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:09,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 352 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:44:09,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:09,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:09,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:09,472 INFO L124 PetriNetUnfolderBase]: 183/335 cut-off events. [2024-06-03 22:44:09,472 INFO L125 PetriNetUnfolderBase]: For 1468/1468 co-relation queries the response was YES. [2024-06-03 22:44:09,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1415 conditions, 335 events. 183/335 cut-off events. For 1468/1468 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1178 event pairs, 33 based on Foata normal form. 2/335 useless extension candidates. Maximal degree in co-relation 1385. Up to 281 conditions per place. [2024-06-03 22:44:09,475 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 54 selfloop transitions, 17 changer transitions 0/73 dead transitions. [2024-06-03 22:44:09,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 73 transitions, 574 flow [2024-06-03 22:44:09,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:44:09,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:44:09,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-03 22:44:09,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3625 [2024-06-03 22:44:09,476 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 352 flow. Second operand 8 states and 87 transitions. [2024-06-03 22:44:09,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 73 transitions, 574 flow [2024-06-03 22:44:09,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 73 transitions, 550 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-03 22:44:09,479 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 423 flow [2024-06-03 22:44:09,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=423, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2024-06-03 22:44:09,480 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2024-06-03 22:44:09,480 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 423 flow [2024-06-03 22:44:09,480 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:44:09,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:09,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:44:09,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 22:44:09,481 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:44:09,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:09,481 INFO L85 PathProgramCache]: Analyzing trace with hash -584554399, now seen corresponding path program 2 times [2024-06-03 22:44:09,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:09,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096048152] [2024-06-03 22:44:09,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:09,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:12,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:44:12,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:12,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096048152] [2024-06-03 22:44:12,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096048152] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:12,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:12,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:44:12,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684601997] [2024-06-03 22:44:12,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:12,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:44:12,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:12,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:44:12,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:44:12,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:12,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 423 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:44:12,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:12,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:12,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:12,369 INFO L124 PetriNetUnfolderBase]: 189/345 cut-off events. [2024-06-03 22:44:12,369 INFO L125 PetriNetUnfolderBase]: For 1876/1876 co-relation queries the response was YES. [2024-06-03 22:44:12,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 345 events. 189/345 cut-off events. For 1876/1876 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1212 event pairs, 32 based on Foata normal form. 2/345 useless extension candidates. Maximal degree in co-relation 1571. Up to 285 conditions per place. [2024-06-03 22:44:12,372 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 53 selfloop transitions, 18 changer transitions 0/73 dead transitions. [2024-06-03 22:44:12,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 629 flow [2024-06-03 22:44:12,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:44:12,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:44:12,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2024-06-03 22:44:12,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37142857142857144 [2024-06-03 22:44:12,374 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 423 flow. Second operand 7 states and 78 transitions. [2024-06-03 22:44:12,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 629 flow [2024-06-03 22:44:12,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 73 transitions, 607 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-03 22:44:12,378 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 469 flow [2024-06-03 22:44:12,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=469, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2024-06-03 22:44:12,379 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 39 predicate places. [2024-06-03 22:44:12,379 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 469 flow [2024-06-03 22:44:12,379 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:44:12,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:12,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:44:12,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 22:44:12,380 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:44:12,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:12,380 INFO L85 PathProgramCache]: Analyzing trace with hash 913601579, now seen corresponding path program 3 times [2024-06-03 22:44:12,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:12,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376839161] [2024-06-03 22:44:12,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:12,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:15,074 INFO 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:44:15,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:15,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376839161] [2024-06-03 22:44:15,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376839161] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:15,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:15,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:44:15,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55466602] [2024-06-03 22:44:15,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:15,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:44:15,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:15,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:44:15,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:44:15,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:15,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 469 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:44:15,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:15,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:15,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:15,370 INFO L124 PetriNetUnfolderBase]: 200/363 cut-off events. [2024-06-03 22:44:15,371 INFO L125 PetriNetUnfolderBase]: For 2422/2422 co-relation queries the response was YES. [2024-06-03 22:44:15,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1793 conditions, 363 events. 200/363 cut-off events. For 2422/2422 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1299 event pairs, 32 based on Foata normal form. 2/363 useless extension candidates. Maximal degree in co-relation 1758. Up to 285 conditions per place. [2024-06-03 22:44:15,373 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 53 selfloop transitions, 22 changer transitions 0/77 dead transitions. [2024-06-03 22:44:15,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 77 transitions, 735 flow [2024-06-03 22:44:15,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:44:15,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:44:15,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-03 22:44:15,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3761904761904762 [2024-06-03 22:44:15,375 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 469 flow. Second operand 7 states and 79 transitions. [2024-06-03 22:44:15,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 77 transitions, 735 flow [2024-06-03 22:44:15,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 77 transitions, 683 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-03 22:44:15,378 INFO L231 Difference]: Finished difference. Result has 70 places, 64 transitions, 521 flow [2024-06-03 22:44:15,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=521, PETRI_PLACES=70, PETRI_TRANSITIONS=64} [2024-06-03 22:44:15,379 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 41 predicate places. [2024-06-03 22:44:15,379 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 64 transitions, 521 flow [2024-06-03 22:44:15,379 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:44:15,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:15,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:44:15,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 22:44:15,380 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:44:15,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:15,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1090733099, now seen corresponding path program 4 times [2024-06-03 22:44:15,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:15,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778840225] [2024-06-03 22:44:15,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:15,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:18,104 INFO 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:44:18,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:18,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778840225] [2024-06-03 22:44:18,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778840225] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:18,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:18,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:44:18,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554739458] [2024-06-03 22:44:18,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:18,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:44:18,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:18,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:44:18,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:44:18,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:18,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 64 transitions, 521 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:44:18,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:18,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:18,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:18,384 INFO L124 PetriNetUnfolderBase]: 210/383 cut-off events. [2024-06-03 22:44:18,384 INFO L125 PetriNetUnfolderBase]: For 2702/2708 co-relation queries the response was YES. [2024-06-03 22:44:18,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1806 conditions, 383 events. 210/383 cut-off events. For 2702/2708 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1420 event pairs, 39 based on Foata normal form. 7/384 useless extension candidates. Maximal degree in co-relation 1770. Up to 193 conditions per place. [2024-06-03 22:44:18,387 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 50 selfloop transitions, 31 changer transitions 0/83 dead transitions. [2024-06-03 22:44:18,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 83 transitions, 807 flow [2024-06-03 22:44:18,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:44:18,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:44:18,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2024-06-03 22:44:18,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2024-06-03 22:44:18,388 INFO L175 Difference]: Start difference. First operand has 70 places, 64 transitions, 521 flow. Second operand 7 states and 87 transitions. [2024-06-03 22:44:18,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 83 transitions, 807 flow [2024-06-03 22:44:18,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 83 transitions, 785 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-03 22:44:18,393 INFO L231 Difference]: Finished difference. Result has 75 places, 71 transitions, 623 flow [2024-06-03 22:44:18,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=623, PETRI_PLACES=75, PETRI_TRANSITIONS=71} [2024-06-03 22:44:18,393 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 46 predicate places. [2024-06-03 22:44:18,393 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 623 flow [2024-06-03 22:44:18,393 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:44:18,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:18,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:44:18,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 22:44:18,394 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:44:18,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:18,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1090979363, now seen corresponding path program 1 times [2024-06-03 22:44:18,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:18,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447150914] [2024-06-03 22:44:18,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:18,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:21,358 INFO 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:44:21,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:21,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447150914] [2024-06-03 22:44:21,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447150914] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:21,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:21,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:44:21,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35027008] [2024-06-03 22:44:21,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:21,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:44:21,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:21,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:44:21,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:44:21,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:21,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 623 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:44:21,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:21,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:21,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:21,696 INFO L124 PetriNetUnfolderBase]: 230/435 cut-off events. [2024-06-03 22:44:21,696 INFO L125 PetriNetUnfolderBase]: For 3545/3551 co-relation queries the response was YES. [2024-06-03 22:44:21,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2103 conditions, 435 events. 230/435 cut-off events. For 3545/3551 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1714 event pairs, 42 based on Foata normal form. 15/444 useless extension candidates. Maximal degree in co-relation 2064. Up to 209 conditions per place. [2024-06-03 22:44:21,710 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 53 selfloop transitions, 35 changer transitions 0/90 dead transitions. [2024-06-03 22:44:21,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 90 transitions, 925 flow [2024-06-03 22:44:21,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:44:21,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:44:21,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-03 22:44:21,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4041666666666667 [2024-06-03 22:44:21,712 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 623 flow. Second operand 8 states and 97 transitions. [2024-06-03 22:44:21,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 90 transitions, 925 flow [2024-06-03 22:44:21,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 90 transitions, 882 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-03 22:44:21,718 INFO L231 Difference]: Finished difference. Result has 80 places, 72 transitions, 668 flow [2024-06-03 22:44:21,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=668, PETRI_PLACES=80, PETRI_TRANSITIONS=72} [2024-06-03 22:44:21,719 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 51 predicate places. [2024-06-03 22:44:21,719 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 72 transitions, 668 flow [2024-06-03 22:44:21,720 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:44:21,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:21,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:44:21,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 22:44:21,720 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:44:21,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:21,721 INFO L85 PathProgramCache]: Analyzing trace with hash 289667238, now seen corresponding path program 1 times [2024-06-03 22:44:21,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:21,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64852278] [2024-06-03 22:44:21,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:21,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:24,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:44:24,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:24,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64852278] [2024-06-03 22:44:24,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64852278] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:24,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:24,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:44:24,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073339039] [2024-06-03 22:44:24,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:24,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:44:24,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:24,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:44:24,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:44:24,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:24,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 72 transitions, 668 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:44:24,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:24,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:24,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:24,808 INFO L124 PetriNetUnfolderBase]: 237/446 cut-off events. [2024-06-03 22:44:24,808 INFO L125 PetriNetUnfolderBase]: For 2968/2968 co-relation queries the response was YES. [2024-06-03 22:44:24,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2243 conditions, 446 events. 237/446 cut-off events. For 2968/2968 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1797 event pairs, 44 based on Foata normal form. 1/445 useless extension candidates. Maximal degree in co-relation 2203. Up to 386 conditions per place. [2024-06-03 22:44:24,811 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 69 selfloop transitions, 20 changer transitions 0/91 dead transitions. [2024-06-03 22:44:24,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 91 transitions, 946 flow [2024-06-03 22:44:24,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:44:24,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:44:24,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-03 22:44:24,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-03 22:44:24,813 INFO L175 Difference]: Start difference. First operand has 80 places, 72 transitions, 668 flow. Second operand 8 states and 88 transitions. [2024-06-03 22:44:24,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 91 transitions, 946 flow [2024-06-03 22:44:24,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 91 transitions, 860 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-03 22:44:24,819 INFO L231 Difference]: Finished difference. Result has 83 places, 77 transitions, 699 flow [2024-06-03 22:44:24,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=699, PETRI_PLACES=83, PETRI_TRANSITIONS=77} [2024-06-03 22:44:24,819 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 54 predicate places. [2024-06-03 22:44:24,819 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 77 transitions, 699 flow [2024-06-03 22:44:24,820 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:44:24,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:24,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:44:24,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 22:44:24,820 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:44:24,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:24,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1746930940, now seen corresponding path program 2 times [2024-06-03 22:44:24,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:24,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614390704] [2024-06-03 22:44:24,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:24,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:27,640 INFO 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:44:27,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:27,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614390704] [2024-06-03 22:44:27,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614390704] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:27,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:27,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:44:27,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257248022] [2024-06-03 22:44:27,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:27,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:44:27,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:27,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:44:27,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:44:27,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:27,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 77 transitions, 699 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:44:27,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:27,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:27,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:27,953 INFO L124 PetriNetUnfolderBase]: 235/443 cut-off events. [2024-06-03 22:44:27,954 INFO L125 PetriNetUnfolderBase]: For 3092/3092 co-relation queries the response was YES. [2024-06-03 22:44:27,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2191 conditions, 443 events. 235/443 cut-off events. For 3092/3092 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1766 event pairs, 44 based on Foata normal form. 1/442 useless extension candidates. Maximal degree in co-relation 2149. Up to 374 conditions per place. [2024-06-03 22:44:27,957 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 65 selfloop transitions, 22 changer transitions 0/89 dead transitions. [2024-06-03 22:44:27,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 89 transitions, 913 flow [2024-06-03 22:44:27,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:44:27,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:44:27,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2024-06-03 22:44:27,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37142857142857144 [2024-06-03 22:44:27,959 INFO L175 Difference]: Start difference. First operand has 83 places, 77 transitions, 699 flow. Second operand 7 states and 78 transitions. [2024-06-03 22:44:27,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 89 transitions, 913 flow [2024-06-03 22:44:27,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 89 transitions, 871 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-03 22:44:27,966 INFO L231 Difference]: Finished difference. Result has 85 places, 77 transitions, 715 flow [2024-06-03 22:44:27,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=715, PETRI_PLACES=85, PETRI_TRANSITIONS=77} [2024-06-03 22:44:27,966 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 56 predicate places. [2024-06-03 22:44:27,966 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 77 transitions, 715 flow [2024-06-03 22:44:27,967 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:44:27,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:27,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:44:27,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 22:44:27,967 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:44:27,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:27,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1718909537, now seen corresponding path program 1 times [2024-06-03 22:44:27,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:27,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876189000] [2024-06-03 22:44:27,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:27,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:30,639 INFO 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:44:30,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:30,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876189000] [2024-06-03 22:44:30,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876189000] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:30,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:30,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:44:30,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039487352] [2024-06-03 22:44:30,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:30,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:44:30,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:30,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:44:30,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:44:30,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:30,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 77 transitions, 715 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:44:30,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:30,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:30,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:30,914 INFO L124 PetriNetUnfolderBase]: 241/454 cut-off events. [2024-06-03 22:44:30,914 INFO L125 PetriNetUnfolderBase]: For 3739/3745 co-relation queries the response was YES. [2024-06-03 22:44:30,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2277 conditions, 454 events. 241/454 cut-off events. For 3739/3745 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1850 event pairs, 50 based on Foata normal form. 6/455 useless extension candidates. Maximal degree in co-relation 2234. Up to 378 conditions per place. [2024-06-03 22:44:30,917 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 67 selfloop transitions, 20 changer transitions 1/90 dead transitions. [2024-06-03 22:44:30,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 946 flow [2024-06-03 22:44:30,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:44:30,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:44:30,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2024-06-03 22:44:30,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-03 22:44:30,919 INFO L175 Difference]: Start difference. First operand has 85 places, 77 transitions, 715 flow. Second operand 7 states and 77 transitions. [2024-06-03 22:44:30,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 946 flow [2024-06-03 22:44:30,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 90 transitions, 878 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-03 22:44:30,928 INFO L231 Difference]: Finished difference. Result has 85 places, 78 transitions, 704 flow [2024-06-03 22:44:30,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=704, PETRI_PLACES=85, PETRI_TRANSITIONS=78} [2024-06-03 22:44:30,929 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 56 predicate places. [2024-06-03 22:44:30,929 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 78 transitions, 704 flow [2024-06-03 22:44:30,931 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:44:30,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:30,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:44:30,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 22:44:30,931 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:44:30,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:30,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1163541781, now seen corresponding path program 2 times [2024-06-03 22:44:30,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:30,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014752306] [2024-06-03 22:44:30,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:30,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:33,673 INFO 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:44:33,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:33,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014752306] [2024-06-03 22:44:33,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014752306] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:33,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:33,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:44:33,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767657866] [2024-06-03 22:44:33,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:33,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:44:33,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:33,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:44:33,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:44:33,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:33,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 78 transitions, 704 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:44:33,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:33,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:33,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:33,921 INFO L124 PetriNetUnfolderBase]: 239/454 cut-off events. [2024-06-03 22:44:33,921 INFO L125 PetriNetUnfolderBase]: For 3469/3475 co-relation queries the response was YES. [2024-06-03 22:44:33,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2217 conditions, 454 events. 239/454 cut-off events. For 3469/3475 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1863 event pairs, 52 based on Foata normal form. 5/453 useless extension candidates. Maximal degree in co-relation 2174. Up to 250 conditions per place. [2024-06-03 22:44:33,924 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 47 selfloop transitions, 42 changer transitions 1/92 dead transitions. [2024-06-03 22:44:33,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 92 transitions, 1003 flow [2024-06-03 22:44:33,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:44:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:44:33,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2024-06-03 22:44:33,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2024-06-03 22:44:33,926 INFO L175 Difference]: Start difference. First operand has 85 places, 78 transitions, 704 flow. Second operand 7 states and 86 transitions. [2024-06-03 22:44:33,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 92 transitions, 1003 flow [2024-06-03 22:44:33,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 92 transitions, 964 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-03 22:44:33,932 INFO L231 Difference]: Finished difference. Result has 87 places, 79 transitions, 768 flow [2024-06-03 22:44:33,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=768, PETRI_PLACES=87, PETRI_TRANSITIONS=79} [2024-06-03 22:44:33,933 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 58 predicate places. [2024-06-03 22:44:33,933 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 79 transitions, 768 flow [2024-06-03 22:44:33,933 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:44:33,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:33,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:44:33,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 22:44:33,934 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:44:33,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:33,934 INFO L85 PathProgramCache]: Analyzing trace with hash -332378461, now seen corresponding path program 3 times [2024-06-03 22:44:33,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:33,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640026782] [2024-06-03 22:44:33,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:33,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:36,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:44:36,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:36,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640026782] [2024-06-03 22:44:36,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640026782] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:36,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:36,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:44:36,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471910752] [2024-06-03 22:44:36,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:36,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:44:36,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:36,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:44:36,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:44:36,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:36,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 79 transitions, 768 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:44:36,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:36,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:36,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:36,920 INFO L124 PetriNetUnfolderBase]: 234/447 cut-off events. [2024-06-03 22:44:36,921 INFO L125 PetriNetUnfolderBase]: For 3666/3672 co-relation queries the response was YES. [2024-06-03 22:44:36,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2286 conditions, 447 events. 234/447 cut-off events. For 3666/3672 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1857 event pairs, 49 based on Foata normal form. 3/444 useless extension candidates. Maximal degree in co-relation 2242. Up to 248 conditions per place. [2024-06-03 22:44:36,923 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 51 selfloop transitions, 38 changer transitions 1/92 dead transitions. [2024-06-03 22:44:36,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 92 transitions, 1043 flow [2024-06-03 22:44:36,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:44:36,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:44:36,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2024-06-03 22:44:36,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3952380952380952 [2024-06-03 22:44:36,926 INFO L175 Difference]: Start difference. First operand has 87 places, 79 transitions, 768 flow. Second operand 7 states and 83 transitions. [2024-06-03 22:44:36,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 92 transitions, 1043 flow [2024-06-03 22:44:36,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 92 transitions, 948 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-03 22:44:36,936 INFO L231 Difference]: Finished difference. Result has 89 places, 80 transitions, 768 flow [2024-06-03 22:44:36,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=768, PETRI_PLACES=89, PETRI_TRANSITIONS=80} [2024-06-03 22:44:36,936 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 60 predicate places. [2024-06-03 22:44:36,936 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 80 transitions, 768 flow [2024-06-03 22:44:36,936 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:44:36,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:36,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:44:36,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 22:44:36,937 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:44:36,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:36,938 INFO L85 PathProgramCache]: Analyzing trace with hash -539654234, now seen corresponding path program 1 times [2024-06-03 22:44:36,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:36,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078423204] [2024-06-03 22:44:36,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:36,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:39,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:44:39,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:39,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078423204] [2024-06-03 22:44:39,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078423204] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:39,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:39,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:44:39,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131966309] [2024-06-03 22:44:39,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:39,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:44:39,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:39,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:44:39,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:44:39,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:39,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 80 transitions, 768 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:44:39,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:39,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:39,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:40,005 INFO L124 PetriNetUnfolderBase]: 222/429 cut-off events. [2024-06-03 22:44:40,005 INFO L125 PetriNetUnfolderBase]: For 3728/3734 co-relation queries the response was YES. [2024-06-03 22:44:40,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2204 conditions, 429 events. 222/429 cut-off events. For 3728/3734 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1762 event pairs, 52 based on Foata normal form. 4/427 useless extension candidates. Maximal degree in co-relation 2159. Up to 267 conditions per place. [2024-06-03 22:44:40,008 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 59 selfloop transitions, 32 changer transitions 0/93 dead transitions. [2024-06-03 22:44:40,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 93 transitions, 1047 flow [2024-06-03 22:44:40,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:44:40,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:44:40,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2024-06-03 22:44:40,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3952380952380952 [2024-06-03 22:44:40,010 INFO L175 Difference]: Start difference. First operand has 89 places, 80 transitions, 768 flow. Second operand 7 states and 83 transitions. [2024-06-03 22:44:40,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 93 transitions, 1047 flow [2024-06-03 22:44:40,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 93 transitions, 992 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-03 22:44:40,017 INFO L231 Difference]: Finished difference. Result has 92 places, 82 transitions, 811 flow [2024-06-03 22:44:40,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=811, PETRI_PLACES=92, PETRI_TRANSITIONS=82} [2024-06-03 22:44:40,017 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 63 predicate places. [2024-06-03 22:44:40,018 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 82 transitions, 811 flow [2024-06-03 22:44:40,018 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:44:40,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:40,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:44:40,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 22:44:40,018 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:44:40,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:40,019 INFO L85 PathProgramCache]: Analyzing trace with hash -539387324, now seen corresponding path program 2 times [2024-06-03 22:44:40,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:40,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898640737] [2024-06-03 22:44:40,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:40,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:42,843 INFO 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:44:42,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:42,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898640737] [2024-06-03 22:44:42,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898640737] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:42,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:42,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:44:42,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008906498] [2024-06-03 22:44:42,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:42,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:44:42,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:42,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:44:42,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:44:42,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:42,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 82 transitions, 811 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:44:42,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:42,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:42,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:43,086 INFO L124 PetriNetUnfolderBase]: 218/422 cut-off events. [2024-06-03 22:44:43,086 INFO L125 PetriNetUnfolderBase]: For 3722/3728 co-relation queries the response was YES. [2024-06-03 22:44:43,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2179 conditions, 422 events. 218/422 cut-off events. For 3722/3728 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1722 event pairs, 51 based on Foata normal form. 2/418 useless extension candidates. Maximal degree in co-relation 2133. Up to 247 conditions per place. [2024-06-03 22:44:43,089 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 56 selfloop transitions, 34 changer transitions 0/92 dead transitions. [2024-06-03 22:44:43,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 92 transitions, 1061 flow [2024-06-03 22:44:43,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:44:43,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:44:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2024-06-03 22:44:43,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38571428571428573 [2024-06-03 22:44:43,090 INFO L175 Difference]: Start difference. First operand has 92 places, 82 transitions, 811 flow. Second operand 7 states and 81 transitions. [2024-06-03 22:44:43,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 92 transitions, 1061 flow [2024-06-03 22:44:43,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 92 transitions, 965 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-03 22:44:43,098 INFO L231 Difference]: Finished difference. Result has 94 places, 82 transitions, 788 flow [2024-06-03 22:44:43,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=788, PETRI_PLACES=94, PETRI_TRANSITIONS=82} [2024-06-03 22:44:43,099 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2024-06-03 22:44:43,099 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 82 transitions, 788 flow [2024-06-03 22:44:43,099 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:44:43,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:43,099 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:44:43,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 22:44:43,099 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:44:43,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:43,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1298332010, now seen corresponding path program 1 times [2024-06-03 22:44:43,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:43,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341811464] [2024-06-03 22:44:43,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:43,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:46,006 INFO 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:44:46,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:46,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341811464] [2024-06-03 22:44:46,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341811464] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:46,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:46,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:44:46,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76361734] [2024-06-03 22:44:46,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:46,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:44:46,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:46,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:44:46,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:44:46,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:46,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 82 transitions, 788 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:44:46,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:46,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:46,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:46,351 INFO L124 PetriNetUnfolderBase]: 222/429 cut-off events. [2024-06-03 22:44:46,351 INFO L125 PetriNetUnfolderBase]: For 4017/4017 co-relation queries the response was YES. [2024-06-03 22:44:46,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2204 conditions, 429 events. 222/429 cut-off events. For 4017/4017 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1746 event pairs, 31 based on Foata normal form. 2/429 useless extension candidates. Maximal degree in co-relation 2157. Up to 349 conditions per place. [2024-06-03 22:44:46,354 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 79 selfloop transitions, 16 changer transitions 0/97 dead transitions. [2024-06-03 22:44:46,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 97 transitions, 1024 flow [2024-06-03 22:44:46,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:44:46,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:44:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2024-06-03 22:44:46,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-03 22:44:46,356 INFO L175 Difference]: Start difference. First operand has 94 places, 82 transitions, 788 flow. Second operand 8 states and 84 transitions. [2024-06-03 22:44:46,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 97 transitions, 1024 flow [2024-06-03 22:44:46,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 97 transitions, 942 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-03 22:44:46,364 INFO L231 Difference]: Finished difference. Result has 96 places, 83 transitions, 750 flow [2024-06-03 22:44:46,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=750, PETRI_PLACES=96, PETRI_TRANSITIONS=83} [2024-06-03 22:44:46,365 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 67 predicate places. [2024-06-03 22:44:46,365 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 83 transitions, 750 flow [2024-06-03 22:44:46,365 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:44:46,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:46,365 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:44:46,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 22:44:46,365 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:44:46,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:46,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1746707726, now seen corresponding path program 2 times [2024-06-03 22:44:46,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:46,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985010868] [2024-06-03 22:44:46,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:46,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:49,350 INFO 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:44:49,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:49,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985010868] [2024-06-03 22:44:49,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985010868] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:49,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:49,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:44:49,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899179564] [2024-06-03 22:44:49,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:49,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:44:49,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:49,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:44:49,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:44:49,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:49,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 83 transitions, 750 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:44:49,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:49,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:49,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:49,727 INFO L124 PetriNetUnfolderBase]: 226/437 cut-off events. [2024-06-03 22:44:49,727 INFO L125 PetriNetUnfolderBase]: For 4287/4287 co-relation queries the response was YES. [2024-06-03 22:44:49,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2203 conditions, 437 events. 226/437 cut-off events. For 4287/4287 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1799 event pairs, 40 based on Foata normal form. 2/437 useless extension candidates. Maximal degree in co-relation 2155. Up to 356 conditions per place. [2024-06-03 22:44:49,730 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 73 selfloop transitions, 23 changer transitions 0/98 dead transitions. [2024-06-03 22:44:49,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 98 transitions, 994 flow [2024-06-03 22:44:49,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:44:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:44:49,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2024-06-03 22:44:49,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2024-06-03 22:44:49,732 INFO L175 Difference]: Start difference. First operand has 96 places, 83 transitions, 750 flow. Second operand 8 states and 86 transitions. [2024-06-03 22:44:49,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 98 transitions, 994 flow [2024-06-03 22:44:49,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 98 transitions, 960 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-03 22:44:49,740 INFO L231 Difference]: Finished difference. Result has 98 places, 84 transitions, 779 flow [2024-06-03 22:44:49,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=779, PETRI_PLACES=98, PETRI_TRANSITIONS=84} [2024-06-03 22:44:49,740 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 69 predicate places. [2024-06-03 22:44:49,740 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 84 transitions, 779 flow [2024-06-03 22:44:49,741 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:44:49,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:49,741 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:44:49,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 22:44:49,741 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:44:49,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:49,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1679716326, now seen corresponding path program 1 times [2024-06-03 22:44:49,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:49,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489270103] [2024-06-03 22:44:49,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:49,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:52,539 INFO 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:44:52,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:52,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489270103] [2024-06-03 22:44:52,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489270103] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:52,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:52,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:44:52,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279554993] [2024-06-03 22:44:52,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:52,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:44:52,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:52,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:44:52,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:44:52,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:52,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 84 transitions, 779 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:44:52,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:52,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:52,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:52,824 INFO L124 PetriNetUnfolderBase]: 221/423 cut-off events. [2024-06-03 22:44:52,824 INFO L125 PetriNetUnfolderBase]: For 4451/4457 co-relation queries the response was YES. [2024-06-03 22:44:52,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2167 conditions, 423 events. 221/423 cut-off events. For 4451/4457 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1716 event pairs, 41 based on Foata normal form. 5/424 useless extension candidates. Maximal degree in co-relation 2118. Up to 336 conditions per place. [2024-06-03 22:44:52,827 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 68 selfloop transitions, 23 changer transitions 2/95 dead transitions. [2024-06-03 22:44:52,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 95 transitions, 1005 flow [2024-06-03 22:44:52,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:44:52,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:44:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2024-06-03 22:44:52,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-03 22:44:52,829 INFO L175 Difference]: Start difference. First operand has 98 places, 84 transitions, 779 flow. Second operand 7 states and 77 transitions. [2024-06-03 22:44:52,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 95 transitions, 1005 flow [2024-06-03 22:44:52,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 95 transitions, 956 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 22:44:52,839 INFO L231 Difference]: Finished difference. Result has 99 places, 82 transitions, 761 flow [2024-06-03 22:44:52,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=761, PETRI_PLACES=99, PETRI_TRANSITIONS=82} [2024-06-03 22:44:52,840 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 70 predicate places. [2024-06-03 22:44:52,840 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 82 transitions, 761 flow [2024-06-03 22:44:52,840 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:44:52,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:52,840 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:44:52,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 22:44:52,840 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:44:52,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:52,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1710234134, now seen corresponding path program 3 times [2024-06-03 22:44:52,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:52,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485213266] [2024-06-03 22:44:52,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:52,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:55,950 INFO 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:44:55,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:55,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485213266] [2024-06-03 22:44:55,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485213266] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:55,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:55,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:44:55,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760750774] [2024-06-03 22:44:55,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:55,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:44:55,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:55,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:44:55,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:44:56,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:56,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 82 transitions, 761 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:44:56,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:56,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:56,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:56,302 INFO L124 PetriNetUnfolderBase]: 208/395 cut-off events. [2024-06-03 22:44:56,302 INFO L125 PetriNetUnfolderBase]: For 4902/4902 co-relation queries the response was YES. [2024-06-03 22:44:56,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2092 conditions, 395 events. 208/395 cut-off events. For 4902/4902 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1568 event pairs, 32 based on Foata normal form. 2/395 useless extension candidates. Maximal degree in co-relation 2042. Up to 306 conditions per place. [2024-06-03 22:44:56,305 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 67 selfloop transitions, 27 changer transitions 0/96 dead transitions. [2024-06-03 22:44:56,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 96 transitions, 1003 flow [2024-06-03 22:44:56,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:44:56,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:44:56,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2024-06-03 22:44:56,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2024-06-03 22:44:56,307 INFO L175 Difference]: Start difference. First operand has 99 places, 82 transitions, 761 flow. Second operand 8 states and 86 transitions. [2024-06-03 22:44:56,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 96 transitions, 1003 flow [2024-06-03 22:44:56,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 96 transitions, 914 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-03 22:44:56,316 INFO L231 Difference]: Finished difference. Result has 100 places, 83 transitions, 742 flow [2024-06-03 22:44:56,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=742, PETRI_PLACES=100, PETRI_TRANSITIONS=83} [2024-06-03 22:44:56,316 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2024-06-03 22:44:56,317 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 83 transitions, 742 flow [2024-06-03 22:44:56,317 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:44:56,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:56,317 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:44:56,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 22:44:56,317 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:44:56,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:56,318 INFO L85 PathProgramCache]: Analyzing trace with hash 458862820, now seen corresponding path program 1 times [2024-06-03 22:44:56,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:56,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712513213] [2024-06-03 22:44:56,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:56,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:59,653 INFO 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:44:59,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:59,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712513213] [2024-06-03 22:44:59,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712513213] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:59,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:59,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:44:59,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008140219] [2024-06-03 22:44:59,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:59,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:44:59,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:59,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:44:59,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:44:59,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:59,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 83 transitions, 742 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:44:59,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:59,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:59,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:59,973 INFO L124 PetriNetUnfolderBase]: 212/404 cut-off events. [2024-06-03 22:44:59,973 INFO L125 PetriNetUnfolderBase]: For 5070/5076 co-relation queries the response was YES. [2024-06-03 22:44:59,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2109 conditions, 404 events. 212/404 cut-off events. For 5070/5076 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1614 event pairs, 44 based on Foata normal form. 6/406 useless extension candidates. Maximal degree in co-relation 2058. Up to 335 conditions per place. [2024-06-03 22:44:59,976 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 69 selfloop transitions, 24 changer transitions 0/95 dead transitions. [2024-06-03 22:44:59,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 95 transitions, 974 flow [2024-06-03 22:44:59,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:44:59,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:44:59,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2024-06-03 22:44:59,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.337037037037037 [2024-06-03 22:44:59,978 INFO L175 Difference]: Start difference. First operand has 100 places, 83 transitions, 742 flow. Second operand 9 states and 91 transitions. [2024-06-03 22:44:59,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 95 transitions, 974 flow [2024-06-03 22:44:59,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 95 transitions, 914 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 22:44:59,987 INFO L231 Difference]: Finished difference. Result has 104 places, 85 transitions, 763 flow [2024-06-03 22:44:59,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=763, PETRI_PLACES=104, PETRI_TRANSITIONS=85} [2024-06-03 22:44:59,987 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 75 predicate places. [2024-06-03 22:44:59,987 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 85 transitions, 763 flow [2024-06-03 22:44:59,988 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:44:59,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:59,988 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:44:59,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 22:44:59,988 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:44:59,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:59,988 INFO L85 PathProgramCache]: Analyzing trace with hash 459159490, now seen corresponding path program 2 times [2024-06-03 22:44:59,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:59,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810659163] [2024-06-03 22:44:59,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:59,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:45:03,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:03,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810659163] [2024-06-03 22:45:03,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810659163] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:03,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:03,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:45:03,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77897175] [2024-06-03 22:45:03,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:03,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:45:03,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:03,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:45:03,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:45:03,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:03,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 85 transitions, 763 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:45:03,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:03,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:03,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:03,362 INFO L124 PetriNetUnfolderBase]: 238/458 cut-off events. [2024-06-03 22:45:03,362 INFO L125 PetriNetUnfolderBase]: For 7294/7300 co-relation queries the response was YES. [2024-06-03 22:45:03,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2440 conditions, 458 events. 238/458 cut-off events. For 7294/7300 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1889 event pairs, 49 based on Foata normal form. 3/455 useless extension candidates. Maximal degree in co-relation 2387. Up to 195 conditions per place. [2024-06-03 22:45:03,365 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 64 selfloop transitions, 36 changer transitions 0/102 dead transitions. [2024-06-03 22:45:03,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 102 transitions, 1071 flow [2024-06-03 22:45:03,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:45:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:45:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2024-06-03 22:45:03,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2024-06-03 22:45:03,367 INFO L175 Difference]: Start difference. First operand has 104 places, 85 transitions, 763 flow. Second operand 8 states and 92 transitions. [2024-06-03 22:45:03,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 102 transitions, 1071 flow [2024-06-03 22:45:03,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 102 transitions, 1022 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-03 22:45:03,378 INFO L231 Difference]: Finished difference. Result has 106 places, 85 transitions, 790 flow [2024-06-03 22:45:03,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=790, PETRI_PLACES=106, PETRI_TRANSITIONS=85} [2024-06-03 22:45:03,378 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 77 predicate places. [2024-06-03 22:45:03,379 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 85 transitions, 790 flow [2024-06-03 22:45:03,379 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:45:03,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:03,379 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:45:03,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 22:45:03,379 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:45:03,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:03,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1164883488, now seen corresponding path program 4 times [2024-06-03 22:45:03,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:03,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583856594] [2024-06-03 22:45:03,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:03,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:06,375 INFO 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:45:06,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:06,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583856594] [2024-06-03 22:45:06,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583856594] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:06,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:06,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:45:06,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156039331] [2024-06-03 22:45:06,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:06,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:45:06,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:06,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:45:06,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:45:06,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:06,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 85 transitions, 790 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:45:06,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:06,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:06,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:06,714 INFO L124 PetriNetUnfolderBase]: 255/497 cut-off events. [2024-06-03 22:45:06,714 INFO L125 PetriNetUnfolderBase]: For 10692/10698 co-relation queries the response was YES. [2024-06-03 22:45:06,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2549 conditions, 497 events. 255/497 cut-off events. For 10692/10698 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2151 event pairs, 60 based on Foata normal form. 15/506 useless extension candidates. Maximal degree in co-relation 2495. Up to 259 conditions per place. [2024-06-03 22:45:06,718 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 55 selfloop transitions, 37 changer transitions 8/102 dead transitions. [2024-06-03 22:45:06,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 102 transitions, 1062 flow [2024-06-03 22:45:06,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:45:06,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:45:06,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-03 22:45:06,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2024-06-03 22:45:06,720 INFO L175 Difference]: Start difference. First operand has 106 places, 85 transitions, 790 flow. Second operand 8 states and 98 transitions. [2024-06-03 22:45:06,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 102 transitions, 1062 flow [2024-06-03 22:45:06,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 102 transitions, 968 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-03 22:45:06,732 INFO L231 Difference]: Finished difference. Result has 107 places, 82 transitions, 755 flow [2024-06-03 22:45:06,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=755, PETRI_PLACES=107, PETRI_TRANSITIONS=82} [2024-06-03 22:45:06,734 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 78 predicate places. [2024-06-03 22:45:06,734 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 82 transitions, 755 flow [2024-06-03 22:45:06,735 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:45:06,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:06,735 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:45:06,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 22:45:06,735 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:45:06,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:06,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1593587264, now seen corresponding path program 1 times [2024-06-03 22:45:06,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:06,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22055232] [2024-06-03 22:45:06,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:06,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:09,901 INFO 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:45:09,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:09,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22055232] [2024-06-03 22:45:09,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22055232] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:09,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:09,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:45:09,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679155962] [2024-06-03 22:45:09,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:09,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:45:09,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:09,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:45:09,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:45:10,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:10,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 82 transitions, 755 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:45:10,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:10,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:10,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:10,217 INFO L124 PetriNetUnfolderBase]: 204/396 cut-off events. [2024-06-03 22:45:10,218 INFO L125 PetriNetUnfolderBase]: For 5025/5031 co-relation queries the response was YES. [2024-06-03 22:45:10,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2017 conditions, 396 events. 204/396 cut-off events. For 5025/5031 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1602 event pairs, 27 based on Foata normal form. 6/398 useless extension candidates. Maximal degree in co-relation 1963. Up to 307 conditions per place. [2024-06-03 22:45:10,225 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 78 selfloop transitions, 16 changer transitions 0/96 dead transitions. [2024-06-03 22:45:10,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 96 transitions, 987 flow [2024-06-03 22:45:10,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:45:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:45:10,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2024-06-03 22:45:10,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3416666666666667 [2024-06-03 22:45:10,226 INFO L175 Difference]: Start difference. First operand has 107 places, 82 transitions, 755 flow. Second operand 8 states and 82 transitions. [2024-06-03 22:45:10,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 96 transitions, 987 flow [2024-06-03 22:45:10,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 96 transitions, 856 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-03 22:45:10,236 INFO L231 Difference]: Finished difference. Result has 106 places, 83 transitions, 670 flow [2024-06-03 22:45:10,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=670, PETRI_PLACES=106, PETRI_TRANSITIONS=83} [2024-06-03 22:45:10,237 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 77 predicate places. [2024-06-03 22:45:10,237 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 83 transitions, 670 flow [2024-06-03 22:45:10,238 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:45:10,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:10,238 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:45:10,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 22:45:10,238 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:45:10,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:10,239 INFO L85 PathProgramCache]: Analyzing trace with hash -843400768, now seen corresponding path program 2 times [2024-06-03 22:45:10,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:10,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875507016] [2024-06-03 22:45:10,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:10,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:13,187 INFO 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:45:13,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:13,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875507016] [2024-06-03 22:45:13,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875507016] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:13,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:13,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:45:13,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119996414] [2024-06-03 22:45:13,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:13,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:45:13,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:13,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:45:13,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:45:13,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:13,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 83 transitions, 670 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:45:13,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:13,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:13,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:13,466 INFO L124 PetriNetUnfolderBase]: 215/417 cut-off events. [2024-06-03 22:45:13,467 INFO L125 PetriNetUnfolderBase]: For 5683/5689 co-relation queries the response was YES. [2024-06-03 22:45:13,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2000 conditions, 417 events. 215/417 cut-off events. For 5683/5689 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1724 event pairs, 38 based on Foata normal form. 6/419 useless extension candidates. Maximal degree in co-relation 1947. Up to 299 conditions per place. [2024-06-03 22:45:13,469 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 75 selfloop transitions, 22 changer transitions 0/99 dead transitions. [2024-06-03 22:45:13,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 99 transitions, 972 flow [2024-06-03 22:45:13,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:45:13,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:45:13,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2024-06-03 22:45:13,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2024-06-03 22:45:13,471 INFO L175 Difference]: Start difference. First operand has 106 places, 83 transitions, 670 flow. Second operand 8 states and 86 transitions. [2024-06-03 22:45:13,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 99 transitions, 972 flow [2024-06-03 22:45:13,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 99 transitions, 938 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-03 22:45:13,481 INFO L231 Difference]: Finished difference. Result has 108 places, 85 transitions, 702 flow [2024-06-03 22:45:13,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=702, PETRI_PLACES=108, PETRI_TRANSITIONS=85} [2024-06-03 22:45:13,482 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 79 predicate places. [2024-06-03 22:45:13,482 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 85 transitions, 702 flow [2024-06-03 22:45:13,482 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:45:13,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:13,482 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:45:13,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 22:45:13,482 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:45:13,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:13,483 INFO L85 PathProgramCache]: Analyzing trace with hash -843397048, now seen corresponding path program 3 times [2024-06-03 22:45:13,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:13,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961339882] [2024-06-03 22:45:13,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:13,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:16,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:45:16,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:16,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961339882] [2024-06-03 22:45:16,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961339882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:16,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:16,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:45:16,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844142842] [2024-06-03 22:45:16,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:16,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:45:16,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:16,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:45:16,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:45:16,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:16,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 85 transitions, 702 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:45:16,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:16,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:16,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:16,899 INFO L124 PetriNetUnfolderBase]: 212/412 cut-off events. [2024-06-03 22:45:16,900 INFO L125 PetriNetUnfolderBase]: For 5525/5531 co-relation queries the response was YES. [2024-06-03 22:45:16,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1965 conditions, 412 events. 212/412 cut-off events. For 5525/5531 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1694 event pairs, 37 based on Foata normal form. 6/414 useless extension candidates. Maximal degree in co-relation 1911. Up to 317 conditions per place. [2024-06-03 22:45:16,902 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 72 selfloop transitions, 24 changer transitions 0/98 dead transitions. [2024-06-03 22:45:16,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 98 transitions, 938 flow [2024-06-03 22:45:16,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:45:16,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:45:16,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2024-06-03 22:45:16,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-03 22:45:16,904 INFO L175 Difference]: Start difference. First operand has 108 places, 85 transitions, 702 flow. Second operand 8 states and 84 transitions. [2024-06-03 22:45:16,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 98 transitions, 938 flow [2024-06-03 22:45:16,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 98 transitions, 900 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-03 22:45:16,915 INFO L231 Difference]: Finished difference. Result has 112 places, 85 transitions, 717 flow [2024-06-03 22:45:16,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=717, PETRI_PLACES=112, PETRI_TRANSITIONS=85} [2024-06-03 22:45:16,915 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 83 predicate places. [2024-06-03 22:45:16,915 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 85 transitions, 717 flow [2024-06-03 22:45:16,915 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:45:16,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:16,916 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:45:16,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 22:45:16,916 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:45:16,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:16,916 INFO L85 PathProgramCache]: Analyzing trace with hash 203800926, now seen corresponding path program 1 times [2024-06-03 22:45:16,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:16,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599302746] [2024-06-03 22:45:16,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:16,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:20,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:45:20,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:20,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599302746] [2024-06-03 22:45:20,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599302746] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:20,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:20,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:45:20,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101577283] [2024-06-03 22:45:20,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:20,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:45:20,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:20,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:45:20,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:45:20,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:20,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 85 transitions, 717 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:45:20,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:20,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:20,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:20,431 INFO L124 PetriNetUnfolderBase]: 260/512 cut-off events. [2024-06-03 22:45:20,431 INFO L125 PetriNetUnfolderBase]: For 12538/12544 co-relation queries the response was YES. [2024-06-03 22:45:20,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2611 conditions, 512 events. 260/512 cut-off events. For 12538/12544 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2261 event pairs, 51 based on Foata normal form. 9/515 useless extension candidates. Maximal degree in co-relation 2555. Up to 198 conditions per place. [2024-06-03 22:45:20,434 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 57 selfloop transitions, 41 changer transitions 6/106 dead transitions. [2024-06-03 22:45:20,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 106 transitions, 1069 flow [2024-06-03 22:45:20,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:45:20,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:45:20,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-03 22:45:20,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2024-06-03 22:45:20,435 INFO L175 Difference]: Start difference. First operand has 112 places, 85 transitions, 717 flow. Second operand 8 states and 98 transitions. [2024-06-03 22:45:20,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 106 transitions, 1069 flow [2024-06-03 22:45:20,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 106 transitions, 1016 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-03 22:45:20,452 INFO L231 Difference]: Finished difference. Result has 113 places, 84 transitions, 744 flow [2024-06-03 22:45:20,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=744, PETRI_PLACES=113, PETRI_TRANSITIONS=84} [2024-06-03 22:45:20,452 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 84 predicate places. [2024-06-03 22:45:20,452 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 84 transitions, 744 flow [2024-06-03 22:45:20,453 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:45:20,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:20,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:45:20,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 22:45:20,453 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:45:20,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:20,453 INFO L85 PathProgramCache]: Analyzing trace with hash 203793486, now seen corresponding path program 2 times [2024-06-03 22:45:20,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:20,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661710292] [2024-06-03 22:45:20,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:20,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:23,719 INFO 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:45:23,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:23,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661710292] [2024-06-03 22:45:23,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661710292] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:23,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:23,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:45:23,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055734557] [2024-06-03 22:45:23,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:23,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:45:23,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:23,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:45:23,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:45:23,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:23,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 84 transitions, 744 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:45:23,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:23,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:23,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:24,003 INFO L124 PetriNetUnfolderBase]: 250/498 cut-off events. [2024-06-03 22:45:24,003 INFO L125 PetriNetUnfolderBase]: For 13417/13423 co-relation queries the response was YES. [2024-06-03 22:45:24,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2520 conditions, 498 events. 250/498 cut-off events. For 13417/13423 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2203 event pairs, 61 based on Foata normal form. 13/505 useless extension candidates. Maximal degree in co-relation 2463. Up to 274 conditions per place. [2024-06-03 22:45:24,006 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 52 selfloop transitions, 40 changer transitions 7/101 dead transitions. [2024-06-03 22:45:24,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 101 transitions, 1018 flow [2024-06-03 22:45:24,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:45:24,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:45:24,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-03 22:45:24,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-03 22:45:24,007 INFO L175 Difference]: Start difference. First operand has 113 places, 84 transitions, 744 flow. Second operand 8 states and 95 transitions. [2024-06-03 22:45:24,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 101 transitions, 1018 flow [2024-06-03 22:45:24,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 101 transitions, 934 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-03 22:45:24,025 INFO L231 Difference]: Finished difference. Result has 113 places, 82 transitions, 737 flow [2024-06-03 22:45:24,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=737, PETRI_PLACES=113, PETRI_TRANSITIONS=82} [2024-06-03 22:45:24,025 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 84 predicate places. [2024-06-03 22:45:24,025 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 82 transitions, 737 flow [2024-06-03 22:45:24,025 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:45:24,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:24,026 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:45:24,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 22:45:24,026 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:45:24,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:24,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1477646264, now seen corresponding path program 4 times [2024-06-03 22:45:24,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:24,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400792008] [2024-06-03 22:45:24,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:24,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:27,076 INFO 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:45:27,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:27,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400792008] [2024-06-03 22:45:27,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400792008] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:27,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:27,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:45:27,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152360946] [2024-06-03 22:45:27,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:27,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:45:27,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:27,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:45:27,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:45:27,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:27,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 82 transitions, 737 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:45:27,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:27,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:27,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:27,335 INFO L124 PetriNetUnfolderBase]: 208/412 cut-off events. [2024-06-03 22:45:27,335 INFO L125 PetriNetUnfolderBase]: For 6393/6399 co-relation queries the response was YES. [2024-06-03 22:45:27,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2062 conditions, 412 events. 208/412 cut-off events. For 6393/6399 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1728 event pairs, 43 based on Foata normal form. 3/409 useless extension candidates. Maximal degree in co-relation 2005. Up to 236 conditions per place. [2024-06-03 22:45:27,338 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 59 selfloop transitions, 34 changer transitions 0/95 dead transitions. [2024-06-03 22:45:27,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 95 transitions, 979 flow [2024-06-03 22:45:27,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:45:27,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:45:27,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-03 22:45:27,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-03 22:45:27,339 INFO L175 Difference]: Start difference. First operand has 113 places, 82 transitions, 737 flow. Second operand 8 states and 88 transitions. [2024-06-03 22:45:27,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 95 transitions, 979 flow [2024-06-03 22:45:27,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 95 transitions, 877 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-03 22:45:27,352 INFO L231 Difference]: Finished difference. Result has 114 places, 83 transitions, 721 flow [2024-06-03 22:45:27,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=721, PETRI_PLACES=114, PETRI_TRANSITIONS=83} [2024-06-03 22:45:27,352 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 85 predicate places. [2024-06-03 22:45:27,352 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 83 transitions, 721 flow [2024-06-03 22:45:27,352 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:45:27,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:27,352 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:45:27,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 22:45:27,353 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:45:27,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:27,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1477649984, now seen corresponding path program 5 times [2024-06-03 22:45:27,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:27,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831499546] [2024-06-03 22:45:27,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:27,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:30,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:45:30,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:30,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831499546] [2024-06-03 22:45:30,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831499546] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:30,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:30,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:45:30,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153799422] [2024-06-03 22:45:30,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:30,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:45:30,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:30,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:45:30,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:45:30,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:30,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 83 transitions, 721 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:45:30,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:30,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:30,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:30,599 INFO L124 PetriNetUnfolderBase]: 205/407 cut-off events. [2024-06-03 22:45:30,599 INFO L125 PetriNetUnfolderBase]: For 5919/5925 co-relation queries the response was YES. [2024-06-03 22:45:30,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1951 conditions, 407 events. 205/407 cut-off events. For 5919/5925 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1698 event pairs, 36 based on Foata normal form. 3/404 useless extension candidates. Maximal degree in co-relation 1893. Up to 195 conditions per place. [2024-06-03 22:45:30,601 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 56 selfloop transitions, 37 changer transitions 0/95 dead transitions. [2024-06-03 22:45:30,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 95 transitions, 947 flow [2024-06-03 22:45:30,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:45:30,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:45:30,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-03 22:45:30,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37083333333333335 [2024-06-03 22:45:30,603 INFO L175 Difference]: Start difference. First operand has 114 places, 83 transitions, 721 flow. Second operand 8 states and 89 transitions. [2024-06-03 22:45:30,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 95 transitions, 947 flow [2024-06-03 22:45:30,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 95 transitions, 871 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-03 22:45:30,615 INFO L231 Difference]: Finished difference. Result has 116 places, 83 transitions, 724 flow [2024-06-03 22:45:30,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=724, PETRI_PLACES=116, PETRI_TRANSITIONS=83} [2024-06-03 22:45:30,615 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 87 predicate places. [2024-06-03 22:45:30,616 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 83 transitions, 724 flow [2024-06-03 22:45:30,616 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:45:30,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:30,616 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:45:30,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 22:45:30,616 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:45:30,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:30,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1083136204, now seen corresponding path program 3 times [2024-06-03 22:45:30,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:30,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006337208] [2024-06-03 22:45:30,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:30,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:33,904 INFO 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:45:33,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:33,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006337208] [2024-06-03 22:45:33,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006337208] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:33,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:33,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:45:33,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115458672] [2024-06-03 22:45:33,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:33,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:45:33,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:33,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:45:33,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:45:34,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:34,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 83 transitions, 724 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:45:34,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:34,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:34,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:34,217 INFO L124 PetriNetUnfolderBase]: 221/439 cut-off events. [2024-06-03 22:45:34,217 INFO L125 PetriNetUnfolderBase]: For 8126/8132 co-relation queries the response was YES. [2024-06-03 22:45:34,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2056 conditions, 439 events. 221/439 cut-off events. For 8126/8132 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1889 event pairs, 42 based on Foata normal form. 7/440 useless extension candidates. Maximal degree in co-relation 1997. Up to 250 conditions per place. [2024-06-03 22:45:34,220 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 64 selfloop transitions, 35 changer transitions 0/101 dead transitions. [2024-06-03 22:45:34,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 101 transitions, 994 flow [2024-06-03 22:45:34,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:45:34,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:45:34,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-03 22:45:34,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37407407407407406 [2024-06-03 22:45:34,221 INFO L175 Difference]: Start difference. First operand has 116 places, 83 transitions, 724 flow. Second operand 9 states and 101 transitions. [2024-06-03 22:45:34,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 101 transitions, 994 flow [2024-06-03 22:45:34,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 101 transitions, 903 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-03 22:45:34,235 INFO L231 Difference]: Finished difference. Result has 118 places, 86 transitions, 735 flow [2024-06-03 22:45:34,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=735, PETRI_PLACES=118, PETRI_TRANSITIONS=86} [2024-06-03 22:45:34,236 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 89 predicate places. [2024-06-03 22:45:34,236 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 86 transitions, 735 flow [2024-06-03 22:45:34,236 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:45:34,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:34,237 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:45:34,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 22:45:34,237 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:45:34,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:34,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1083345454, now seen corresponding path program 4 times [2024-06-03 22:45:34,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:34,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399438187] [2024-06-03 22:45:34,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:34,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:37,453 INFO 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:45:37,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:37,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399438187] [2024-06-03 22:45:37,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399438187] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:37,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:37,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:45:37,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850922399] [2024-06-03 22:45:37,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:37,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:45:37,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:37,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:45:37,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:45:37,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:37,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 86 transitions, 735 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:45:37,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:37,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:37,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:37,750 INFO L124 PetriNetUnfolderBase]: 248/500 cut-off events. [2024-06-03 22:45:37,750 INFO L125 PetriNetUnfolderBase]: For 12143/12149 co-relation queries the response was YES. [2024-06-03 22:45:37,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2398 conditions, 500 events. 248/500 cut-off events. For 12143/12149 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2237 event pairs, 57 based on Foata normal form. 9/503 useless extension candidates. Maximal degree in co-relation 2339. Up to 203 conditions per place. [2024-06-03 22:45:37,752 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 63 selfloop transitions, 29 changer transitions 11/105 dead transitions. [2024-06-03 22:45:37,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 105 transitions, 1079 flow [2024-06-03 22:45:37,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:45:37,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:45:37,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-03 22:45:37,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-03 22:45:37,753 INFO L175 Difference]: Start difference. First operand has 118 places, 86 transitions, 735 flow. Second operand 8 states and 99 transitions. [2024-06-03 22:45:37,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 105 transitions, 1079 flow [2024-06-03 22:45:37,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 105 transitions, 984 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-03 22:45:37,772 INFO L231 Difference]: Finished difference. Result has 118 places, 80 transitions, 654 flow [2024-06-03 22:45:37,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=654, PETRI_PLACES=118, PETRI_TRANSITIONS=80} [2024-06-03 22:45:37,772 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 89 predicate places. [2024-06-03 22:45:37,772 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 80 transitions, 654 flow [2024-06-03 22:45:37,772 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:45:37,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:37,772 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:45:37,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 22:45:37,773 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:45:37,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:37,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1349042734, now seen corresponding path program 5 times [2024-06-03 22:45:37,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:37,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083237097] [2024-06-03 22:45:37,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:37,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:41,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:45:41,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:41,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083237097] [2024-06-03 22:45:41,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083237097] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:41,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:41,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:45:41,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947364788] [2024-06-03 22:45:41,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:41,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:45:41,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:41,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:45:41,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:45:41,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:41,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 80 transitions, 654 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:45:41,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:41,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:41,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:41,342 INFO L124 PetriNetUnfolderBase]: 235/481 cut-off events. [2024-06-03 22:45:41,343 INFO L125 PetriNetUnfolderBase]: For 13867/13873 co-relation queries the response was YES. [2024-06-03 22:45:41,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2298 conditions, 481 events. 235/481 cut-off events. For 13867/13873 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2138 event pairs, 60 based on Foata normal form. 9/484 useless extension candidates. Maximal degree in co-relation 2239. Up to 202 conditions per place. [2024-06-03 22:45:41,345 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 61 selfloop transitions, 23 changer transitions 11/97 dead transitions. [2024-06-03 22:45:41,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 97 transitions, 964 flow [2024-06-03 22:45:41,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:45:41,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:45:41,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2024-06-03 22:45:41,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37916666666666665 [2024-06-03 22:45:41,346 INFO L175 Difference]: Start difference. First operand has 118 places, 80 transitions, 654 flow. Second operand 8 states and 91 transitions. [2024-06-03 22:45:41,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 97 transitions, 964 flow [2024-06-03 22:45:41,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 97 transitions, 892 flow, removed 7 selfloop flow, removed 10 redundant places. [2024-06-03 22:45:41,365 INFO L231 Difference]: Finished difference. Result has 112 places, 75 transitions, 605 flow [2024-06-03 22:45:41,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=605, PETRI_PLACES=112, PETRI_TRANSITIONS=75} [2024-06-03 22:45:41,367 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 83 predicate places. [2024-06-03 22:45:41,368 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 75 transitions, 605 flow [2024-06-03 22:45:41,368 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:45:41,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:41,368 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:45:41,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-03 22:45:41,368 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:45:41,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:41,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1748683931, now seen corresponding path program 1 times [2024-06-03 22:45:41,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:41,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154273402] [2024-06-03 22:45:41,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:41,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:44,997 INFO 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:45:44,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:44,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154273402] [2024-06-03 22:45:44,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154273402] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:44,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:44,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:45:44,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19804281] [2024-06-03 22:45:44,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:44,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:45:44,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:44,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:45:44,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:45:45,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:45,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 75 transitions, 605 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:45:45,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:45,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:45,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:45,326 INFO L124 PetriNetUnfolderBase]: 187/377 cut-off events. [2024-06-03 22:45:45,326 INFO L125 PetriNetUnfolderBase]: For 6010/6016 co-relation queries the response was YES. [2024-06-03 22:45:45,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1593 conditions, 377 events. 187/377 cut-off events. For 6010/6016 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1528 event pairs, 31 based on Foata normal form. 10/383 useless extension candidates. Maximal degree in co-relation 1537. Up to 264 conditions per place. [2024-06-03 22:45:45,328 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 61 selfloop transitions, 11 changer transitions 18/92 dead transitions. [2024-06-03 22:45:45,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 92 transitions, 835 flow [2024-06-03 22:45:45,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:45:45,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:45:45,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2024-06-03 22:45:45,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.337037037037037 [2024-06-03 22:45:45,329 INFO L175 Difference]: Start difference. First operand has 112 places, 75 transitions, 605 flow. Second operand 9 states and 91 transitions. [2024-06-03 22:45:45,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 92 transitions, 835 flow [2024-06-03 22:45:45,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 92 transitions, 789 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-03 22:45:45,338 INFO L231 Difference]: Finished difference. Result has 108 places, 70 transitions, 552 flow [2024-06-03 22:45:45,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=552, PETRI_PLACES=108, PETRI_TRANSITIONS=70} [2024-06-03 22:45:45,338 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 79 predicate places. [2024-06-03 22:45:45,339 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 70 transitions, 552 flow [2024-06-03 22:45:45,339 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:45:45,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:45,339 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:45:45,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-03 22:45:45,339 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:45:45,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:45,339 INFO L85 PathProgramCache]: Analyzing trace with hash 32262263, now seen corresponding path program 2 times [2024-06-03 22:45:45,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:45,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767956638] [2024-06-03 22:45:45,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:45,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:48,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:45:48,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:48,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767956638] [2024-06-03 22:45:48,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767956638] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:48,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:48,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:45:48,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795665399] [2024-06-03 22:45:48,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:48,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:45:48,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:48,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:45:48,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:45:48,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:48,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 70 transitions, 552 flow. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:45:48,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:48,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:48,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:48,651 INFO L124 PetriNetUnfolderBase]: 164/336 cut-off events. [2024-06-03 22:45:48,651 INFO L125 PetriNetUnfolderBase]: For 4982/4988 co-relation queries the response was YES. [2024-06-03 22:45:48,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1421 conditions, 336 events. 164/336 cut-off events. For 4982/4988 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1318 event pairs, 17 based on Foata normal form. 7/337 useless extension candidates. Maximal degree in co-relation 1368. Up to 98 conditions per place. [2024-06-03 22:45:48,653 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 44 selfloop transitions, 19 changer transitions 16/81 dead transitions. [2024-06-03 22:45:48,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 81 transitions, 740 flow [2024-06-03 22:45:48,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:45:48,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:45:48,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2024-06-03 22:45:48,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.325 [2024-06-03 22:45:48,653 INFO L175 Difference]: Start difference. First operand has 108 places, 70 transitions, 552 flow. Second operand 8 states and 78 transitions. [2024-06-03 22:45:48,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 81 transitions, 740 flow [2024-06-03 22:45:48,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 81 transitions, 710 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-03 22:45:48,660 INFO L231 Difference]: Finished difference. Result has 101 places, 60 transitions, 478 flow [2024-06-03 22:45:48,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=478, PETRI_PLACES=101, PETRI_TRANSITIONS=60} [2024-06-03 22:45:48,660 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 72 predicate places. [2024-06-03 22:45:48,661 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 60 transitions, 478 flow [2024-06-03 22:45:48,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:45:48,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:48,661 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:45:48,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-03 22:45:48,661 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:45:48,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:48,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1338213465, now seen corresponding path program 3 times [2024-06-03 22:45:48,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:48,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246771448] [2024-06-03 22:45:48,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:48,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:45:51,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:51,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246771448] [2024-06-03 22:45:51,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246771448] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:51,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:51,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:45:51,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310438932] [2024-06-03 22:45:51,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:51,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:45:51,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:51,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:45:51,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:45:51,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:51,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 60 transitions, 478 flow. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:45:51,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:51,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:51,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:52,018 INFO L124 PetriNetUnfolderBase]: 134/290 cut-off events. [2024-06-03 22:45:52,018 INFO L125 PetriNetUnfolderBase]: For 4001/4007 co-relation queries the response was YES. [2024-06-03 22:45:52,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1242 conditions, 290 events. 134/290 cut-off events. For 4001/4007 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1110 event pairs, 22 based on Foata normal form. 7/291 useless extension candidates. Maximal degree in co-relation 1192. Up to 88 conditions per place. [2024-06-03 22:45:52,019 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 21 selfloop transitions, 7 changer transitions 41/71 dead transitions. [2024-06-03 22:45:52,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 71 transitions, 650 flow [2024-06-03 22:45:52,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:45:52,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:45:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2024-06-03 22:45:52,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-03 22:45:52,020 INFO L175 Difference]: Start difference. First operand has 101 places, 60 transitions, 478 flow. Second operand 8 states and 80 transitions. [2024-06-03 22:45:52,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 71 transitions, 650 flow [2024-06-03 22:45:52,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 71 transitions, 602 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-03 22:45:52,026 INFO L231 Difference]: Finished difference. Result has 93 places, 26 transitions, 171 flow [2024-06-03 22:45:52,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=171, PETRI_PLACES=93, PETRI_TRANSITIONS=26} [2024-06-03 22:45:52,026 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 64 predicate places. [2024-06-03 22:45:52,027 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 26 transitions, 171 flow [2024-06-03 22:45:52,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:45:52,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:52,027 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:45:52,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-03 22:45:52,027 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:45:52,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:52,028 INFO L85 PathProgramCache]: Analyzing trace with hash -782699907, now seen corresponding path program 4 times [2024-06-03 22:45:52,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:52,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762379322] [2024-06-03 22:45:52,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:52,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:55,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:45:55,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:55,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762379322] [2024-06-03 22:45:55,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762379322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:55,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:55,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:45:55,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44926030] [2024-06-03 22:45:55,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:55,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:45:55,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:55,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:45:55,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:45:55,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:55,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 26 transitions, 171 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:45:55,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:55,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:55,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:55,726 INFO L124 PetriNetUnfolderBase]: 49/113 cut-off events. [2024-06-03 22:45:55,726 INFO L125 PetriNetUnfolderBase]: For 2053/2053 co-relation queries the response was YES. [2024-06-03 22:45:55,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 113 events. 49/113 cut-off events. For 2053/2053 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 286 event pairs, 8 based on Foata normal form. 6/118 useless extension candidates. Maximal degree in co-relation 418. Up to 59 conditions per place. [2024-06-03 22:45:55,727 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 20 selfloop transitions, 5 changer transitions 8/35 dead transitions. [2024-06-03 22:45:55,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 35 transitions, 259 flow [2024-06-03 22:45:55,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:45:55,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:45:55,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2024-06-03 22:45:55,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3 [2024-06-03 22:45:55,728 INFO L175 Difference]: Start difference. First operand has 93 places, 26 transitions, 171 flow. Second operand 8 states and 72 transitions. [2024-06-03 22:45:55,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 35 transitions, 259 flow [2024-06-03 22:45:55,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 35 transitions, 198 flow, removed 19 selfloop flow, removed 25 redundant places. [2024-06-03 22:45:55,729 INFO L231 Difference]: Finished difference. Result has 53 places, 23 transitions, 109 flow [2024-06-03 22:45:55,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=109, PETRI_PLACES=53, PETRI_TRANSITIONS=23} [2024-06-03 22:45:55,730 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 24 predicate places. [2024-06-03 22:45:55,730 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 23 transitions, 109 flow [2024-06-03 22:45:55,730 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:45:55,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:55,730 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:45:55,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-03 22:45:55,731 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:45:55,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:55,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1652830443, now seen corresponding path program 1 times [2024-06-03 22:45:55,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:55,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153577082] [2024-06-03 22:45:55,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:55,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:59,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:45:59,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:59,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153577082] [2024-06-03 22:45:59,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153577082] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:59,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:59,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:45:59,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663456352] [2024-06-03 22:45:59,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:59,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:45:59,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:59,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:45:59,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:45:59,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:59,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 23 transitions, 109 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:45:59,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:59,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:59,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:59,879 INFO L124 PetriNetUnfolderBase]: 31/75 cut-off events. [2024-06-03 22:45:59,879 INFO L125 PetriNetUnfolderBase]: For 188/188 co-relation queries the response was YES. [2024-06-03 22:45:59,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 75 events. 31/75 cut-off events. For 188/188 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 133 event pairs, 0 based on Foata normal form. 4/78 useless extension candidates. Maximal degree in co-relation 212. Up to 22 conditions per place. [2024-06-03 22:45:59,880 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 0 selfloop transitions, 0 changer transitions 32/32 dead transitions. [2024-06-03 22:45:59,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 32 transitions, 169 flow [2024-06-03 22:45:59,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:45:59,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:45:59,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2024-06-03 22:45:59,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27 [2024-06-03 22:45:59,881 INFO L175 Difference]: Start difference. First operand has 53 places, 23 transitions, 109 flow. Second operand 10 states and 81 transitions. [2024-06-03 22:45:59,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 32 transitions, 169 flow [2024-06-03 22:45:59,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 32 transitions, 139 flow, removed 0 selfloop flow, removed 13 redundant places. [2024-06-03 22:45:59,881 INFO L231 Difference]: Finished difference. Result has 45 places, 0 transitions, 0 flow [2024-06-03 22:45:59,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=36, 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=45, PETRI_TRANSITIONS=0} [2024-06-03 22:45:59,882 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 16 predicate places. [2024-06-03 22:45:59,882 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 0 transitions, 0 flow [2024-06-03 22:45:59,882 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:45:59,884 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-03 22:45:59,888 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-03 22:45:59,889 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-03 22:45:59,890 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-03 22:45:59,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-03 22:45:59,890 INFO L445 BasicCegarLoop]: Path program histogram: [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:45:59,893 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-03 22:45:59,894 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-03 22:45:59,896 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-03 22:45:59,897 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-03 22:45:59,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.06 10:45:59 BasicIcfg [2024-06-03 22:45:59,897 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-03 22:45:59,898 INFO L158 Benchmark]: Toolchain (without parser) took 141182.50ms. Allocated memory was 165.7MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 103.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 221.5MB. Max. memory is 16.1GB. [2024-06-03 22:45:59,898 INFO L158 Benchmark]: Witness Parser took 0.18ms. Allocated memory is still 165.7MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 22:45:59,898 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 165.7MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 22:45:59,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 636.30ms. Allocated memory is still 165.7MB. Free memory was 102.4MB in the beginning and 57.0MB in the end (delta: 45.4MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-06-03 22:45:59,898 INFO L158 Benchmark]: Boogie Procedure Inliner took 112.69ms. Allocated memory is still 165.7MB. Free memory was 57.0MB in the beginning and 123.1MB in the end (delta: -66.1MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2024-06-03 22:45:59,899 INFO L158 Benchmark]: Boogie Preprocessor took 86.61ms. Allocated memory is still 165.7MB. Free memory was 123.1MB in the beginning and 116.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-03 22:45:59,899 INFO L158 Benchmark]: RCFGBuilder took 914.89ms. Allocated memory was 165.7MB in the beginning and 247.5MB in the end (delta: 81.8MB). Free memory was 116.8MB in the beginning and 112.3MB in the end (delta: 4.5MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. [2024-06-03 22:45:59,899 INFO L158 Benchmark]: TraceAbstraction took 139427.41ms. Allocated memory was 247.5MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 111.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 147.1MB. Max. memory is 16.1GB. [2024-06-03 22:45:59,903 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.18ms. Allocated memory is still 165.7MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 165.7MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 636.30ms. Allocated memory is still 165.7MB. Free memory was 102.4MB in the beginning and 57.0MB in the end (delta: 45.4MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 112.69ms. Allocated memory is still 165.7MB. Free memory was 57.0MB in the beginning and 123.1MB in the end (delta: -66.1MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.61ms. Allocated memory is still 165.7MB. Free memory was 123.1MB in the beginning and 116.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 914.89ms. Allocated memory was 165.7MB in the beginning and 247.5MB in the end (delta: 81.8MB). Free memory was 116.8MB in the beginning and 112.3MB in the end (delta: 4.5MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. * TraceAbstraction took 139427.41ms. Allocated memory was 247.5MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 111.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 147.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 793]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 794]: 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, 47 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: 139.3s, OverallIterations: 44, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1942 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1597 mSDsluCounter, 1234 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1059 mSDsCounter, 398 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8755 IncrementalHoareTripleChecker+Invalid, 9153 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 398 mSolverCounterUnsat, 175 mSDtfsCounter, 8755 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 351 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=811occurred in iteration=21, InterpolantAutomatonStates: 322, 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.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 125.1s InterpolantComputationTime, 657 NumberOfCodeBlocks, 657 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 613 ConstructedInterpolants, 0 QuantifiedInterpolants, 25075 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 44 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:45:59,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE