./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix018_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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/mix018_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix018_power.oepc_pso.oepc_rmo.oepc.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-7724a2d-m [2024-06-27 23:26:25,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 23:26:26,047 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 23:26:26,050 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 23:26:26,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 23:26:26,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 23:26:26,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 23:26:26,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 23:26:26,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 23:26:26,075 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 23:26:26,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 23:26:26,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 23:26:26,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 23:26:26,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 23:26:26,079 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 23:26:26,079 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 23:26:26,080 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 23:26:26,080 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 23:26:26,081 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 23:26:26,081 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 23:26:26,081 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 23:26:26,081 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 23:26:26,082 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 23:26:26,082 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 23:26:26,082 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 23:26:26,082 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 23:26:26,082 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 23:26:26,083 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 23:26:26,083 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 23:26:26,083 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 23:26:26,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 23:26:26,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 23:26:26,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:26:26,084 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 23:26:26,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 23:26:26,085 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 23:26:26,085 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 23:26:26,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 23:26:26,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 23:26:26,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 23:26:26,085 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 23:26:26,086 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 23:26:26,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 23:26:26,086 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-27 23:26:26,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 23:26:26,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 23:26:26,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 23:26:26,328 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 23:26:26,329 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 23:26:26,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 23:26:27,243 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 23:26:27,419 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 23:26:27,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 23:26:27,444 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d788cf6b9/1a83f1ecbd2e4de989ebd5503f95efa1/FLAG6624c1980 [2024-06-27 23:26:27,453 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d788cf6b9/1a83f1ecbd2e4de989ebd5503f95efa1 [2024-06-27 23:26:27,455 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 23:26:27,456 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 23:26:27,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix018_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-27 23:26:27,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 23:26:27,600 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 23:26:27,607 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 23:26:27,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 23:26:27,611 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 23:26:27,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:26:27" (1/2) ... [2024-06-27 23:26:27,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1175ee0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:26:27, skipping insertion in model container [2024-06-27 23:26:27,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:26:27" (1/2) ... [2024-06-27 23:26:27,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@477fb9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:26:27, skipping insertion in model container [2024-06-27 23:26:27,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:26:27" (2/2) ... [2024-06-27 23:26:27,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1175ee0c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:26:27, skipping insertion in model container [2024-06-27 23:26:27,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:26:27" (2/2) ... [2024-06-27 23:26:27,614 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 23:26:27,633 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 23:26:27,633 INFO L97 edCorrectnessWitness]: Location invariant before [L874-L874] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 23:26:27,634 INFO L97 edCorrectnessWitness]: Location invariant before [L873-L873] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 23:26:27,634 INFO L97 edCorrectnessWitness]: Location invariant before [L869-L869] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 23:26:27,634 INFO L97 edCorrectnessWitness]: Location invariant before [L871-L871] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 23:26:27,634 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 23:26:27,635 INFO L106 edCorrectnessWitness]: ghost_update [L867-L867] multithreaded = 1; [2024-06-27 23:26:27,662 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 23:26:27,925 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:26:27,939 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 23:26:28,141 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:26:28,182 INFO L206 MainTranslator]: Completed translation [2024-06-27 23:26:28,183 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:26:28 WrapperNode [2024-06-27 23:26:28,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 23:26:28,183 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 23:26:28,183 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 23:26:28,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 23:26:28,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:26:28" (1/1) ... [2024-06-27 23:26:28,228 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:26:28" (1/1) ... [2024-06-27 23:26:28,310 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 139 [2024-06-27 23:26:28,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 23:26:28,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 23:26:28,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 23:26:28,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 23:26:28,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:26:28" (1/1) ... [2024-06-27 23:26:28,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:26:28" (1/1) ... [2024-06-27 23:26:28,327 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:26:28" (1/1) ... [2024-06-27 23:26:28,366 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-27 23:26:28,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:26:28" (1/1) ... [2024-06-27 23:26:28,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:26:28" (1/1) ... [2024-06-27 23:26:28,397 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:26:28" (1/1) ... [2024-06-27 23:26:28,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:26:28" (1/1) ... [2024-06-27 23:26:28,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:26:28" (1/1) ... [2024-06-27 23:26:28,414 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:26:28" (1/1) ... [2024-06-27 23:26:28,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 23:26:28,424 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 23:26:28,424 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 23:26:28,424 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 23:26:28,425 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:26:28" (1/1) ... [2024-06-27 23:26:28,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:26:28,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 23:26:28,446 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-27 23:26:28,464 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-27 23:26:28,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 23:26:28,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 23:26:28,477 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 23:26:28,477 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 23:26:28,477 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 23:26:28,477 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 23:26:28,477 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 23:26:28,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 23:26:28,478 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-27 23:26:28,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-27 23:26:28,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 23:26:28,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 23:26:28,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 23:26:28,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 23:26:28,480 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 23:26:28,618 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 23:26:28,619 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 23:26:29,283 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 23:26:29,283 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 23:26:29,476 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 23:26:29,476 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 23:26:29,477 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:26:29 BoogieIcfgContainer [2024-06-27 23:26:29,477 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 23:26:29,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 23:26:29,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 23:26:29,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 23:26:29,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 11:26:27" (1/4) ... [2024-06-27 23:26:29,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c681a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 11:26:29, skipping insertion in model container [2024-06-27 23:26:29,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:26:27" (2/4) ... [2024-06-27 23:26:29,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c681a0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 11:26:29, skipping insertion in model container [2024-06-27 23:26:29,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:26:28" (3/4) ... [2024-06-27 23:26:29,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c681a0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 11:26:29, skipping insertion in model container [2024-06-27 23:26:29,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:26:29" (4/4) ... [2024-06-27 23:26:29,487 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 23:26:29,499 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 23:26:29,499 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 23:26:29,499 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 23:26:29,607 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 23:26:29,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 52 transitions, 120 flow [2024-06-27 23:26:29,666 INFO L124 PetriNetUnfolderBase]: 0/48 cut-off events. [2024-06-27 23:26:29,666 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:26:29,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 48 events. 0/48 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-27 23:26:29,669 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 52 transitions, 120 flow [2024-06-27 23:26:29,672 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 42 transitions, 96 flow [2024-06-27 23:26:29,683 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 23:26:29,688 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;@3d489c69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 23:26:29,689 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-27 23:26:29,693 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 23:26:29,693 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 23:26:29,693 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:26:29,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:26:29,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 23:26:29,694 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:26:29,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:26:29,700 INFO L85 PathProgramCache]: Analyzing trace with hash 402353374, now seen corresponding path program 1 times [2024-06-27 23:26:29,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:26:29,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357361226] [2024-06-27 23:26:29,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:26:29,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:26:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:26:31,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:26:31,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:26:31,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357361226] [2024-06-27 23:26:31,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357361226] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:26:31,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:26:31,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 23:26:31,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367443166] [2024-06-27 23:26:31,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:26:31,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 23:26:31,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:26:31,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 23:26:31,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 23:26:31,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 52 [2024-06-27 23:26:31,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:26:31,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:26:31,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 52 [2024-06-27 23:26:31,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:26:32,990 INFO L124 PetriNetUnfolderBase]: 9587/13433 cut-off events. [2024-06-27 23:26:32,991 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2024-06-27 23:26:33,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26841 conditions, 13433 events. 9587/13433 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 74008 event pairs, 7462 based on Foata normal form. 1/13189 useless extension candidates. Maximal degree in co-relation 26828. Up to 13017 conditions per place. [2024-06-27 23:26:33,075 INFO L140 encePairwiseOnDemand]: 43/52 looper letters, 43 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2024-06-27 23:26:33,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 56 transitions, 229 flow [2024-06-27 23:26:33,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 23:26:33,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 23:26:33,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-06-27 23:26:33,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6217948717948718 [2024-06-27 23:26:33,088 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 96 flow. Second operand 3 states and 97 transitions. [2024-06-27 23:26:33,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 56 transitions, 229 flow [2024-06-27 23:26:33,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 56 transitions, 222 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 23:26:33,095 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 131 flow [2024-06-27 23:26:33,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-06-27 23:26:33,100 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -1 predicate places. [2024-06-27 23:26:33,100 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 131 flow [2024-06-27 23:26:33,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:26:33,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:26:33,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:26:33,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 23:26:33,101 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:26:33,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:26:33,102 INFO L85 PathProgramCache]: Analyzing trace with hash 114558717, now seen corresponding path program 1 times [2024-06-27 23:26:33,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:26:33,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691378801] [2024-06-27 23:26:33,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:26:33,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:26:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:26:34,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:26:34,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:26:34,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691378801] [2024-06-27 23:26:34,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691378801] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:26:34,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:26:34,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 23:26:34,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219240758] [2024-06-27 23:26:34,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:26:34,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 23:26:34,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:26:34,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 23:26:34,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 23:26:34,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 52 [2024-06-27 23:26:34,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 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-27 23:26:34,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:26:34,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 52 [2024-06-27 23:26:34,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:26:36,014 INFO L124 PetriNetUnfolderBase]: 9577/13427 cut-off events. [2024-06-27 23:26:36,014 INFO L125 PetriNetUnfolderBase]: For 2471/2471 co-relation queries the response was YES. [2024-06-27 23:26:36,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30276 conditions, 13427 events. 9577/13427 cut-off events. For 2471/2471 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 74058 event pairs, 6775 based on Foata normal form. 4/13369 useless extension candidates. Maximal degree in co-relation 30264. Up to 12982 conditions per place. [2024-06-27 23:26:36,077 INFO L140 encePairwiseOnDemand]: 42/52 looper letters, 53 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2024-06-27 23:26:36,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 70 transitions, 321 flow [2024-06-27 23:26:36,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 23:26:36,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 23:26:36,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2024-06-27 23:26:36,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6057692307692307 [2024-06-27 23:26:36,080 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 131 flow. Second operand 4 states and 126 transitions. [2024-06-27 23:26:36,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 70 transitions, 321 flow [2024-06-27 23:26:36,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 70 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 23:26:36,083 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 179 flow [2024-06-27 23:26:36,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2024-06-27 23:26:36,083 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2024-06-27 23:26:36,084 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 179 flow [2024-06-27 23:26:36,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 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-27 23:26:36,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:26:36,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:26:36,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 23:26:36,085 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:26:36,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:26:36,085 INFO L85 PathProgramCache]: Analyzing trace with hash -743646291, now seen corresponding path program 1 times [2024-06-27 23:26:36,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:26:36,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650941337] [2024-06-27 23:26:36,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:26:36,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:26:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:26:37,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:26:37,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:26:37,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650941337] [2024-06-27 23:26:37,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650941337] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:26:37,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:26:37,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:26:37,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151052489] [2024-06-27 23:26:37,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:26:37,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:26:37,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:26:37,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:26:37,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:26:37,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 52 [2024-06-27 23:26:37,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:26:37,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:26:37,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 52 [2024-06-27 23:26:37,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:26:38,810 INFO L124 PetriNetUnfolderBase]: 9685/13595 cut-off events. [2024-06-27 23:26:38,810 INFO L125 PetriNetUnfolderBase]: For 7282/7282 co-relation queries the response was YES. [2024-06-27 23:26:38,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34134 conditions, 13595 events. 9685/13595 cut-off events. For 7282/7282 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 75111 event pairs, 5476 based on Foata normal form. 10/13540 useless extension candidates. Maximal degree in co-relation 34120. Up to 12955 conditions per place. [2024-06-27 23:26:38,869 INFO L140 encePairwiseOnDemand]: 39/52 looper letters, 73 selfloop transitions, 21 changer transitions 0/102 dead transitions. [2024-06-27 23:26:38,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 102 transitions, 545 flow [2024-06-27 23:26:38,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:26:38,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:26:38,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2024-06-27 23:26:38,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6423076923076924 [2024-06-27 23:26:38,876 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 179 flow. Second operand 5 states and 167 transitions. [2024-06-27 23:26:38,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 102 transitions, 545 flow [2024-06-27 23:26:38,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 102 transitions, 526 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-27 23:26:38,881 INFO L231 Difference]: Finished difference. Result has 62 places, 64 transitions, 312 flow [2024-06-27 23:26:38,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=62, PETRI_TRANSITIONS=64} [2024-06-27 23:26:38,882 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 7 predicate places. [2024-06-27 23:26:38,882 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 64 transitions, 312 flow [2024-06-27 23:26:38,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:26:38,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:26:38,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:26:38,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 23:26:38,883 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:26:38,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:26:38,884 INFO L85 PathProgramCache]: Analyzing trace with hash -830145722, now seen corresponding path program 1 times [2024-06-27 23:26:38,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:26:38,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819214588] [2024-06-27 23:26:38,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:26:38,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:26:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:26:40,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:26:40,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:26:40,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819214588] [2024-06-27 23:26:40,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819214588] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:26:40,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:26:40,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:26:40,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635345900] [2024-06-27 23:26:40,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:26:40,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:26:40,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:26:40,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:26:40,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:26:40,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2024-06-27 23:26:40,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 64 transitions, 312 flow. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:26:40,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:26:40,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2024-06-27 23:26:40,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:26:42,665 INFO L124 PetriNetUnfolderBase]: 9731/13669 cut-off events. [2024-06-27 23:26:42,665 INFO L125 PetriNetUnfolderBase]: For 17602/17604 co-relation queries the response was YES. [2024-06-27 23:26:42,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40579 conditions, 13669 events. 9731/13669 cut-off events. For 17602/17604 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 75705 event pairs, 4552 based on Foata normal form. 10/13615 useless extension candidates. Maximal degree in co-relation 40561. Up to 12877 conditions per place. [2024-06-27 23:26:42,727 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 88 selfloop transitions, 38 changer transitions 0/133 dead transitions. [2024-06-27 23:26:42,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 133 transitions, 858 flow [2024-06-27 23:26:42,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:26:42,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:26:42,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 211 transitions. [2024-06-27 23:26:42,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5796703296703297 [2024-06-27 23:26:42,729 INFO L175 Difference]: Start difference. First operand has 62 places, 64 transitions, 312 flow. Second operand 7 states and 211 transitions. [2024-06-27 23:26:42,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 133 transitions, 858 flow [2024-06-27 23:26:42,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 133 transitions, 846 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-27 23:26:42,740 INFO L231 Difference]: Finished difference. Result has 72 places, 81 transitions, 552 flow [2024-06-27 23:26:42,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=552, PETRI_PLACES=72, PETRI_TRANSITIONS=81} [2024-06-27 23:26:42,741 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 17 predicate places. [2024-06-27 23:26:42,741 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 81 transitions, 552 flow [2024-06-27 23:26:42,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:26:42,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:26:42,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:26:42,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 23:26:42,742 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:26:42,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:26:42,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1679488596, now seen corresponding path program 1 times [2024-06-27 23:26:42,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:26:42,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308297245] [2024-06-27 23:26:42,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:26:42,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:26:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:26:44,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:26:44,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:26:44,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308297245] [2024-06-27 23:26:44,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308297245] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:26:44,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:26:44,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:26:44,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139786653] [2024-06-27 23:26:44,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:26:44,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:26:44,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:26:44,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:26:44,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:26:44,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2024-06-27 23:26:44,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 81 transitions, 552 flow. Second operand has 8 states, 8 states have (on average 15.125) internal successors, (121), 8 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:26:44,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:26:44,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2024-06-27 23:26:44,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:26:46,434 INFO L124 PetriNetUnfolderBase]: 9918/13995 cut-off events. [2024-06-27 23:26:46,434 INFO L125 PetriNetUnfolderBase]: For 33366/33372 co-relation queries the response was YES. [2024-06-27 23:26:46,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47960 conditions, 13995 events. 9918/13995 cut-off events. For 33366/33372 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 78000 event pairs, 3760 based on Foata normal form. 40/13968 useless extension candidates. Maximal degree in co-relation 47935. Up to 12878 conditions per place. [2024-06-27 23:26:46,524 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 99 selfloop transitions, 41 changer transitions 0/147 dead transitions. [2024-06-27 23:26:46,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 147 transitions, 1094 flow [2024-06-27 23:26:46,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:26:46,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:26:46,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 239 transitions. [2024-06-27 23:26:46,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5745192307692307 [2024-06-27 23:26:46,525 INFO L175 Difference]: Start difference. First operand has 72 places, 81 transitions, 552 flow. Second operand 8 states and 239 transitions. [2024-06-27 23:26:46,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 147 transitions, 1094 flow [2024-06-27 23:26:46,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 147 transitions, 1070 flow, removed 11 selfloop flow, removed 1 redundant places. [2024-06-27 23:26:46,547 INFO L231 Difference]: Finished difference. Result has 78 places, 83 transitions, 647 flow [2024-06-27 23:26:46,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=647, PETRI_PLACES=78, PETRI_TRANSITIONS=83} [2024-06-27 23:26:46,553 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 23 predicate places. [2024-06-27 23:26:46,554 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 83 transitions, 647 flow [2024-06-27 23:26:46,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.125) internal successors, (121), 8 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:26:46,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:26:46,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:26:46,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 23:26:46,555 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:26:46,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:26:46,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1912093606, now seen corresponding path program 1 times [2024-06-27 23:26:46,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:26:46,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760490223] [2024-06-27 23:26:46,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:26:46,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:26:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:26:48,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:26:48,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:26:48,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760490223] [2024-06-27 23:26:48,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760490223] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:26:48,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:26:48,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:26:48,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523698585] [2024-06-27 23:26:48,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:26:48,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:26:48,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:26:48,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:26:48,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:26:48,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2024-06-27 23:26:48,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 83 transitions, 647 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:26:48,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:26:48,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2024-06-27 23:26:48,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:26:50,150 INFO L124 PetriNetUnfolderBase]: 9900/13960 cut-off events. [2024-06-27 23:26:50,150 INFO L125 PetriNetUnfolderBase]: For 42287/42287 co-relation queries the response was YES. [2024-06-27 23:26:50,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50484 conditions, 13960 events. 9900/13960 cut-off events. For 42287/42287 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 77722 event pairs, 4704 based on Foata normal form. 6/13904 useless extension candidates. Maximal degree in co-relation 50456. Up to 13450 conditions per place. [2024-06-27 23:26:50,246 INFO L140 encePairwiseOnDemand]: 41/52 looper letters, 79 selfloop transitions, 15 changer transitions 0/101 dead transitions. [2024-06-27 23:26:50,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 101 transitions, 895 flow [2024-06-27 23:26:50,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:26:50,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:26:50,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2024-06-27 23:26:50,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4551282051282051 [2024-06-27 23:26:50,250 INFO L175 Difference]: Start difference. First operand has 78 places, 83 transitions, 647 flow. Second operand 6 states and 142 transitions. [2024-06-27 23:26:50,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 101 transitions, 895 flow [2024-06-27 23:26:50,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 101 transitions, 794 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-27 23:26:50,272 INFO L231 Difference]: Finished difference. Result has 79 places, 85 transitions, 613 flow [2024-06-27 23:26:50,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=613, PETRI_PLACES=79, PETRI_TRANSITIONS=85} [2024-06-27 23:26:50,273 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 24 predicate places. [2024-06-27 23:26:50,273 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 85 transitions, 613 flow [2024-06-27 23:26:50,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:26:50,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:26:50,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:26:50,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 23:26:50,274 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:26:50,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:26:50,274 INFO L85 PathProgramCache]: Analyzing trace with hash 2491095, now seen corresponding path program 1 times [2024-06-27 23:26:50,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:26:50,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168696830] [2024-06-27 23:26:50,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:26:50,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:26:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:26:51,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:26:51,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:26:51,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168696830] [2024-06-27 23:26:51,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168696830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:26:51,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:26:51,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:26:51,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580228743] [2024-06-27 23:26:51,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:26:51,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:26:51,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:26:51,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:26:51,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:26:51,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2024-06-27 23:26:51,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 85 transitions, 613 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:26:51,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:26:51,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2024-06-27 23:26:51,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:26:53,709 INFO L124 PetriNetUnfolderBase]: 10152/14313 cut-off events. [2024-06-27 23:26:53,709 INFO L125 PetriNetUnfolderBase]: For 48779/48779 co-relation queries the response was YES. [2024-06-27 23:26:53,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52744 conditions, 14313 events. 10152/14313 cut-off events. For 48779/48779 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 79387 event pairs, 4511 based on Foata normal form. 12/14260 useless extension candidates. Maximal degree in co-relation 52714. Up to 13615 conditions per place. [2024-06-27 23:26:53,791 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 98 selfloop transitions, 27 changer transitions 0/132 dead transitions. [2024-06-27 23:26:53,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 132 transitions, 1152 flow [2024-06-27 23:26:53,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:26:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:26:53,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2024-06-27 23:26:53,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4807692307692308 [2024-06-27 23:26:53,792 INFO L175 Difference]: Start difference. First operand has 79 places, 85 transitions, 613 flow. Second operand 7 states and 175 transitions. [2024-06-27 23:26:53,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 132 transitions, 1152 flow [2024-06-27 23:26:53,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 132 transitions, 1108 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 23:26:53,823 INFO L231 Difference]: Finished difference. Result has 83 places, 101 transitions, 827 flow [2024-06-27 23:26:53,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=827, PETRI_PLACES=83, PETRI_TRANSITIONS=101} [2024-06-27 23:26:53,825 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 28 predicate places. [2024-06-27 23:26:53,825 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 101 transitions, 827 flow [2024-06-27 23:26:53,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:26:53,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:26:53,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:26:53,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 23:26:53,826 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:26:53,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:26:53,826 INFO L85 PathProgramCache]: Analyzing trace with hash 13413821, now seen corresponding path program 2 times [2024-06-27 23:26:53,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:26:53,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55994142] [2024-06-27 23:26:53,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:26:53,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:26:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:26:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:26:55,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:26:55,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55994142] [2024-06-27 23:26:55,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55994142] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:26:55,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:26:55,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:26:55,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545491207] [2024-06-27 23:26:55,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:26:55,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:26:55,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:26:55,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:26:55,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:26:55,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2024-06-27 23:26:55,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 101 transitions, 827 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:26:55,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:26:55,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2024-06-27 23:26:55,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:26:57,254 INFO L124 PetriNetUnfolderBase]: 10122/14274 cut-off events. [2024-06-27 23:26:57,255 INFO L125 PetriNetUnfolderBase]: For 56185/56185 co-relation queries the response was YES. [2024-06-27 23:26:57,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54068 conditions, 14274 events. 10122/14274 cut-off events. For 56185/56185 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 79394 event pairs, 4736 based on Foata normal form. 6/14216 useless extension candidates. Maximal degree in co-relation 54037. Up to 13739 conditions per place. [2024-06-27 23:26:57,353 INFO L140 encePairwiseOnDemand]: 39/52 looper letters, 103 selfloop transitions, 16 changer transitions 0/126 dead transitions. [2024-06-27 23:26:57,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 126 transitions, 1143 flow [2024-06-27 23:26:57,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:26:57,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:26:57,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-06-27 23:26:57,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45604395604395603 [2024-06-27 23:26:57,355 INFO L175 Difference]: Start difference. First operand has 83 places, 101 transitions, 827 flow. Second operand 7 states and 166 transitions. [2024-06-27 23:26:57,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 126 transitions, 1143 flow [2024-06-27 23:26:57,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 126 transitions, 1115 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-27 23:26:57,406 INFO L231 Difference]: Finished difference. Result has 87 places, 102 transitions, 858 flow [2024-06-27 23:26:57,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=858, PETRI_PLACES=87, PETRI_TRANSITIONS=102} [2024-06-27 23:26:57,408 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 32 predicate places. [2024-06-27 23:26:57,408 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 102 transitions, 858 flow [2024-06-27 23:26:57,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:26:57,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:26:57,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:26:57,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 23:26:57,409 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:26:57,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:26:57,409 INFO L85 PathProgramCache]: Analyzing trace with hash 627418523, now seen corresponding path program 3 times [2024-06-27 23:26:57,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:26:57,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965136608] [2024-06-27 23:26:57,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:26:57,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:26:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:26:59,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:26:59,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:26:59,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965136608] [2024-06-27 23:26:59,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965136608] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:26:59,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:26:59,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:26:59,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271843320] [2024-06-27 23:26:59,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:26:59,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:26:59,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:26:59,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:26:59,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:26:59,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2024-06-27 23:26:59,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 102 transitions, 858 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:26:59,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:26:59,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2024-06-27 23:26:59,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:27:01,399 INFO L124 PetriNetUnfolderBase]: 10227/14430 cut-off events. [2024-06-27 23:27:01,399 INFO L125 PetriNetUnfolderBase]: For 65526/65526 co-relation queries the response was YES. [2024-06-27 23:27:01,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56057 conditions, 14430 events. 10227/14430 cut-off events. For 65526/65526 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 79960 event pairs, 4466 based on Foata normal form. 6/14377 useless extension candidates. Maximal degree in co-relation 56025. Up to 13648 conditions per place. [2024-06-27 23:27:01,475 INFO L140 encePairwiseOnDemand]: 37/52 looper letters, 115 selfloop transitions, 54 changer transitions 0/176 dead transitions. [2024-06-27 23:27:01,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 176 transitions, 1763 flow [2024-06-27 23:27:01,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:27:01,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:27:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2024-06-27 23:27:01,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5082417582417582 [2024-06-27 23:27:01,476 INFO L175 Difference]: Start difference. First operand has 87 places, 102 transitions, 858 flow. Second operand 7 states and 185 transitions. [2024-06-27 23:27:01,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 176 transitions, 1763 flow [2024-06-27 23:27:01,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 176 transitions, 1703 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-27 23:27:01,520 INFO L231 Difference]: Finished difference. Result has 91 places, 140 transitions, 1431 flow [2024-06-27 23:27:01,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1431, PETRI_PLACES=91, PETRI_TRANSITIONS=140} [2024-06-27 23:27:01,521 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 36 predicate places. [2024-06-27 23:27:01,521 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 140 transitions, 1431 flow [2024-06-27 23:27:01,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:27:01,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:27:01,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:27:01,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 23:27:01,522 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:27:01,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:27:01,522 INFO L85 PathProgramCache]: Analyzing trace with hash 971976047, now seen corresponding path program 1 times [2024-06-27 23:27:01,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:27:01,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181436831] [2024-06-27 23:27:01,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:27:01,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:27:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:27:03,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:27:03,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:27:03,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181436831] [2024-06-27 23:27:03,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181436831] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:27:03,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:27:03,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:27:03,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875185104] [2024-06-27 23:27:03,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:27:03,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:27:03,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:27:03,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:27:03,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:27:04,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2024-06-27 23:27:04,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 140 transitions, 1431 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:27:04,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:27:04,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2024-06-27 23:27:04,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:27:06,779 INFO L124 PetriNetUnfolderBase]: 12531/17502 cut-off events. [2024-06-27 23:27:06,779 INFO L125 PetriNetUnfolderBase]: For 92565/92565 co-relation queries the response was YES. [2024-06-27 23:27:06,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70388 conditions, 17502 events. 12531/17502 cut-off events. For 92565/92565 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 96386 event pairs, 5618 based on Foata normal form. 6/17472 useless extension candidates. Maximal degree in co-relation 70353. Up to 16912 conditions per place. [2024-06-27 23:27:06,907 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 149 selfloop transitions, 24 changer transitions 0/179 dead transitions. [2024-06-27 23:27:06,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 179 transitions, 1951 flow [2024-06-27 23:27:06,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:27:06,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:27:06,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 184 transitions. [2024-06-27 23:27:06,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4423076923076923 [2024-06-27 23:27:06,909 INFO L175 Difference]: Start difference. First operand has 91 places, 140 transitions, 1431 flow. Second operand 8 states and 184 transitions. [2024-06-27 23:27:06,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 179 transitions, 1951 flow [2024-06-27 23:27:07,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 179 transitions, 1917 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-06-27 23:27:07,021 INFO L231 Difference]: Finished difference. Result has 98 places, 149 transitions, 1558 flow [2024-06-27 23:27:07,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1400, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1558, PETRI_PLACES=98, PETRI_TRANSITIONS=149} [2024-06-27 23:27:07,022 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 43 predicate places. [2024-06-27 23:27:07,022 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 149 transitions, 1558 flow [2024-06-27 23:27:07,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:27:07,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:27:07,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:27:07,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 23:27:07,023 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:27:07,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:27:07,023 INFO L85 PathProgramCache]: Analyzing trace with hash -529356780, now seen corresponding path program 1 times [2024-06-27 23:27:07,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:27:07,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892151349] [2024-06-27 23:27:07,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:27:07,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:27:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:27:08,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:27:08,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:27:08,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892151349] [2024-06-27 23:27:08,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892151349] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:27:08,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:27:08,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:27:08,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112370241] [2024-06-27 23:27:08,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:27:08,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:27:08,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:27:08,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:27:08,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:27:08,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 23:27:08,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 149 transitions, 1558 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:27:08,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:27:08,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 23:27:08,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:27:11,306 INFO L124 PetriNetUnfolderBase]: 14209/19469 cut-off events. [2024-06-27 23:27:11,307 INFO L125 PetriNetUnfolderBase]: For 124644/124644 co-relation queries the response was YES. [2024-06-27 23:27:11,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82735 conditions, 19469 events. 14209/19469 cut-off events. For 124644/124644 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 103361 event pairs, 6603 based on Foata normal form. 4/19471 useless extension candidates. Maximal degree in co-relation 82697. Up to 19194 conditions per place. [2024-06-27 23:27:11,430 INFO L140 encePairwiseOnDemand]: 42/52 looper letters, 150 selfloop transitions, 12 changer transitions 0/167 dead transitions. [2024-06-27 23:27:11,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 167 transitions, 1968 flow [2024-06-27 23:27:11,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:27:11,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:27:11,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2024-06-27 23:27:11,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-27 23:27:11,431 INFO L175 Difference]: Start difference. First operand has 98 places, 149 transitions, 1558 flow. Second operand 5 states and 117 transitions. [2024-06-27 23:27:11,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 167 transitions, 1968 flow [2024-06-27 23:27:11,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 167 transitions, 1900 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-27 23:27:11,545 INFO L231 Difference]: Finished difference. Result has 98 places, 153 transitions, 1571 flow [2024-06-27 23:27:11,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1571, PETRI_PLACES=98, PETRI_TRANSITIONS=153} [2024-06-27 23:27:11,546 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 43 predicate places. [2024-06-27 23:27:11,546 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 153 transitions, 1571 flow [2024-06-27 23:27:11,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:27:11,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:27:11,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:27:11,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 23:27:11,547 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:27:11,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:27:11,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1904796874, now seen corresponding path program 1 times [2024-06-27 23:27:11,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:27:11,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772327284] [2024-06-27 23:27:11,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:27:11,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:27:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:27:13,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:27:13,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:27:13,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772327284] [2024-06-27 23:27:13,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772327284] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:27:13,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:27:13,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:27:13,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205673847] [2024-06-27 23:27:13,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:27:13,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:27:13,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:27:13,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:27:13,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:27:13,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2024-06-27 23:27:13,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 153 transitions, 1571 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:27:13,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:27:13,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2024-06-27 23:27:13,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:27:16,250 INFO L124 PetriNetUnfolderBase]: 12439/17601 cut-off events. [2024-06-27 23:27:16,250 INFO L125 PetriNetUnfolderBase]: For 128546/128564 co-relation queries the response was YES. [2024-06-27 23:27:16,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78101 conditions, 17601 events. 12439/17601 cut-off events. For 128546/128564 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 100155 event pairs, 5156 based on Foata normal form. 12/17554 useless extension candidates. Maximal degree in co-relation 78061. Up to 16348 conditions per place. [2024-06-27 23:27:16,587 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 140 selfloop transitions, 63 changer transitions 0/211 dead transitions. [2024-06-27 23:27:16,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 211 transitions, 2406 flow [2024-06-27 23:27:16,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:27:16,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:27:16,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions. [2024-06-27 23:27:16,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49278846153846156 [2024-06-27 23:27:16,589 INFO L175 Difference]: Start difference. First operand has 98 places, 153 transitions, 1571 flow. Second operand 8 states and 205 transitions. [2024-06-27 23:27:16,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 211 transitions, 2406 flow [2024-06-27 23:27:16,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 211 transitions, 2371 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-27 23:27:16,690 INFO L231 Difference]: Finished difference. Result has 105 places, 168 transitions, 1866 flow [2024-06-27 23:27:16,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1866, PETRI_PLACES=105, PETRI_TRANSITIONS=168} [2024-06-27 23:27:16,691 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 50 predicate places. [2024-06-27 23:27:16,691 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 168 transitions, 1866 flow [2024-06-27 23:27:16,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:27:16,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:27:16,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:27:16,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 23:27:16,692 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:27:16,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:27:16,692 INFO L85 PathProgramCache]: Analyzing trace with hash -859165250, now seen corresponding path program 2 times [2024-06-27 23:27:16,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:27:16,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436864435] [2024-06-27 23:27:16,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:27:16,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:27:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:27:18,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:27:18,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:27:18,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436864435] [2024-06-27 23:27:18,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436864435] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:27:18,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:27:18,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:27:18,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312152174] [2024-06-27 23:27:18,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:27:18,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:27:18,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:27:18,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:27:18,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:27:18,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2024-06-27 23:27:18,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 168 transitions, 1866 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:27:18,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:27:18,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2024-06-27 23:27:18,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:27:21,135 INFO L124 PetriNetUnfolderBase]: 12406/17598 cut-off events. [2024-06-27 23:27:21,135 INFO L125 PetriNetUnfolderBase]: For 152115/152124 co-relation queries the response was YES. [2024-06-27 23:27:21,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82680 conditions, 17598 events. 12406/17598 cut-off events. For 152115/152124 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 100167 event pairs, 5114 based on Foata normal form. 12/17551 useless extension candidates. Maximal degree in co-relation 82636. Up to 16449 conditions per place. [2024-06-27 23:27:21,267 INFO L140 encePairwiseOnDemand]: 37/52 looper letters, 139 selfloop transitions, 62 changer transitions 0/209 dead transitions. [2024-06-27 23:27:21,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 209 transitions, 2526 flow [2024-06-27 23:27:21,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:27:21,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:27:21,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions. [2024-06-27 23:27:21,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5137362637362637 [2024-06-27 23:27:21,269 INFO L175 Difference]: Start difference. First operand has 105 places, 168 transitions, 1866 flow. Second operand 7 states and 187 transitions. [2024-06-27 23:27:21,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 209 transitions, 2526 flow [2024-06-27 23:27:21,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 209 transitions, 2451 flow, removed 28 selfloop flow, removed 3 redundant places. [2024-06-27 23:27:21,462 INFO L231 Difference]: Finished difference. Result has 110 places, 171 transitions, 1980 flow [2024-06-27 23:27:21,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1791, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1980, PETRI_PLACES=110, PETRI_TRANSITIONS=171} [2024-06-27 23:27:21,462 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 55 predicate places. [2024-06-27 23:27:21,462 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 171 transitions, 1980 flow [2024-06-27 23:27:21,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:27:21,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:27:21,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:27:21,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 23:27:21,463 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:27:21,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:27:21,463 INFO L85 PathProgramCache]: Analyzing trace with hash 839554362, now seen corresponding path program 1 times [2024-06-27 23:27:21,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:27:21,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363373851] [2024-06-27 23:27:21,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:27:21,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:27:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:27:23,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:27:23,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:27:23,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363373851] [2024-06-27 23:27:23,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363373851] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:27:23,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:27:23,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:27:23,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541394203] [2024-06-27 23:27:23,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:27:23,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:27:23,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:27:23,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:27:23,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:27:23,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 23:27:23,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 171 transitions, 1980 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:27:23,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:27:23,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 23:27:23,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:27:26,285 INFO L124 PetriNetUnfolderBase]: 15232/21202 cut-off events. [2024-06-27 23:27:26,285 INFO L125 PetriNetUnfolderBase]: For 199879/199879 co-relation queries the response was YES. [2024-06-27 23:27:26,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100414 conditions, 21202 events. 15232/21202 cut-off events. For 199879/199879 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 115832 event pairs, 6844 based on Foata normal form. 3/21203 useless extension candidates. Maximal degree in co-relation 100367. Up to 20476 conditions per place. [2024-06-27 23:27:26,430 INFO L140 encePairwiseOnDemand]: 36/52 looper letters, 179 selfloop transitions, 33 changer transitions 0/217 dead transitions. [2024-06-27 23:27:26,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 217 transitions, 2664 flow [2024-06-27 23:27:26,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:27:26,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:27:26,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2024-06-27 23:27:26,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4543269230769231 [2024-06-27 23:27:26,432 INFO L175 Difference]: Start difference. First operand has 110 places, 171 transitions, 1980 flow. Second operand 8 states and 189 transitions. [2024-06-27 23:27:26,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 217 transitions, 2664 flow [2024-06-27 23:27:26,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 217 transitions, 2539 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-27 23:27:26,691 INFO L231 Difference]: Finished difference. Result has 114 places, 178 transitions, 2070 flow [2024-06-27 23:27:26,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1867, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2070, PETRI_PLACES=114, PETRI_TRANSITIONS=178} [2024-06-27 23:27:26,691 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 59 predicate places. [2024-06-27 23:27:26,691 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 178 transitions, 2070 flow [2024-06-27 23:27:26,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:27:26,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:27:26,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:27:26,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 23:27:26,692 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:27:26,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:27:26,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1478485092, now seen corresponding path program 3 times [2024-06-27 23:27:26,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:27:26,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797580854] [2024-06-27 23:27:26,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:27:26,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:27:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:27:28,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:27:28,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:27:28,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797580854] [2024-06-27 23:27:28,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797580854] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:27:28,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:27:28,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:27:28,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651753229] [2024-06-27 23:27:28,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:27:28,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:27:28,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:27:28,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:27:28,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:27:28,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2024-06-27 23:27:28,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 178 transitions, 2070 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:27:28,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:27:28,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2024-06-27 23:27:28,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:27:31,654 INFO L124 PetriNetUnfolderBase]: 12544/17761 cut-off events. [2024-06-27 23:27:31,654 INFO L125 PetriNetUnfolderBase]: For 185805/185862 co-relation queries the response was YES. [2024-06-27 23:27:31,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86653 conditions, 17761 events. 12544/17761 cut-off events. For 185805/185862 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 101204 event pairs, 4971 based on Foata normal form. 39/17738 useless extension candidates. Maximal degree in co-relation 86605. Up to 16059 conditions per place. [2024-06-27 23:27:31,800 INFO L140 encePairwiseOnDemand]: 39/52 looper letters, 131 selfloop transitions, 94 changer transitions 0/233 dead transitions. [2024-06-27 23:27:31,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 233 transitions, 2968 flow [2024-06-27 23:27:31,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:27:31,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:27:31,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 201 transitions. [2024-06-27 23:27:31,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5521978021978022 [2024-06-27 23:27:31,802 INFO L175 Difference]: Start difference. First operand has 114 places, 178 transitions, 2070 flow. Second operand 7 states and 201 transitions. [2024-06-27 23:27:31,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 233 transitions, 2968 flow [2024-06-27 23:27:32,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 233 transitions, 2854 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-27 23:27:32,053 INFO L231 Difference]: Finished difference. Result has 117 places, 190 transitions, 2338 flow [2024-06-27 23:27:32,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1956, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2338, PETRI_PLACES=117, PETRI_TRANSITIONS=190} [2024-06-27 23:27:32,054 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 62 predicate places. [2024-06-27 23:27:32,054 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 190 transitions, 2338 flow [2024-06-27 23:27:32,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:27:32,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:27:32,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:27:32,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 23:27:32,054 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:27:32,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:27:32,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1501668132, now seen corresponding path program 4 times [2024-06-27 23:27:32,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:27:32,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195261642] [2024-06-27 23:27:32,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:27:32,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:27:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:27:34,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:27:34,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:27:34,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195261642] [2024-06-27 23:27:34,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195261642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:27:34,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:27:34,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:27:34,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326113839] [2024-06-27 23:27:34,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:27:34,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:27:34,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:27:34,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:27:34,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:27:34,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2024-06-27 23:27:34,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 190 transitions, 2338 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:27:34,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:27:34,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2024-06-27 23:27:34,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:27:36,969 INFO L124 PetriNetUnfolderBase]: 12473/17673 cut-off events. [2024-06-27 23:27:36,969 INFO L125 PetriNetUnfolderBase]: For 214330/214370 co-relation queries the response was YES. [2024-06-27 23:27:37,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90467 conditions, 17673 events. 12473/17673 cut-off events. For 214330/214370 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 100795 event pairs, 5040 based on Foata normal form. 37/17653 useless extension candidates. Maximal degree in co-relation 90416. Up to 16232 conditions per place. [2024-06-27 23:27:37,109 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 130 selfloop transitions, 87 changer transitions 0/225 dead transitions. [2024-06-27 23:27:37,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 225 transitions, 2906 flow [2024-06-27 23:27:37,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:27:37,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:27:37,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 195 transitions. [2024-06-27 23:27:37,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2024-06-27 23:27:37,111 INFO L175 Difference]: Start difference. First operand has 117 places, 190 transitions, 2338 flow. Second operand 7 states and 195 transitions. [2024-06-27 23:27:37,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 225 transitions, 2906 flow [2024-06-27 23:27:37,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 225 transitions, 2762 flow, removed 33 selfloop flow, removed 4 redundant places. [2024-06-27 23:27:37,365 INFO L231 Difference]: Finished difference. Result has 121 places, 190 transitions, 2425 flow [2024-06-27 23:27:37,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2194, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2425, PETRI_PLACES=121, PETRI_TRANSITIONS=190} [2024-06-27 23:27:37,365 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 66 predicate places. [2024-06-27 23:27:37,365 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 190 transitions, 2425 flow [2024-06-27 23:27:37,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:27:37,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:27:37,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:27:37,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 23:27:37,366 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:27:37,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:27:37,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1080779830, now seen corresponding path program 1 times [2024-06-27 23:27:37,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:27:37,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059927153] [2024-06-27 23:27:37,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:27:37,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:27:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:27:39,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:27:39,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:27:39,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059927153] [2024-06-27 23:27:39,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059927153] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:27:39,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:27:39,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:27:39,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149762542] [2024-06-27 23:27:39,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:27:39,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:27:39,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:27:39,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:27:39,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:27:39,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2024-06-27 23:27:39,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 190 transitions, 2425 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:27:39,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:27:39,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2024-06-27 23:27:39,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:27:42,895 INFO L124 PetriNetUnfolderBase]: 13100/18465 cut-off events. [2024-06-27 23:27:42,895 INFO L125 PetriNetUnfolderBase]: For 249888/249921 co-relation queries the response was YES. [2024-06-27 23:27:42,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97170 conditions, 18465 events. 13100/18465 cut-off events. For 249888/249921 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 105686 event pairs, 4899 based on Foata normal form. 45/18419 useless extension candidates. Maximal degree in co-relation 97117. Up to 16600 conditions per place. [2024-06-27 23:27:43,281 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 176 selfloop transitions, 67 changer transitions 0/251 dead transitions. [2024-06-27 23:27:43,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 251 transitions, 3329 flow [2024-06-27 23:27:43,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:27:43,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:27:43,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 230 transitions. [2024-06-27 23:27:43,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49145299145299143 [2024-06-27 23:27:43,283 INFO L175 Difference]: Start difference. First operand has 121 places, 190 transitions, 2425 flow. Second operand 9 states and 230 transitions. [2024-06-27 23:27:43,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 251 transitions, 3329 flow [2024-06-27 23:27:43,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 251 transitions, 3087 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-27 23:27:43,519 INFO L231 Difference]: Finished difference. Result has 125 places, 197 transitions, 2465 flow [2024-06-27 23:27:43,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2203, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2465, PETRI_PLACES=125, PETRI_TRANSITIONS=197} [2024-06-27 23:27:43,519 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 70 predicate places. [2024-06-27 23:27:43,520 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 197 transitions, 2465 flow [2024-06-27 23:27:43,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:27:43,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:27:43,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:27:43,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 23:27:43,520 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:27:43,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:27:43,521 INFO L85 PathProgramCache]: Analyzing trace with hash -867114254, now seen corresponding path program 2 times [2024-06-27 23:27:43,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:27:43,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536772692] [2024-06-27 23:27:43,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:27:43,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:27:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:27:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:27:45,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:27:45,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536772692] [2024-06-27 23:27:45,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536772692] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:27:45,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:27:45,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:27:45,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153092875] [2024-06-27 23:27:45,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:27:45,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:27:45,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:27:45,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:27:45,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:27:45,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2024-06-27 23:27:45,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 197 transitions, 2465 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:27:45,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:27:45,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2024-06-27 23:27:45,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:27:48,729 INFO L124 PetriNetUnfolderBase]: 13298/18815 cut-off events. [2024-06-27 23:27:48,729 INFO L125 PetriNetUnfolderBase]: For 222745/222786 co-relation queries the response was YES. [2024-06-27 23:27:48,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98018 conditions, 18815 events. 13298/18815 cut-off events. For 222745/222786 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 108343 event pairs, 5214 based on Foata normal form. 42/18778 useless extension candidates. Maximal degree in co-relation 97964. Up to 17371 conditions per place. [2024-06-27 23:27:48,898 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 165 selfloop transitions, 77 changer transitions 0/250 dead transitions. [2024-06-27 23:27:48,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 250 transitions, 3287 flow [2024-06-27 23:27:48,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:27:48,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:27:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 216 transitions. [2024-06-27 23:27:48,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2024-06-27 23:27:48,900 INFO L175 Difference]: Start difference. First operand has 125 places, 197 transitions, 2465 flow. Second operand 8 states and 216 transitions. [2024-06-27 23:27:48,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 250 transitions, 3287 flow [2024-06-27 23:27:49,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 250 transitions, 3253 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-27 23:27:49,164 INFO L231 Difference]: Finished difference. Result has 130 places, 199 transitions, 2643 flow [2024-06-27 23:27:49,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2431, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2643, PETRI_PLACES=130, PETRI_TRANSITIONS=199} [2024-06-27 23:27:49,164 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 75 predicate places. [2024-06-27 23:27:49,164 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 199 transitions, 2643 flow [2024-06-27 23:27:49,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:27:49,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:27:49,165 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:27:49,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 23:27:49,165 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:27:49,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:27:49,165 INFO L85 PathProgramCache]: Analyzing trace with hash 2030737292, now seen corresponding path program 3 times [2024-06-27 23:27:49,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:27:49,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935283685] [2024-06-27 23:27:49,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:27:49,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:27:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:27:51,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:27:51,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:27:51,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935283685] [2024-06-27 23:27:51,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935283685] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:27:51,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:27:51,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:27:51,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219467793] [2024-06-27 23:27:51,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:27:51,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:27:51,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:27:51,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:27:51,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:27:51,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2024-06-27 23:27:51,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 199 transitions, 2643 flow. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:27:51,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:27:51,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2024-06-27 23:27:51,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:27:54,745 INFO L124 PetriNetUnfolderBase]: 13217/18728 cut-off events. [2024-06-27 23:27:54,746 INFO L125 PetriNetUnfolderBase]: For 239543/239572 co-relation queries the response was YES. [2024-06-27 23:27:54,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98820 conditions, 18728 events. 13217/18728 cut-off events. For 239543/239572 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 107899 event pairs, 5125 based on Foata normal form. 57/18706 useless extension candidates. Maximal degree in co-relation 98764. Up to 17438 conditions per place. [2024-06-27 23:27:54,884 INFO L140 encePairwiseOnDemand]: 37/52 looper letters, 177 selfloop transitions, 60 changer transitions 0/245 dead transitions. [2024-06-27 23:27:54,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 245 transitions, 3313 flow [2024-06-27 23:27:54,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:27:54,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:27:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 222 transitions. [2024-06-27 23:27:54,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47435897435897434 [2024-06-27 23:27:54,886 INFO L175 Difference]: Start difference. First operand has 130 places, 199 transitions, 2643 flow. Second operand 9 states and 222 transitions. [2024-06-27 23:27:54,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 245 transitions, 3313 flow [2024-06-27 23:27:55,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 245 transitions, 3131 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-27 23:27:55,234 INFO L231 Difference]: Finished difference. Result has 133 places, 199 transitions, 2591 flow [2024-06-27 23:27:55,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2461, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2591, PETRI_PLACES=133, PETRI_TRANSITIONS=199} [2024-06-27 23:27:55,235 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 78 predicate places. [2024-06-27 23:27:55,235 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 199 transitions, 2591 flow [2024-06-27 23:27:55,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:27:55,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:27:55,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:27:55,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 23:27:55,235 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:27:55,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:27:55,236 INFO L85 PathProgramCache]: Analyzing trace with hash -748841876, now seen corresponding path program 1 times [2024-06-27 23:27:55,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:27:55,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554188555] [2024-06-27 23:27:55,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:27:55,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:27:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:27:57,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:27:57,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:27:57,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554188555] [2024-06-27 23:27:57,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554188555] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:27:57,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:27:57,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:27:57,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20500391] [2024-06-27 23:27:57,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:27:57,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:27:57,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:27:57,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:27:57,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:27:57,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2024-06-27 23:27:57,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 199 transitions, 2591 flow. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:27:57,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:27:57,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2024-06-27 23:27:57,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:28:00,418 INFO L124 PetriNetUnfolderBase]: 13707/19293 cut-off events. [2024-06-27 23:28:00,418 INFO L125 PetriNetUnfolderBase]: For 255809/255811 co-relation queries the response was YES. [2024-06-27 23:28:00,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102497 conditions, 19293 events. 13707/19293 cut-off events. For 255809/255811 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 108053 event pairs, 5301 based on Foata normal form. 14/19301 useless extension candidates. Maximal degree in co-relation 102440. Up to 18073 conditions per place. [2024-06-27 23:28:00,612 INFO L140 encePairwiseOnDemand]: 37/52 looper letters, 179 selfloop transitions, 75 changer transitions 0/260 dead transitions. [2024-06-27 23:28:00,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 260 transitions, 3601 flow [2024-06-27 23:28:00,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:28:00,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:28:00,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2024-06-27 23:28:00,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2024-06-27 23:28:00,613 INFO L175 Difference]: Start difference. First operand has 133 places, 199 transitions, 2591 flow. Second operand 9 states and 216 transitions. [2024-06-27 23:28:00,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 260 transitions, 3601 flow [2024-06-27 23:28:01,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 260 transitions, 3442 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-27 23:28:01,015 INFO L231 Difference]: Finished difference. Result has 136 places, 215 transitions, 2943 flow [2024-06-27 23:28:01,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2461, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2943, PETRI_PLACES=136, PETRI_TRANSITIONS=215} [2024-06-27 23:28:01,015 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 81 predicate places. [2024-06-27 23:28:01,016 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 215 transitions, 2943 flow [2024-06-27 23:28:01,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:28:01,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:28:01,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:28:01,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 23:28:01,016 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:28:01,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:28:01,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1189476567, now seen corresponding path program 1 times [2024-06-27 23:28:01,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:28:01,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124767757] [2024-06-27 23:28:01,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:28:01,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:28:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:28:02,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:28:02,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:28:02,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124767757] [2024-06-27 23:28:02,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124767757] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:28:02,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:28:02,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:28:02,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589465343] [2024-06-27 23:28:02,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:28:02,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:28:02,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:28:02,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:28:02,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:28:02,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2024-06-27 23:28:02,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 215 transitions, 2943 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:28:02,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:28:02,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2024-06-27 23:28:02,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:28:05,973 INFO L124 PetriNetUnfolderBase]: 13746/19356 cut-off events. [2024-06-27 23:28:05,974 INFO L125 PetriNetUnfolderBase]: For 283407/283411 co-relation queries the response was YES. [2024-06-27 23:28:06,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107345 conditions, 19356 events. 13746/19356 cut-off events. For 283407/283411 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 108363 event pairs, 5308 based on Foata normal form. 6/19358 useless extension candidates. Maximal degree in co-relation 107286. Up to 18698 conditions per place. [2024-06-27 23:28:06,172 INFO L140 encePairwiseOnDemand]: 41/52 looper letters, 220 selfloop transitions, 26 changer transitions 0/252 dead transitions. [2024-06-27 23:28:06,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 252 transitions, 3721 flow [2024-06-27 23:28:06,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:28:06,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:28:06,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-06-27 23:28:06,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47435897435897434 [2024-06-27 23:28:06,173 INFO L175 Difference]: Start difference. First operand has 136 places, 215 transitions, 2943 flow. Second operand 6 states and 148 transitions. [2024-06-27 23:28:06,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 252 transitions, 3721 flow [2024-06-27 23:28:06,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 252 transitions, 3532 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-27 23:28:06,614 INFO L231 Difference]: Finished difference. Result has 138 places, 228 transitions, 2987 flow [2024-06-27 23:28:06,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2754, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2987, PETRI_PLACES=138, PETRI_TRANSITIONS=228} [2024-06-27 23:28:06,615 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 83 predicate places. [2024-06-27 23:28:06,615 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 228 transitions, 2987 flow [2024-06-27 23:28:06,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:28:06,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:28:06,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:28:06,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 23:28:06,616 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:28:06,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:28:06,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1061504804, now seen corresponding path program 2 times [2024-06-27 23:28:06,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:28:06,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290859026] [2024-06-27 23:28:06,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:28:06,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:28:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:28:08,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:28:08,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:28:08,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290859026] [2024-06-27 23:28:08,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290859026] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:28:08,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:28:08,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:28:08,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592612317] [2024-06-27 23:28:08,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:28:08,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:28:08,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:28:08,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:28:08,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:28:09,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2024-06-27 23:28:09,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 228 transitions, 2987 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:28:09,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:28:09,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2024-06-27 23:28:09,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:28:12,712 INFO L124 PetriNetUnfolderBase]: 13832/19464 cut-off events. [2024-06-27 23:28:12,712 INFO L125 PetriNetUnfolderBase]: For 315779/315779 co-relation queries the response was YES. [2024-06-27 23:28:12,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111393 conditions, 19464 events. 13832/19464 cut-off events. For 315779/315779 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 108693 event pairs, 5340 based on Foata normal form. 6/19467 useless extension candidates. Maximal degree in co-relation 111330. Up to 18656 conditions per place. [2024-06-27 23:28:12,841 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 241 selfloop transitions, 45 changer transitions 0/292 dead transitions. [2024-06-27 23:28:12,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 292 transitions, 4079 flow [2024-06-27 23:28:12,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:28:12,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:28:12,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2024-06-27 23:28:12,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4735576923076923 [2024-06-27 23:28:12,843 INFO L175 Difference]: Start difference. First operand has 138 places, 228 transitions, 2987 flow. Second operand 8 states and 197 transitions. [2024-06-27 23:28:12,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 292 transitions, 4079 flow [2024-06-27 23:28:13,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 292 transitions, 4036 flow, removed 20 selfloop flow, removed 1 redundant places. [2024-06-27 23:28:13,213 INFO L231 Difference]: Finished difference. Result has 146 places, 245 transitions, 3372 flow [2024-06-27 23:28:13,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2944, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3372, PETRI_PLACES=146, PETRI_TRANSITIONS=245} [2024-06-27 23:28:13,213 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 91 predicate places. [2024-06-27 23:28:13,213 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 245 transitions, 3372 flow [2024-06-27 23:28:13,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:28:13,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:28:13,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:28:13,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 23:28:13,214 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:28:13,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:28:13,214 INFO L85 PathProgramCache]: Analyzing trace with hash -369932352, now seen corresponding path program 3 times [2024-06-27 23:28:13,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:28:13,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921896374] [2024-06-27 23:28:13,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:28:13,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:28:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:28:15,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:28:15,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:28:15,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921896374] [2024-06-27 23:28:15,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921896374] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:28:15,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:28:15,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:28:15,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767085995] [2024-06-27 23:28:15,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:28:15,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:28:15,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:28:15,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:28:15,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:28:15,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2024-06-27 23:28:15,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 245 transitions, 3372 flow. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:28:15,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:28:15,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2024-06-27 23:28:15,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:28:18,873 INFO L124 PetriNetUnfolderBase]: 13916/19584 cut-off events. [2024-06-27 23:28:18,873 INFO L125 PetriNetUnfolderBase]: For 354729/354729 co-relation queries the response was YES. [2024-06-27 23:28:18,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116529 conditions, 19584 events. 13916/19584 cut-off events. For 354729/354729 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 109474 event pairs, 5349 based on Foata normal form. 6/19587 useless extension candidates. Maximal degree in co-relation 116462. Up to 18814 conditions per place. [2024-06-27 23:28:19,013 INFO L140 encePairwiseOnDemand]: 36/52 looper letters, 248 selfloop transitions, 42 changer transitions 0/296 dead transitions. [2024-06-27 23:28:19,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 296 transitions, 4314 flow [2024-06-27 23:28:19,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:28:19,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:28:19,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2024-06-27 23:28:19,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47115384615384615 [2024-06-27 23:28:19,015 INFO L175 Difference]: Start difference. First operand has 146 places, 245 transitions, 3372 flow. Second operand 8 states and 196 transitions. [2024-06-27 23:28:19,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 296 transitions, 4314 flow [2024-06-27 23:28:19,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 296 transitions, 4110 flow, removed 54 selfloop flow, removed 5 redundant places. [2024-06-27 23:28:19,462 INFO L231 Difference]: Finished difference. Result has 150 places, 256 transitions, 3516 flow [2024-06-27 23:28:19,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=3234, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3516, PETRI_PLACES=150, PETRI_TRANSITIONS=256} [2024-06-27 23:28:19,463 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 95 predicate places. [2024-06-27 23:28:19,463 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 256 transitions, 3516 flow [2024-06-27 23:28:19,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:28:19,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:28:19,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:28:19,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 23:28:19,464 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:28:19,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:28:19,464 INFO L85 PathProgramCache]: Analyzing trace with hash -140013102, now seen corresponding path program 4 times [2024-06-27 23:28:19,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:28:19,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905921225] [2024-06-27 23:28:19,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:28:19,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:28:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:28:21,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:28:21,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:28:21,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905921225] [2024-06-27 23:28:21,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905921225] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:28:21,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:28:21,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 23:28:21,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278397610] [2024-06-27 23:28:21,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:28:21,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 23:28:21,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:28:21,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 23:28:21,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 23:28:21,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2024-06-27 23:28:21,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 256 transitions, 3516 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:28:21,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:28:21,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2024-06-27 23:28:21,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:28:25,423 INFO L124 PetriNetUnfolderBase]: 13952/19636 cut-off events. [2024-06-27 23:28:25,423 INFO L125 PetriNetUnfolderBase]: For 390143/390143 co-relation queries the response was YES. [2024-06-27 23:28:25,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119689 conditions, 19636 events. 13952/19636 cut-off events. For 390143/390143 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 109679 event pairs, 5357 based on Foata normal form. 6/19639 useless extension candidates. Maximal degree in co-relation 119620. Up to 18806 conditions per place. [2024-06-27 23:28:25,585 INFO L140 encePairwiseOnDemand]: 36/52 looper letters, 247 selfloop transitions, 53 changer transitions 0/306 dead transitions. [2024-06-27 23:28:25,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 306 transitions, 4365 flow [2024-06-27 23:28:25,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 23:28:25,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 23:28:25,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 231 transitions. [2024-06-27 23:28:25,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4442307692307692 [2024-06-27 23:28:25,587 INFO L175 Difference]: Start difference. First operand has 150 places, 256 transitions, 3516 flow. Second operand 10 states and 231 transitions. [2024-06-27 23:28:25,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 306 transitions, 4365 flow [2024-06-27 23:28:26,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 306 transitions, 4265 flow, removed 26 selfloop flow, removed 4 redundant places. [2024-06-27 23:28:26,063 INFO L231 Difference]: Finished difference. Result has 156 places, 259 transitions, 3616 flow [2024-06-27 23:28:26,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=3416, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3616, PETRI_PLACES=156, PETRI_TRANSITIONS=259} [2024-06-27 23:28:26,063 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 101 predicate places. [2024-06-27 23:28:26,063 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 259 transitions, 3616 flow [2024-06-27 23:28:26,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:28:26,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:28:26,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:28:26,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 23:28:26,064 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:28:26,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:28:26,064 INFO L85 PathProgramCache]: Analyzing trace with hash -140013350, now seen corresponding path program 1 times [2024-06-27 23:28:26,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:28:26,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4351402] [2024-06-27 23:28:26,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:28:26,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:28:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:28:27,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:28:27,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:28:27,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4351402] [2024-06-27 23:28:27,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4351402] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:28:27,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:28:27,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:28:27,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966606217] [2024-06-27 23:28:27,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:28:27,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:28:27,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:28:27,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:28:27,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:28:28,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2024-06-27 23:28:28,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 259 transitions, 3616 flow. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:28:28,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:28:28,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2024-06-27 23:28:28,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand