./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix052_power.oepc_power.opt_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-05-21_14-57-05.files/mutex-meet/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 76401ed0 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/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix052_power.oepc_power.opt_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-76401ed-m [2024-06-20 19:16:23,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-20 19:16:23,193 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-20 19:16:23,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-20 19:16:23,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-20 19:16:23,230 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-20 19:16:23,233 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-20 19:16:23,233 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-20 19:16:23,241 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-20 19:16:23,246 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-20 19:16:23,246 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-20 19:16:23,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-20 19:16:23,247 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-20 19:16:23,247 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-20 19:16:23,247 INFO L153 SettingsManager]: * Use SBE=true [2024-06-20 19:16:23,247 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-20 19:16:23,248 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-20 19:16:23,248 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-20 19:16:23,248 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-20 19:16:23,248 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-20 19:16:23,248 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-20 19:16:23,249 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-20 19:16:23,249 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-20 19:16:23,249 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-20 19:16:23,249 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-20 19:16:23,250 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-20 19:16:23,250 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-20 19:16:23,250 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-20 19:16:23,251 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-20 19:16:23,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-20 19:16:23,252 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-20 19:16:23,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-20 19:16:23,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 19:16:23,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-20 19:16:23,252 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-20 19:16:23,253 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-20 19:16:23,253 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-20 19:16:23,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-20 19:16:23,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-20 19:16:23,253 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-20 19:16:23,253 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-20 19:16:23,254 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-20 19:16:23,254 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-20 19:16:23,254 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-20 19:16:23,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-20 19:16:23,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-20 19:16:23,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-20 19:16:23,439 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-20 19:16:23,439 INFO L274 PluginConnector]: CDTParser initialized [2024-06-20 19:16:23,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-06-20 19:16:24,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-20 19:16:24,721 INFO L384 CDTParser]: Found 1 translation units. [2024-06-20 19:16:24,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-06-20 19:16:24,731 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1806de631/dc5ee2cf91314716893508cbea60c7b2/FLAG7c38865c5 [2024-06-20 19:16:24,741 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1806de631/dc5ee2cf91314716893508cbea60c7b2 [2024-06-20 19:16:24,743 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-20 19:16:24,743 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-20 19:16:24,744 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-20 19:16:24,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-20 19:16:24,924 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-20 19:16:24,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-20 19:16:24,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-20 19:16:24,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-20 19:16:24,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:16:24" (1/2) ... [2024-06-20 19:16:24,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@714724b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:16:24, skipping insertion in model container [2024-06-20 19:16:24,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:16:24" (1/2) ... [2024-06-20 19:16:24,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2520741b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:16:24, skipping insertion in model container [2024-06-20 19:16:24,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:16:24" (2/2) ... [2024-06-20 19:16:24,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@714724b0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:24, skipping insertion in model container [2024-06-20 19:16:24,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:16:24" (2/2) ... [2024-06-20 19:16:24,933 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-20 19:16:25,001 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-20 19:16:25,002 INFO L97 edCorrectnessWitness]: Location invariant before [L836-L836] ((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1))) [2024-06-20 19:16:25,003 INFO L97 edCorrectnessWitness]: Location invariant before [L838-L838] ((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1))) [2024-06-20 19:16:25,003 INFO L97 edCorrectnessWitness]: Location invariant before [L839-L839] ((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1))) [2024-06-20 19:16:25,004 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-20 19:16:25,004 INFO L106 edCorrectnessWitness]: ghost_update [L834-L834] multithreaded = 1; [2024-06-20 19:16:25,042 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-20 19:16:25,378 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 19:16:25,386 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-20 19:16:25,738 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 19:16:25,769 INFO L206 MainTranslator]: Completed translation [2024-06-20 19:16:25,770 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:25 WrapperNode [2024-06-20 19:16:25,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-20 19:16:25,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-20 19:16:25,772 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-20 19:16:25,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-20 19:16:25,777 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 20.06 07:16:25" (1/1) ... [2024-06-20 19:16:25,826 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 20.06 07:16:25" (1/1) ... [2024-06-20 19:16:25,931 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 125 [2024-06-20 19:16:25,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-20 19:16:25,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-20 19:16:25,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-20 19:16:25,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-20 19:16:25,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:25" (1/1) ... [2024-06-20 19:16:25,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:25" (1/1) ... [2024-06-20 19:16:25,967 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:25" (1/1) ... [2024-06-20 19:16:26,023 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-20 19:16:26,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:25" (1/1) ... [2024-06-20 19:16:26,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:25" (1/1) ... [2024-06-20 19:16:26,110 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:25" (1/1) ... [2024-06-20 19:16:26,118 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:25" (1/1) ... [2024-06-20 19:16:26,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:25" (1/1) ... [2024-06-20 19:16:26,139 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:25" (1/1) ... [2024-06-20 19:16:26,166 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-20 19:16:26,166 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-20 19:16:26,167 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-20 19:16:26,167 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-20 19:16:26,167 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:25" (1/1) ... [2024-06-20 19:16:26,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 19:16:26,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 19:16:26,193 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-20 19:16:26,200 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-20 19:16:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-20 19:16:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-20 19:16:26,222 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-20 19:16:26,223 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-20 19:16:26,223 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-20 19:16:26,223 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-20 19:16:26,223 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-20 19:16:26,223 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-20 19:16:26,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-20 19:16:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-20 19:16:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-20 19:16:26,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-20 19:16:26,225 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-20 19:16:26,371 INFO L244 CfgBuilder]: Building ICFG [2024-06-20 19:16:26,373 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-20 19:16:27,374 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-20 19:16:27,375 INFO L293 CfgBuilder]: Performing block encoding [2024-06-20 19:16:27,591 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-20 19:16:27,592 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-20 19:16:27,592 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:16:27 BoogieIcfgContainer [2024-06-20 19:16:27,592 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-20 19:16:27,593 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-20 19:16:27,594 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-20 19:16:27,596 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-20 19:16:27,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 07:16:24" (1/4) ... [2024-06-20 19:16:27,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c21a9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:16:27, skipping insertion in model container [2024-06-20 19:16:27,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:16:24" (2/4) ... [2024-06-20 19:16:27,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c21a9d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:16:27, skipping insertion in model container [2024-06-20 19:16:27,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:16:25" (3/4) ... [2024-06-20 19:16:27,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c21a9d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:16:27, skipping insertion in model container [2024-06-20 19:16:27,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:16:27" (4/4) ... [2024-06-20 19:16:27,598 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-06-20 19:16:27,610 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-20 19:16:27,610 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-20 19:16:27,611 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-20 19:16:27,715 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-20 19:16:27,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 92 flow [2024-06-20 19:16:27,815 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2024-06-20 19:16:27,815 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 19:16:27,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-20 19:16:27,818 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 40 transitions, 92 flow [2024-06-20 19:16:27,821 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 31 transitions, 71 flow [2024-06-20 19:16:27,832 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-20 19:16:27,838 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;@26824285, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-20 19:16:27,838 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-20 19:16:27,845 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-20 19:16:27,845 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-20 19:16:27,845 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 19:16:27,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:16:27,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-20 19:16:27,846 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:16:27,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:16:27,854 INFO L85 PathProgramCache]: Analyzing trace with hash 366539877, now seen corresponding path program 1 times [2024-06-20 19:16:27,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:16:27,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94085738] [2024-06-20 19:16:27,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:16:27,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:16:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:16:33,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:16:33,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:16:33,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94085738] [2024-06-20 19:16:33,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94085738] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:16:33,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:16:33,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-20 19:16:33,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326839859] [2024-06-20 19:16:33,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:16:33,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-20 19:16:33,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:16:33,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-20 19:16:33,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-20 19:16:33,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-06-20 19:16:33,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:16:33,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:16:33,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-06-20 19:16:33,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:16:33,954 INFO L124 PetriNetUnfolderBase]: 1363/2074 cut-off events. [2024-06-20 19:16:33,954 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-06-20 19:16:33,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4198 conditions, 2074 events. 1363/2074 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9696 event pairs, 964 based on Foata normal form. 1/2036 useless extension candidates. Maximal degree in co-relation 4186. Up to 2037 conditions per place. [2024-06-20 19:16:33,967 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 32 selfloop transitions, 4 changer transitions 0/41 dead transitions. [2024-06-20 19:16:33,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 169 flow [2024-06-20 19:16:33,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-20 19:16:33,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-20 19:16:33,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-06-20 19:16:33,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-20 19:16:33,978 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 71 flow. Second operand 3 states and 72 transitions. [2024-06-20 19:16:33,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 169 flow [2024-06-20 19:16:33,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-20 19:16:33,982 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 98 flow [2024-06-20 19:16:33,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2024-06-20 19:16:33,985 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2024-06-20 19:16:33,985 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 98 flow [2024-06-20 19:16:33,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:16:33,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:16:33,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:16:33,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-20 19:16:33,986 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:16:33,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:16:33,987 INFO L85 PathProgramCache]: Analyzing trace with hash 58400200, now seen corresponding path program 1 times [2024-06-20 19:16:33,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:16:33,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358815179] [2024-06-20 19:16:33,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:16:33,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:16:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:16:37,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:16:37,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:16:37,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358815179] [2024-06-20 19:16:37,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358815179] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:16:37,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:16:37,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-20 19:16:37,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808853785] [2024-06-20 19:16:37,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:16:37,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 19:16:37,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:16:37,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 19:16:37,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-20 19:16:37,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-06-20 19:16:37,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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-20 19:16:37,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:16:37,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-06-20 19:16:37,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:16:38,645 INFO L124 PetriNetUnfolderBase]: 1357/2070 cut-off events. [2024-06-20 19:16:38,646 INFO L125 PetriNetUnfolderBase]: For 393/393 co-relation queries the response was YES. [2024-06-20 19:16:38,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4737 conditions, 2070 events. 1357/2070 cut-off events. For 393/393 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9665 event pairs, 840 based on Foata normal form. 3/2073 useless extension candidates. Maximal degree in co-relation 4725. Up to 2013 conditions per place. [2024-06-20 19:16:38,654 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 39 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2024-06-20 19:16:38,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 236 flow [2024-06-20 19:16:38,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 19:16:38,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 19:16:38,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2024-06-20 19:16:38,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.58125 [2024-06-20 19:16:38,656 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 98 flow. Second operand 4 states and 93 transitions. [2024-06-20 19:16:38,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 236 flow [2024-06-20 19:16:38,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 19:16:38,658 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 134 flow [2024-06-20 19:16:38,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2024-06-20 19:16:38,659 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2024-06-20 19:16:38,659 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 134 flow [2024-06-20 19:16:38,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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-20 19:16:38,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:16:38,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:16:38,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-20 19:16:38,660 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:16:38,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:16:38,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1810407254, now seen corresponding path program 1 times [2024-06-20 19:16:38,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:16:38,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950270875] [2024-06-20 19:16:38,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:16:38,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:16:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:16:42,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:16:42,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:16:42,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950270875] [2024-06-20 19:16:42,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950270875] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:16:42,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:16:42,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 19:16:42,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808835962] [2024-06-20 19:16:42,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:16:42,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-20 19:16:42,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:16:42,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-20 19:16:42,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-20 19:16:42,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-06-20 19:16:42,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:16:42,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:16:42,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-06-20 19:16:42,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:16:42,914 INFO L124 PetriNetUnfolderBase]: 1411/2146 cut-off events. [2024-06-20 19:16:42,914 INFO L125 PetriNetUnfolderBase]: For 1163/1163 co-relation queries the response was YES. [2024-06-20 19:16:42,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5474 conditions, 2146 events. 1411/2146 cut-off events. For 1163/1163 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10031 event pairs, 629 based on Foata normal form. 7/2152 useless extension candidates. Maximal degree in co-relation 5460. Up to 1982 conditions per place. [2024-06-20 19:16:42,925 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 54 selfloop transitions, 16 changer transitions 0/75 dead transitions. [2024-06-20 19:16:42,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 75 transitions, 398 flow [2024-06-20 19:16:42,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:16:42,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:16:42,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2024-06-20 19:16:42,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.62 [2024-06-20 19:16:42,931 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 134 flow. Second operand 5 states and 124 transitions. [2024-06-20 19:16:42,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 75 transitions, 398 flow [2024-06-20 19:16:42,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 75 transitions, 384 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-20 19:16:42,936 INFO L231 Difference]: Finished difference. Result has 49 places, 48 transitions, 235 flow [2024-06-20 19:16:42,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=49, PETRI_TRANSITIONS=48} [2024-06-20 19:16:42,937 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2024-06-20 19:16:42,937 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 48 transitions, 235 flow [2024-06-20 19:16:42,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:16:42,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:16:42,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:16:42,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-20 19:16:42,938 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:16:42,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:16:42,938 INFO L85 PathProgramCache]: Analyzing trace with hash -543117789, now seen corresponding path program 1 times [2024-06-20 19:16:42,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:16:42,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109016764] [2024-06-20 19:16:42,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:16:42,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:16:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:16:47,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:16:47,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:16:47,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109016764] [2024-06-20 19:16:47,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109016764] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:16:47,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:16:47,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 19:16:47,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726155537] [2024-06-20 19:16:47,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:16:47,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 19:16:47,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:16:47,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 19:16:47,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-20 19:16:47,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-06-20 19:16:47,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 48 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:16:47,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:16:47,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-06-20 19:16:47,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:16:48,201 INFO L124 PetriNetUnfolderBase]: 1433/2180 cut-off events. [2024-06-20 19:16:48,202 INFO L125 PetriNetUnfolderBase]: For 2845/2845 co-relation queries the response was YES. [2024-06-20 19:16:48,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6745 conditions, 2180 events. 1433/2180 cut-off events. For 2845/2845 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10319 event pairs, 476 based on Foata normal form. 7/2186 useless extension candidates. Maximal degree in co-relation 6728. Up to 1925 conditions per place. [2024-06-20 19:16:48,213 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 65 selfloop transitions, 28 changer transitions 0/98 dead transitions. [2024-06-20 19:16:48,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 98 transitions, 627 flow [2024-06-20 19:16:48,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:16:48,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:16:48,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2024-06-20 19:16:48,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-06-20 19:16:48,217 INFO L175 Difference]: Start difference. First operand has 49 places, 48 transitions, 235 flow. Second operand 6 states and 150 transitions. [2024-06-20 19:16:48,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 98 transitions, 627 flow [2024-06-20 19:16:48,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 98 transitions, 619 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-20 19:16:48,224 INFO L231 Difference]: Finished difference. Result has 58 places, 61 transitions, 414 flow [2024-06-20 19:16:48,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=414, PETRI_PLACES=58, PETRI_TRANSITIONS=61} [2024-06-20 19:16:48,225 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2024-06-20 19:16:48,225 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 61 transitions, 414 flow [2024-06-20 19:16:48,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:16:48,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:16:48,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:16:48,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-20 19:16:48,226 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:16:48,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:16:48,227 INFO L85 PathProgramCache]: Analyzing trace with hash 343218841, now seen corresponding path program 1 times [2024-06-20 19:16:48,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:16:48,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933456084] [2024-06-20 19:16:48,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:16:48,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:16:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:16:52,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:16:52,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:16:52,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933456084] [2024-06-20 19:16:52,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933456084] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:16:52,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:16:52,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:16:52,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142610165] [2024-06-20 19:16:52,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:16:52,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:16:52,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:16:52,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:16:52,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:16:52,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-06-20 19:16:52,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 61 transitions, 414 flow. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 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-20 19:16:52,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:16:52,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-06-20 19:16:52,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:16:53,811 INFO L124 PetriNetUnfolderBase]: 1529/2346 cut-off events. [2024-06-20 19:16:53,811 INFO L125 PetriNetUnfolderBase]: For 5666/5666 co-relation queries the response was YES. [2024-06-20 19:16:53,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8549 conditions, 2346 events. 1529/2346 cut-off events. For 5666/5666 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11399 event pairs, 342 based on Foata normal form. 26/2371 useless extension candidates. Maximal degree in co-relation 8526. Up to 1956 conditions per place. [2024-06-20 19:16:53,823 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 82 selfloop transitions, 22 changer transitions 0/109 dead transitions. [2024-06-20 19:16:53,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 109 transitions, 807 flow [2024-06-20 19:16:53,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:16:53,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:16:53,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2024-06-20 19:16:53,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-20 19:16:53,824 INFO L175 Difference]: Start difference. First operand has 58 places, 61 transitions, 414 flow. Second operand 7 states and 168 transitions. [2024-06-20 19:16:53,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 109 transitions, 807 flow [2024-06-20 19:16:53,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 109 transitions, 783 flow, removed 12 selfloop flow, removed 0 redundant places. [2024-06-20 19:16:53,832 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 490 flow [2024-06-20 19:16:53,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=490, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2024-06-20 19:16:53,834 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2024-06-20 19:16:53,834 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 490 flow [2024-06-20 19:16:53,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 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-20 19:16:53,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:16:53,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:16:53,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-20 19:16:53,838 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:16:53,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:16:53,838 INFO L85 PathProgramCache]: Analyzing trace with hash -212618023, now seen corresponding path program 1 times [2024-06-20 19:16:53,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:16:53,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969922693] [2024-06-20 19:16:53,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:16:53,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:16:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:17:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:17:01,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:17:01,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969922693] [2024-06-20 19:17:01,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969922693] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:17:01,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:17:01,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 19:17:01,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295367168] [2024-06-20 19:17:01,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:17:01,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 19:17:01,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:17:01,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 19:17:01,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-20 19:17:01,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:17:01,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 490 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:01,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:17:01,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:17:01,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:17:02,472 INFO L124 PetriNetUnfolderBase]: 1519/2335 cut-off events. [2024-06-20 19:17:02,473 INFO L125 PetriNetUnfolderBase]: For 6977/6977 co-relation queries the response was YES. [2024-06-20 19:17:02,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8982 conditions, 2335 events. 1519/2335 cut-off events. For 6977/6977 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11365 event pairs, 531 based on Foata normal form. 4/2339 useless extension candidates. Maximal degree in co-relation 8954. Up to 2275 conditions per place. [2024-06-20 19:17:02,486 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 62 selfloop transitions, 10 changer transitions 0/76 dead transitions. [2024-06-20 19:17:02,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 76 transitions, 662 flow [2024-06-20 19:17:02,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:17:02,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:17:02,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2024-06-20 19:17:02,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.455 [2024-06-20 19:17:02,488 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 490 flow. Second operand 5 states and 91 transitions. [2024-06-20 19:17:02,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 76 transitions, 662 flow [2024-06-20 19:17:02,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 76 transitions, 613 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-20 19:17:02,494 INFO L231 Difference]: Finished difference. Result has 66 places, 65 transitions, 471 flow [2024-06-20 19:17:02,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=471, PETRI_PLACES=66, PETRI_TRANSITIONS=65} [2024-06-20 19:17:02,495 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2024-06-20 19:17:02,495 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 65 transitions, 471 flow [2024-06-20 19:17:02,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:02,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:17:02,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:17:02,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-20 19:17:02,496 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:17:02,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:17:02,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1539923350, now seen corresponding path program 1 times [2024-06-20 19:17:02,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:17:02,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700537887] [2024-06-20 19:17:02,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:17:02,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:17:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:17:09,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:17:09,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:17:09,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700537887] [2024-06-20 19:17:09,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700537887] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:17:09,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:17:09,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:17:09,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147388656] [2024-06-20 19:17:09,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:17:09,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:17:09,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:17:09,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:17:09,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:17:10,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:17:10,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 471 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:10,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:17:10,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:17:10,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:17:11,119 INFO L124 PetriNetUnfolderBase]: 1647/2538 cut-off events. [2024-06-20 19:17:11,119 INFO L125 PetriNetUnfolderBase]: For 8928/8928 co-relation queries the response was YES. [2024-06-20 19:17:11,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9970 conditions, 2538 events. 1647/2538 cut-off events. For 8928/8928 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12653 event pairs, 824 based on Foata normal form. 8/2542 useless extension candidates. Maximal degree in co-relation 9940. Up to 2351 conditions per place. [2024-06-20 19:17:11,138 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 75 selfloop transitions, 21 changer transitions 0/100 dead transitions. [2024-06-20 19:17:11,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 892 flow [2024-06-20 19:17:11,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:17:11,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:17:11,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-20 19:17:11,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-20 19:17:11,141 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 471 flow. Second operand 7 states and 125 transitions. [2024-06-20 19:17:11,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 892 flow [2024-06-20 19:17:11,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 100 transitions, 859 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-20 19:17:11,150 INFO L231 Difference]: Finished difference. Result has 71 places, 79 transitions, 655 flow [2024-06-20 19:17:11,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=655, PETRI_PLACES=71, PETRI_TRANSITIONS=79} [2024-06-20 19:17:11,151 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 30 predicate places. [2024-06-20 19:17:11,151 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 79 transitions, 655 flow [2024-06-20 19:17:11,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:11,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:17:11,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:17:11,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-20 19:17:11,152 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:17:11,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:17:11,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1494142630, now seen corresponding path program 2 times [2024-06-20 19:17:11,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:17:11,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669542041] [2024-06-20 19:17:11,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:17:11,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:17:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:17:20,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:17:20,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:17:20,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669542041] [2024-06-20 19:17:20,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669542041] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:17:20,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:17:20,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:17:20,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644112883] [2024-06-20 19:17:20,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:17:20,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:17:20,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:17:20,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:17:20,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:17:20,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:17:20,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 79 transitions, 655 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:20,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:17:20,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:17:20,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:17:21,445 INFO L124 PetriNetUnfolderBase]: 1729/2664 cut-off events. [2024-06-20 19:17:21,456 INFO L125 PetriNetUnfolderBase]: For 11583/11607 co-relation queries the response was YES. [2024-06-20 19:17:21,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11262 conditions, 2664 events. 1729/2664 cut-off events. For 11583/11607 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 13257 event pairs, 487 based on Foata normal form. 26/2689 useless extension candidates. Maximal degree in co-relation 11230. Up to 2359 conditions per place. [2024-06-20 19:17:21,469 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 87 selfloop transitions, 43 changer transitions 0/134 dead transitions. [2024-06-20 19:17:21,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 134 transitions, 1387 flow [2024-06-20 19:17:21,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:17:21,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:17:21,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-06-20 19:17:21,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48928571428571427 [2024-06-20 19:17:21,471 INFO L175 Difference]: Start difference. First operand has 71 places, 79 transitions, 655 flow. Second operand 7 states and 137 transitions. [2024-06-20 19:17:21,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 134 transitions, 1387 flow [2024-06-20 19:17:21,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 134 transitions, 1354 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-20 19:17:21,482 INFO L231 Difference]: Finished difference. Result has 78 places, 104 transitions, 1082 flow [2024-06-20 19:17:21,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1082, PETRI_PLACES=78, PETRI_TRANSITIONS=104} [2024-06-20 19:17:21,483 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 37 predicate places. [2024-06-20 19:17:21,483 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 104 transitions, 1082 flow [2024-06-20 19:17:21,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:21,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:17:21,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:17:21,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-20 19:17:21,484 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:17:21,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:17:21,484 INFO L85 PathProgramCache]: Analyzing trace with hash -981061796, now seen corresponding path program 3 times [2024-06-20 19:17:21,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:17:21,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355278535] [2024-06-20 19:17:21,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:17:21,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:17:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:17:29,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:17:29,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:17:29,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355278535] [2024-06-20 19:17:29,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355278535] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:17:29,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:17:29,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:17:29,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720258566] [2024-06-20 19:17:29,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:17:29,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:17:29,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:17:29,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:17:29,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:17:29,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:17:29,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 104 transitions, 1082 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:29,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:17:29,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:17:29,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:17:30,351 INFO L124 PetriNetUnfolderBase]: 1676/2577 cut-off events. [2024-06-20 19:17:30,352 INFO L125 PetriNetUnfolderBase]: For 14071/14071 co-relation queries the response was YES. [2024-06-20 19:17:30,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11620 conditions, 2577 events. 1676/2577 cut-off events. For 14071/14071 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 12749 event pairs, 817 based on Foata normal form. 8/2583 useless extension candidates. Maximal degree in co-relation 11584. Up to 2454 conditions per place. [2024-06-20 19:17:30,368 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 97 selfloop transitions, 20 changer transitions 0/121 dead transitions. [2024-06-20 19:17:30,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 121 transitions, 1377 flow [2024-06-20 19:17:30,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:17:30,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:17:30,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-20 19:17:30,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-20 19:17:30,370 INFO L175 Difference]: Start difference. First operand has 78 places, 104 transitions, 1082 flow. Second operand 6 states and 108 transitions. [2024-06-20 19:17:30,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 121 transitions, 1377 flow [2024-06-20 19:17:30,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 121 transitions, 1348 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-06-20 19:17:30,387 INFO L231 Difference]: Finished difference. Result has 82 places, 104 transitions, 1110 flow [2024-06-20 19:17:30,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1055, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1110, PETRI_PLACES=82, PETRI_TRANSITIONS=104} [2024-06-20 19:17:30,387 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 41 predicate places. [2024-06-20 19:17:30,387 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 104 transitions, 1110 flow [2024-06-20 19:17:30,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:30,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:17:30,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:17:30,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-20 19:17:30,388 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:17:30,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:17:30,389 INFO L85 PathProgramCache]: Analyzing trace with hash 670361892, now seen corresponding path program 1 times [2024-06-20 19:17:30,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:17:30,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719475668] [2024-06-20 19:17:30,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:17:30,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:17:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:17:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:17:40,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:17:40,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719475668] [2024-06-20 19:17:40,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719475668] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:17:40,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:17:40,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:17:40,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35046118] [2024-06-20 19:17:40,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:17:40,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:17:40,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:17:40,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:17:40,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:17:40,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:17:40,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 104 transitions, 1110 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:40,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:17:40,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:17:40,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:17:42,014 INFO L124 PetriNetUnfolderBase]: 2074/3125 cut-off events. [2024-06-20 19:17:42,015 INFO L125 PetriNetUnfolderBase]: For 18697/18697 co-relation queries the response was YES. [2024-06-20 19:17:42,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14226 conditions, 3125 events. 2074/3125 cut-off events. For 18697/18697 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 14799 event pairs, 1030 based on Foata normal form. 4/3129 useless extension candidates. Maximal degree in co-relation 14188. Up to 3039 conditions per place. [2024-06-20 19:17:42,032 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 109 selfloop transitions, 16 changer transitions 0/128 dead transitions. [2024-06-20 19:17:42,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 128 transitions, 1469 flow [2024-06-20 19:17:42,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:17:42,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:17:42,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-20 19:17:42,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41785714285714287 [2024-06-20 19:17:42,036 INFO L175 Difference]: Start difference. First operand has 82 places, 104 transitions, 1110 flow. Second operand 7 states and 117 transitions. [2024-06-20 19:17:42,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 128 transitions, 1469 flow [2024-06-20 19:17:42,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 128 transitions, 1383 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-20 19:17:42,057 INFO L231 Difference]: Finished difference. Result has 85 places, 109 transitions, 1126 flow [2024-06-20 19:17:42,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1126, PETRI_PLACES=85, PETRI_TRANSITIONS=109} [2024-06-20 19:17:42,058 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 44 predicate places. [2024-06-20 19:17:42,059 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 109 transitions, 1126 flow [2024-06-20 19:17:42,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:42,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:17:42,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:17:42,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-20 19:17:42,060 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:17:42,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:17:42,061 INFO L85 PathProgramCache]: Analyzing trace with hash 456194483, now seen corresponding path program 1 times [2024-06-20 19:17:42,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:17:42,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556742829] [2024-06-20 19:17:42,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:17:42,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:17:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:17:52,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:17:52,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:17:52,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556742829] [2024-06-20 19:17:52,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556742829] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:17:52,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:17:52,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:17:52,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264428097] [2024-06-20 19:17:52,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:17:52,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:17:52,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:17:52,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:17:52,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:17:52,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:17:52,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 109 transitions, 1126 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:52,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:17:52,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:17:52,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:17:54,157 INFO L124 PetriNetUnfolderBase]: 2065/3113 cut-off events. [2024-06-20 19:17:54,157 INFO L125 PetriNetUnfolderBase]: For 19704/19704 co-relation queries the response was YES. [2024-06-20 19:17:54,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14570 conditions, 3113 events. 2065/3113 cut-off events. For 19704/19704 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 14671 event pairs, 1045 based on Foata normal form. 3/3116 useless extension candidates. Maximal degree in co-relation 14530. Up to 3063 conditions per place. [2024-06-20 19:17:54,177 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 109 selfloop transitions, 9 changer transitions 0/121 dead transitions. [2024-06-20 19:17:54,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 121 transitions, 1410 flow [2024-06-20 19:17:54,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:17:54,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:17:54,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2024-06-20 19:17:54,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42 [2024-06-20 19:17:54,178 INFO L175 Difference]: Start difference. First operand has 85 places, 109 transitions, 1126 flow. Second operand 5 states and 84 transitions. [2024-06-20 19:17:54,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 121 transitions, 1410 flow [2024-06-20 19:17:54,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 121 transitions, 1367 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-20 19:17:54,204 INFO L231 Difference]: Finished difference. Result has 86 places, 112 transitions, 1137 flow [2024-06-20 19:17:54,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1083, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1137, PETRI_PLACES=86, PETRI_TRANSITIONS=112} [2024-06-20 19:17:54,204 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 45 predicate places. [2024-06-20 19:17:54,205 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 112 transitions, 1137 flow [2024-06-20 19:17:54,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:54,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:17:54,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:17:54,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-20 19:17:54,205 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:17:54,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:17:54,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1977203207, now seen corresponding path program 1 times [2024-06-20 19:17:54,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:17:54,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142129481] [2024-06-20 19:17:54,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:17:54,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:17:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:18:04,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:18:04,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:18:04,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142129481] [2024-06-20 19:18:04,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142129481] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:18:04,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:18:04,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:18:04,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92100432] [2024-06-20 19:18:04,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:18:04,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:18:04,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:18:04,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:18:04,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:18:04,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:18:04,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 112 transitions, 1137 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:18:04,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:18:04,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:18:04,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:18:05,929 INFO L124 PetriNetUnfolderBase]: 2016/3072 cut-off events. [2024-06-20 19:18:05,930 INFO L125 PetriNetUnfolderBase]: For 21154/21182 co-relation queries the response was YES. [2024-06-20 19:18:05,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14683 conditions, 3072 events. 2016/3072 cut-off events. For 21154/21182 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 15246 event pairs, 532 based on Foata normal form. 26/3093 useless extension candidates. Maximal degree in co-relation 14642. Up to 2630 conditions per place. [2024-06-20 19:18:05,949 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 103 selfloop transitions, 49 changer transitions 0/157 dead transitions. [2024-06-20 19:18:05,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 157 transitions, 1724 flow [2024-06-20 19:18:05,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:18:05,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:18:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-20 19:18:05,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48125 [2024-06-20 19:18:05,952 INFO L175 Difference]: Start difference. First operand has 86 places, 112 transitions, 1137 flow. Second operand 8 states and 154 transitions. [2024-06-20 19:18:05,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 157 transitions, 1724 flow [2024-06-20 19:18:05,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 157 transitions, 1692 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-20 19:18:05,975 INFO L231 Difference]: Finished difference. Result has 92 places, 122 transitions, 1317 flow [2024-06-20 19:18:05,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1317, PETRI_PLACES=92, PETRI_TRANSITIONS=122} [2024-06-20 19:18:05,976 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 51 predicate places. [2024-06-20 19:18:05,976 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 122 transitions, 1317 flow [2024-06-20 19:18:05,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:18:05,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:18:05,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:18:05,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-20 19:18:05,976 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:18:05,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:18:05,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1980291737, now seen corresponding path program 2 times [2024-06-20 19:18:05,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:18:05,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967240410] [2024-06-20 19:18:05,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:18:05,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:18:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:18:15,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:18:15,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:18:15,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967240410] [2024-06-20 19:18:15,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967240410] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:18:15,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:18:15,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:18:15,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958639185] [2024-06-20 19:18:15,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:18:15,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:18:15,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:18:15,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:18:15,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:18:15,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:18:15,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 122 transitions, 1317 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:18:15,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:18:15,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:18:15,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:18:17,279 INFO L124 PetriNetUnfolderBase]: 1958/2992 cut-off events. [2024-06-20 19:18:17,280 INFO L125 PetriNetUnfolderBase]: For 24641/24677 co-relation queries the response was YES. [2024-06-20 19:18:17,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15090 conditions, 2992 events. 1958/2992 cut-off events. For 24641/24677 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14829 event pairs, 546 based on Foata normal form. 34/3023 useless extension candidates. Maximal degree in co-relation 15047. Up to 2651 conditions per place. [2024-06-20 19:18:17,298 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 104 selfloop transitions, 48 changer transitions 0/157 dead transitions. [2024-06-20 19:18:17,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 157 transitions, 1807 flow [2024-06-20 19:18:17,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:18:17,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:18:17,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-20 19:18:17,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.471875 [2024-06-20 19:18:17,301 INFO L175 Difference]: Start difference. First operand has 92 places, 122 transitions, 1317 flow. Second operand 8 states and 151 transitions. [2024-06-20 19:18:17,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 157 transitions, 1807 flow [2024-06-20 19:18:17,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 157 transitions, 1735 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-20 19:18:17,323 INFO L231 Difference]: Finished difference. Result has 96 places, 125 transitions, 1389 flow [2024-06-20 19:18:17,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1249, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1389, PETRI_PLACES=96, PETRI_TRANSITIONS=125} [2024-06-20 19:18:17,323 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 55 predicate places. [2024-06-20 19:18:17,324 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 125 transitions, 1389 flow [2024-06-20 19:18:17,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:18:17,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:18:17,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:18:17,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-20 19:18:17,324 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:18:17,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:18:17,325 INFO L85 PathProgramCache]: Analyzing trace with hash -186510633, now seen corresponding path program 3 times [2024-06-20 19:18:17,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:18:17,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464266890] [2024-06-20 19:18:17,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:18:17,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:18:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:18:26,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:18:26,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:18:26,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464266890] [2024-06-20 19:18:26,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464266890] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:18:26,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:18:26,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:18:26,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260303731] [2024-06-20 19:18:26,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:18:26,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:18:26,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:18:26,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:18:26,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:18:27,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:18:27,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 125 transitions, 1389 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:18:27,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:18:27,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:18:27,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:18:28,380 INFO L124 PetriNetUnfolderBase]: 2096/3199 cut-off events. [2024-06-20 19:18:28,381 INFO L125 PetriNetUnfolderBase]: For 28894/28920 co-relation queries the response was YES. [2024-06-20 19:18:28,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16562 conditions, 3199 events. 2096/3199 cut-off events. For 28894/28920 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 15917 event pairs, 553 based on Foata normal form. 20/3215 useless extension candidates. Maximal degree in co-relation 16517. Up to 2741 conditions per place. [2024-06-20 19:18:28,400 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 127 selfloop transitions, 83 changer transitions 0/215 dead transitions. [2024-06-20 19:18:28,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 215 transitions, 2672 flow [2024-06-20 19:18:28,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:18:28,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:18:28,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2024-06-20 19:18:28,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-20 19:18:28,414 INFO L175 Difference]: Start difference. First operand has 96 places, 125 transitions, 1389 flow. Second operand 8 states and 160 transitions. [2024-06-20 19:18:28,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 215 transitions, 2672 flow [2024-06-20 19:18:28,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 215 transitions, 2512 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-20 19:18:28,446 INFO L231 Difference]: Finished difference. Result has 101 places, 178 transitions, 2135 flow [2024-06-20 19:18:28,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1284, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2135, PETRI_PLACES=101, PETRI_TRANSITIONS=178} [2024-06-20 19:18:28,447 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 60 predicate places. [2024-06-20 19:18:28,447 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 178 transitions, 2135 flow [2024-06-20 19:18:28,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:18:28,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:18:28,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:18:28,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-20 19:18:28,448 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:18:28,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:18:28,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1901170571, now seen corresponding path program 4 times [2024-06-20 19:18:28,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:18:28,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129423758] [2024-06-20 19:18:28,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:18:28,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:18:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:18:36,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:18:36,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:18:36,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129423758] [2024-06-20 19:18:36,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129423758] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:18:36,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:18:36,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:18:36,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010664467] [2024-06-20 19:18:36,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:18:36,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:18:36,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:18:36,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:18:36,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:18:37,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:18:37,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 178 transitions, 2135 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:18:37,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:18:37,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:18:37,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:18:38,291 INFO L124 PetriNetUnfolderBase]: 2207/3366 cut-off events. [2024-06-20 19:18:38,291 INFO L125 PetriNetUnfolderBase]: For 35873/35905 co-relation queries the response was YES. [2024-06-20 19:18:38,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19231 conditions, 3366 events. 2207/3366 cut-off events. For 35873/35905 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 17010 event pairs, 547 based on Foata normal form. 26/3388 useless extension candidates. Maximal degree in co-relation 19182. Up to 2623 conditions per place. [2024-06-20 19:18:38,313 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 83 selfloop transitions, 131 changer transitions 0/219 dead transitions. [2024-06-20 19:18:38,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 219 transitions, 2929 flow [2024-06-20 19:18:38,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:18:38,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:18:38,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-20 19:18:38,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-20 19:18:38,317 INFO L175 Difference]: Start difference. First operand has 101 places, 178 transitions, 2135 flow. Second operand 7 states and 133 transitions. [2024-06-20 19:18:38,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 219 transitions, 2929 flow [2024-06-20 19:18:38,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 219 transitions, 2868 flow, removed 24 selfloop flow, removed 2 redundant places. [2024-06-20 19:18:38,364 INFO L231 Difference]: Finished difference. Result has 106 places, 189 transitions, 2517 flow [2024-06-20 19:18:38,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2086, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2517, PETRI_PLACES=106, PETRI_TRANSITIONS=189} [2024-06-20 19:18:38,365 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 65 predicate places. [2024-06-20 19:18:38,366 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 189 transitions, 2517 flow [2024-06-20 19:18:38,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:18:38,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:18:38,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:18:38,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-20 19:18:38,366 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:18:38,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:18:38,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1901080361, now seen corresponding path program 5 times [2024-06-20 19:18:38,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:18:38,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960993202] [2024-06-20 19:18:38,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:18:38,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:18:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:18:45,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:18:45,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:18:45,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960993202] [2024-06-20 19:18:45,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960993202] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:18:45,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:18:45,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:18:45,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666545073] [2024-06-20 19:18:45,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:18:45,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:18:45,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:18:45,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:18:45,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:18:45,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:18:45,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 189 transitions, 2517 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:18:45,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:18:45,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:18:45,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:18:47,066 INFO L124 PetriNetUnfolderBase]: 2110/3231 cut-off events. [2024-06-20 19:18:47,067 INFO L125 PetriNetUnfolderBase]: For 40125/40155 co-relation queries the response was YES. [2024-06-20 19:18:47,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19192 conditions, 3231 events. 2110/3231 cut-off events. For 40125/40155 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16313 event pairs, 563 based on Foata normal form. 28/3256 useless extension candidates. Maximal degree in co-relation 19141. Up to 2746 conditions per place. [2024-06-20 19:18:47,088 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 120 selfloop transitions, 92 changer transitions 0/217 dead transitions. [2024-06-20 19:18:47,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 217 transitions, 3114 flow [2024-06-20 19:18:47,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:18:47,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:18:47,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-20 19:18:47,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2024-06-20 19:18:47,092 INFO L175 Difference]: Start difference. First operand has 106 places, 189 transitions, 2517 flow. Second operand 7 states and 135 transitions. [2024-06-20 19:18:47,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 217 transitions, 3114 flow [2024-06-20 19:18:47,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 217 transitions, 2909 flow, removed 58 selfloop flow, removed 5 redundant places. [2024-06-20 19:18:47,146 INFO L231 Difference]: Finished difference. Result has 108 places, 189 transitions, 2537 flow [2024-06-20 19:18:47,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2320, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2537, PETRI_PLACES=108, PETRI_TRANSITIONS=189} [2024-06-20 19:18:47,146 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 67 predicate places. [2024-06-20 19:18:47,146 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 189 transitions, 2537 flow [2024-06-20 19:18:47,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:18:47,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:18:47,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:18:47,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-20 19:18:47,147 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:18:47,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:18:47,148 INFO L85 PathProgramCache]: Analyzing trace with hash 969815649, now seen corresponding path program 1 times [2024-06-20 19:18:47,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:18:47,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3264551] [2024-06-20 19:18:47,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:18:47,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:18:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:18:58,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:18:58,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:18:58,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3264551] [2024-06-20 19:18:58,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3264551] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:18:58,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:18:58,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:18:58,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022374119] [2024-06-20 19:18:58,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:18:58,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:18:58,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:18:58,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:18:58,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:18:59,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:18:59,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 189 transitions, 2537 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:18:59,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:18:59,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:18:59,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:19:00,493 INFO L124 PetriNetUnfolderBase]: 2372/3666 cut-off events. [2024-06-20 19:19:00,493 INFO L125 PetriNetUnfolderBase]: For 39933/39967 co-relation queries the response was YES. [2024-06-20 19:19:00,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20638 conditions, 3666 events. 2372/3666 cut-off events. For 39933/39967 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 19451 event pairs, 634 based on Foata normal form. 42/3701 useless extension candidates. Maximal degree in co-relation 20587. Up to 2735 conditions per place. [2024-06-20 19:19:00,522 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 151 selfloop transitions, 86 changer transitions 0/242 dead transitions. [2024-06-20 19:19:00,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 242 transitions, 3355 flow [2024-06-20 19:19:00,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:19:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:19:00,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-06-20 19:19:00,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-06-20 19:19:00,526 INFO L175 Difference]: Start difference. First operand has 108 places, 189 transitions, 2537 flow. Second operand 9 states and 176 transitions. [2024-06-20 19:19:00,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 242 transitions, 3355 flow [2024-06-20 19:19:00,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 242 transitions, 3099 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-20 19:19:00,571 INFO L231 Difference]: Finished difference. Result has 112 places, 193 transitions, 2542 flow [2024-06-20 19:19:00,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2289, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2542, PETRI_PLACES=112, PETRI_TRANSITIONS=193} [2024-06-20 19:19:00,572 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 71 predicate places. [2024-06-20 19:19:00,572 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 193 transitions, 2542 flow [2024-06-20 19:19:00,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:19:00,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:19:00,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:19:00,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-20 19:19:00,573 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:19:00,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:19:00,573 INFO L85 PathProgramCache]: Analyzing trace with hash 969818439, now seen corresponding path program 2 times [2024-06-20 19:19:00,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:19:00,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862974318] [2024-06-20 19:19:00,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:19:00,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:19:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:19:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:19:12,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:19:12,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862974318] [2024-06-20 19:19:12,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862974318] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:19:12,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:19:12,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:19:12,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306779930] [2024-06-20 19:19:12,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:19:12,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:19:12,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:19:12,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:19:12,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:19:12,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:19:12,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 193 transitions, 2542 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:19:12,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:19:12,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:19:12,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:19:13,758 INFO L124 PetriNetUnfolderBase]: 2447/3792 cut-off events. [2024-06-20 19:19:13,758 INFO L125 PetriNetUnfolderBase]: For 41121/41155 co-relation queries the response was YES. [2024-06-20 19:19:13,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21302 conditions, 3792 events. 2447/3792 cut-off events. For 41121/41155 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 20415 event pairs, 672 based on Foata normal form. 46/3831 useless extension candidates. Maximal degree in co-relation 21249. Up to 3185 conditions per place. [2024-06-20 19:19:13,782 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 149 selfloop transitions, 85 changer transitions 0/239 dead transitions. [2024-06-20 19:19:13,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 239 transitions, 3260 flow [2024-06-20 19:19:13,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:19:13,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:19:13,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-20 19:19:13,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-20 19:19:13,785 INFO L175 Difference]: Start difference. First operand has 112 places, 193 transitions, 2542 flow. Second operand 9 states and 171 transitions. [2024-06-20 19:19:13,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 239 transitions, 3260 flow [2024-06-20 19:19:13,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 239 transitions, 3153 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-20 19:19:13,833 INFO L231 Difference]: Finished difference. Result has 116 places, 194 transitions, 2638 flow [2024-06-20 19:19:13,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2435, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2638, PETRI_PLACES=116, PETRI_TRANSITIONS=194} [2024-06-20 19:19:13,834 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 75 predicate places. [2024-06-20 19:19:13,834 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 194 transitions, 2638 flow [2024-06-20 19:19:13,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:19:13,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:19:13,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:19:13,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-20 19:19:13,835 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:19:13,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:19:13,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1259502279, now seen corresponding path program 3 times [2024-06-20 19:19:13,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:19:13,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457948135] [2024-06-20 19:19:13,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:19:13,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:19:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:19:24,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:19:24,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:19:24,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457948135] [2024-06-20 19:19:24,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457948135] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:19:24,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:19:24,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:19:24,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242255054] [2024-06-20 19:19:24,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:19:24,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:19:24,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:19:24,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:19:24,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:19:25,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:19:25,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 194 transitions, 2638 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:19:25,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:19:25,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:19:25,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:19:26,522 INFO L124 PetriNetUnfolderBase]: 2483/3853 cut-off events. [2024-06-20 19:19:26,523 INFO L125 PetriNetUnfolderBase]: For 44715/44749 co-relation queries the response was YES. [2024-06-20 19:19:26,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22060 conditions, 3853 events. 2483/3853 cut-off events. For 44715/44749 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 20761 event pairs, 651 based on Foata normal form. 46/3894 useless extension candidates. Maximal degree in co-relation 22005. Up to 3350 conditions per place. [2024-06-20 19:19:26,547 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 167 selfloop transitions, 65 changer transitions 0/237 dead transitions. [2024-06-20 19:19:26,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 237 transitions, 3336 flow [2024-06-20 19:19:26,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:19:26,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:19:26,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-20 19:19:26,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-20 19:19:26,550 INFO L175 Difference]: Start difference. First operand has 116 places, 194 transitions, 2638 flow. Second operand 9 states and 170 transitions. [2024-06-20 19:19:26,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 237 transitions, 3336 flow [2024-06-20 19:19:26,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 237 transitions, 3166 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-20 19:19:26,597 INFO L231 Difference]: Finished difference. Result has 118 places, 195 transitions, 2631 flow [2024-06-20 19:19:26,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2468, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2631, PETRI_PLACES=118, PETRI_TRANSITIONS=195} [2024-06-20 19:19:26,598 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 77 predicate places. [2024-06-20 19:19:26,598 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 195 transitions, 2631 flow [2024-06-20 19:19:26,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:19:26,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:19:26,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:19:26,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-20 19:19:26,599 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:19:26,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:19:26,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1528806825, now seen corresponding path program 4 times [2024-06-20 19:19:26,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:19:26,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558060436] [2024-06-20 19:19:26,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:19:26,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:19:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:19:33,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:19:33,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:19:33,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558060436] [2024-06-20 19:19:33,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558060436] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:19:33,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:19:33,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:19:33,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414474438] [2024-06-20 19:19:33,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:19:33,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:19:33,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:19:33,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:19:33,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:19:34,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:19:34,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 195 transitions, 2631 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-20 19:19:34,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:19:34,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:19:34,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:19:35,864 INFO L124 PetriNetUnfolderBase]: 3154/5005 cut-off events. [2024-06-20 19:19:35,864 INFO L125 PetriNetUnfolderBase]: For 58373/58414 co-relation queries the response was YES. [2024-06-20 19:19:35,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27903 conditions, 5005 events. 3154/5005 cut-off events. For 58373/58414 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 29560 event pairs, 553 based on Foata normal form. 52/5052 useless extension candidates. Maximal degree in co-relation 27847. Up to 2409 conditions per place. [2024-06-20 19:19:35,901 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 120 selfloop transitions, 130 changer transitions 0/255 dead transitions. [2024-06-20 19:19:35,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 255 transitions, 3647 flow [2024-06-20 19:19:35,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:19:35,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:19:35,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2024-06-20 19:19:35,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.521875 [2024-06-20 19:19:35,905 INFO L175 Difference]: Start difference. First operand has 118 places, 195 transitions, 2631 flow. Second operand 8 states and 167 transitions. [2024-06-20 19:19:35,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 255 transitions, 3647 flow [2024-06-20 19:19:35,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 255 transitions, 3502 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-20 19:19:35,981 INFO L231 Difference]: Finished difference. Result has 121 places, 207 transitions, 2991 flow [2024-06-20 19:19:35,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2497, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2991, PETRI_PLACES=121, PETRI_TRANSITIONS=207} [2024-06-20 19:19:35,982 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 80 predicate places. [2024-06-20 19:19:35,982 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 207 transitions, 2991 flow [2024-06-20 19:19:35,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-20 19:19:35,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:19:35,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:19:35,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-20 19:19:35,983 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:19:35,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:19:35,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1496176631, now seen corresponding path program 5 times [2024-06-20 19:19:35,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:19:35,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820664089] [2024-06-20 19:19:35,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:19:35,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:19:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:19:47,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:19:47,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:19:47,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820664089] [2024-06-20 19:19:47,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820664089] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:19:47,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:19:47,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:19:47,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201687453] [2024-06-20 19:19:47,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:19:47,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:19:47,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:19:47,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:19:47,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:19:47,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:19:47,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 207 transitions, 2991 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:19:47,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:19:47,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:19:47,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:19:49,527 INFO L124 PetriNetUnfolderBase]: 3756/5976 cut-off events. [2024-06-20 19:19:49,527 INFO L125 PetriNetUnfolderBase]: For 77492/77551 co-relation queries the response was YES. [2024-06-20 19:19:49,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34483 conditions, 5976 events. 3756/5976 cut-off events. For 77492/77551 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 36916 event pairs, 1072 based on Foata normal form. 68/6039 useless extension candidates. Maximal degree in co-relation 34424. Up to 4525 conditions per place. [2024-06-20 19:19:49,575 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 165 selfloop transitions, 100 changer transitions 0/270 dead transitions. [2024-06-20 19:19:49,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 270 transitions, 4122 flow [2024-06-20 19:19:49,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:19:49,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:19:49,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions. [2024-06-20 19:19:49,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027777777777778 [2024-06-20 19:19:49,578 INFO L175 Difference]: Start difference. First operand has 121 places, 207 transitions, 2991 flow. Second operand 9 states and 181 transitions. [2024-06-20 19:19:49,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 270 transitions, 4122 flow [2024-06-20 19:19:49,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 270 transitions, 3982 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-20 19:19:49,706 INFO L231 Difference]: Finished difference. Result has 127 places, 221 transitions, 3339 flow [2024-06-20 19:19:49,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2859, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3339, PETRI_PLACES=127, PETRI_TRANSITIONS=221} [2024-06-20 19:19:49,706 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 86 predicate places. [2024-06-20 19:19:49,707 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 221 transitions, 3339 flow [2024-06-20 19:19:49,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:19:49,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:19:49,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:19:49,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-20 19:19:49,708 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:19:49,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:19:49,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1486861751, now seen corresponding path program 6 times [2024-06-20 19:19:49,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:19:49,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990935412] [2024-06-20 19:19:49,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:19:49,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:19:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:20:00,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:20:00,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:20:00,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990935412] [2024-06-20 19:20:00,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990935412] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:20:00,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:20:00,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:20:00,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201840216] [2024-06-20 19:20:00,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:20:00,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:20:00,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:20:00,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:20:00,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:20:01,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:20:01,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 221 transitions, 3339 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:20:01,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:20:01,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:20:01,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:20:03,135 INFO L124 PetriNetUnfolderBase]: 3818/6079 cut-off events. [2024-06-20 19:20:03,135 INFO L125 PetriNetUnfolderBase]: For 84393/84458 co-relation queries the response was YES. [2024-06-20 19:20:03,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36127 conditions, 6079 events. 3818/6079 cut-off events. For 84393/84458 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 37807 event pairs, 1191 based on Foata normal form. 80/6155 useless extension candidates. Maximal degree in co-relation 36066. Up to 5230 conditions per place. [2024-06-20 19:20:03,194 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 170 selfloop transitions, 91 changer transitions 0/266 dead transitions. [2024-06-20 19:20:03,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 266 transitions, 4196 flow [2024-06-20 19:20:03,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:20:03,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:20:03,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-06-20 19:20:03,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-06-20 19:20:03,197 INFO L175 Difference]: Start difference. First operand has 127 places, 221 transitions, 3339 flow. Second operand 9 states and 176 transitions. [2024-06-20 19:20:03,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 266 transitions, 4196 flow [2024-06-20 19:20:03,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 266 transitions, 4077 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-20 19:20:03,342 INFO L231 Difference]: Finished difference. Result has 131 places, 223 transitions, 3460 flow [2024-06-20 19:20:03,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3220, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3460, PETRI_PLACES=131, PETRI_TRANSITIONS=223} [2024-06-20 19:20:03,342 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 90 predicate places. [2024-06-20 19:20:03,342 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 223 transitions, 3460 flow [2024-06-20 19:20:03,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:20:03,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:20:03,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:20:03,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-20 19:20:03,343 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:20:03,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:20:03,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1309858267, now seen corresponding path program 1 times [2024-06-20 19:20:03,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:20:03,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171215907] [2024-06-20 19:20:03,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:20:03,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:20:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:20:14,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:20:14,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:20:14,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171215907] [2024-06-20 19:20:14,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171215907] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:20:14,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:20:14,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:20:14,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440825561] [2024-06-20 19:20:14,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:20:14,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:20:14,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:20:14,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:20:14,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:20:14,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:20:14,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 223 transitions, 3460 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:20:14,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:20:14,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:20:14,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:20:16,544 INFO L124 PetriNetUnfolderBase]: 4437/6960 cut-off events. [2024-06-20 19:20:16,545 INFO L125 PetriNetUnfolderBase]: For 93753/93797 co-relation queries the response was YES. [2024-06-20 19:20:16,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41792 conditions, 6960 events. 4437/6960 cut-off events. For 93753/93797 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 42436 event pairs, 1607 based on Foata normal form. 44/7004 useless extension candidates. Maximal degree in co-relation 41729. Up to 6356 conditions per place. [2024-06-20 19:20:16,592 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 192 selfloop transitions, 83 changer transitions 0/278 dead transitions. [2024-06-20 19:20:16,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 278 transitions, 4492 flow [2024-06-20 19:20:16,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:20:16,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:20:16,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-20 19:20:16,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2024-06-20 19:20:16,595 INFO L175 Difference]: Start difference. First operand has 131 places, 223 transitions, 3460 flow. Second operand 9 states and 164 transitions. [2024-06-20 19:20:16,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 278 transitions, 4492 flow [2024-06-20 19:20:16,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 278 transitions, 4291 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-20 19:20:16,750 INFO L231 Difference]: Finished difference. Result has 135 places, 243 transitions, 3801 flow [2024-06-20 19:20:16,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3269, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3801, PETRI_PLACES=135, PETRI_TRANSITIONS=243} [2024-06-20 19:20:16,751 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 94 predicate places. [2024-06-20 19:20:16,751 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 243 transitions, 3801 flow [2024-06-20 19:20:16,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:20:16,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:20:16,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:20:16,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-20 19:20:16,752 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:20:16,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:20:16,752 INFO L85 PathProgramCache]: Analyzing trace with hash 519941270, now seen corresponding path program 1 times [2024-06-20 19:20:16,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:20:16,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446496040] [2024-06-20 19:20:16,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:20:16,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:20:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:20:26,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:20:26,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:20:26,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446496040] [2024-06-20 19:20:26,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446496040] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:20:26,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:20:26,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:20:26,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016416859] [2024-06-20 19:20:26,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:20:26,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:20:26,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:20:26,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:20:26,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:20:26,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:20:26,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 243 transitions, 3801 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:20:26,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:20:26,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:20:26,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:20:28,563 INFO L124 PetriNetUnfolderBase]: 4468/7000 cut-off events. [2024-06-20 19:20:28,563 INFO L125 PetriNetUnfolderBase]: For 97984/97984 co-relation queries the response was YES. [2024-06-20 19:20:28,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42864 conditions, 7000 events. 4468/7000 cut-off events. For 97984/97984 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 42485 event pairs, 2024 based on Foata normal form. 3/7003 useless extension candidates. Maximal degree in co-relation 42798. Up to 6822 conditions per place. [2024-06-20 19:20:28,613 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 251 selfloop transitions, 23 changer transitions 0/277 dead transitions. [2024-06-20 19:20:28,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 277 transitions, 4552 flow [2024-06-20 19:20:28,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:20:28,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:20:28,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-20 19:20:28,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392857142857143 [2024-06-20 19:20:28,615 INFO L175 Difference]: Start difference. First operand has 135 places, 243 transitions, 3801 flow. Second operand 7 states and 123 transitions. [2024-06-20 19:20:28,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 277 transitions, 4552 flow [2024-06-20 19:20:28,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 277 transitions, 4405 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-06-20 19:20:28,767 INFO L231 Difference]: Finished difference. Result has 140 places, 255 transitions, 3831 flow [2024-06-20 19:20:28,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3654, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3831, PETRI_PLACES=140, PETRI_TRANSITIONS=255} [2024-06-20 19:20:28,768 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 99 predicate places. [2024-06-20 19:20:28,768 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 255 transitions, 3831 flow [2024-06-20 19:20:28,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:20:28,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:20:28,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:20:28,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-20 19:20:28,769 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:20:28,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:20:28,769 INFO L85 PathProgramCache]: Analyzing trace with hash -663608381, now seen corresponding path program 7 times [2024-06-20 19:20:28,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:20:28,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070439166] [2024-06-20 19:20:28,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:20:28,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:20:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:20:38,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:20:38,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:20:38,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070439166] [2024-06-20 19:20:38,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070439166] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:20:38,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:20:38,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:20:38,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062423722] [2024-06-20 19:20:38,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:20:38,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:20:38,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:20:38,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:20:38,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:20:38,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:20:38,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 255 transitions, 3831 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:20:38,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:20:38,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:20:38,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:20:40,681 INFO L124 PetriNetUnfolderBase]: 4165/6673 cut-off events. [2024-06-20 19:20:40,681 INFO L125 PetriNetUnfolderBase]: For 109169/109248 co-relation queries the response was YES. [2024-06-20 19:20:40,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41533 conditions, 6673 events. 4165/6673 cut-off events. For 109169/109248 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 42358 event pairs, 925 based on Foata normal form. 86/6751 useless extension candidates. Maximal degree in co-relation 41464. Up to 3172 conditions per place. [2024-06-20 19:20:40,730 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 119 selfloop transitions, 176 changer transitions 0/301 dead transitions. [2024-06-20 19:20:40,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 301 transitions, 4877 flow [2024-06-20 19:20:40,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:20:40,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:20:40,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2024-06-20 19:20:40,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503125 [2024-06-20 19:20:40,733 INFO L175 Difference]: Start difference. First operand has 140 places, 255 transitions, 3831 flow. Second operand 8 states and 161 transitions. [2024-06-20 19:20:40,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 301 transitions, 4877 flow [2024-06-20 19:20:40,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 301 transitions, 4853 flow, removed 11 selfloop flow, removed 1 redundant places. [2024-06-20 19:20:40,924 INFO L231 Difference]: Finished difference. Result has 147 places, 259 transitions, 4284 flow [2024-06-20 19:20:40,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3807, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4284, PETRI_PLACES=147, PETRI_TRANSITIONS=259} [2024-06-20 19:20:40,926 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 106 predicate places. [2024-06-20 19:20:40,927 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 259 transitions, 4284 flow [2024-06-20 19:20:40,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:20:40,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:20:40,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:20:40,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-20 19:20:40,927 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:20:40,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:20:40,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1193255019, now seen corresponding path program 8 times [2024-06-20 19:20:40,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:20:40,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12635197] [2024-06-20 19:20:40,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:20:40,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:20:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:20:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:20:49,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:20:49,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12635197] [2024-06-20 19:20:49,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12635197] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:20:49,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:20:49,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:20:49,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597336201] [2024-06-20 19:20:49,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:20:49,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:20:49,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:20:49,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:20:49,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:20:50,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:20:50,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 259 transitions, 4284 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:20:50,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:20:50,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:20:50,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:20:52,244 INFO L124 PetriNetUnfolderBase]: 4255/6827 cut-off events. [2024-06-20 19:20:52,244 INFO L125 PetriNetUnfolderBase]: For 132299/132369 co-relation queries the response was YES. [2024-06-20 19:20:52,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44071 conditions, 6827 events. 4255/6827 cut-off events. For 132299/132369 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 44009 event pairs, 1407 based on Foata normal form. 92/6912 useless extension candidates. Maximal degree in co-relation 43999. Up to 5228 conditions per place. [2024-06-20 19:20:52,301 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 141 selfloop transitions, 152 changer transitions 0/299 dead transitions. [2024-06-20 19:20:52,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 299 transitions, 5208 flow [2024-06-20 19:20:52,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:20:52,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:20:52,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-06-20 19:20:52,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.490625 [2024-06-20 19:20:52,305 INFO L175 Difference]: Start difference. First operand has 147 places, 259 transitions, 4284 flow. Second operand 8 states and 157 transitions. [2024-06-20 19:20:52,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 299 transitions, 5208 flow [2024-06-20 19:20:52,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 299 transitions, 4978 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-20 19:20:52,515 INFO L231 Difference]: Finished difference. Result has 149 places, 262 transitions, 4485 flow [2024-06-20 19:20:52,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4066, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4485, PETRI_PLACES=149, PETRI_TRANSITIONS=262} [2024-06-20 19:20:52,516 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 108 predicate places. [2024-06-20 19:20:52,516 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 262 transitions, 4485 flow [2024-06-20 19:20:52,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:20:52,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:20:52,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:20:52,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-20 19:20:52,517 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:20:52,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:20:52,517 INFO L85 PathProgramCache]: Analyzing trace with hash -660751421, now seen corresponding path program 9 times [2024-06-20 19:20:52,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:20:52,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534089267] [2024-06-20 19:20:52,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:20:52,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:20:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:21:01,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:21:01,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:21:01,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534089267] [2024-06-20 19:21:01,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534089267] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:21:01,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:21:01,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:21:01,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007008745] [2024-06-20 19:21:01,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:21:01,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:21:01,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:21:01,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:21:01,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:21:01,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-20 19:21:01,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 262 transitions, 4485 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:01,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:21:01,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-20 19:21:01,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:21:03,508 INFO L124 PetriNetUnfolderBase]: 4469/7194 cut-off events. [2024-06-20 19:21:03,508 INFO L125 PetriNetUnfolderBase]: For 121794/121842 co-relation queries the response was YES. [2024-06-20 19:21:03,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45967 conditions, 7194 events. 4469/7194 cut-off events. For 121794/121842 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 46977 event pairs, 1617 based on Foata normal form. 84/7270 useless extension candidates. Maximal degree in co-relation 45895. Up to 5893 conditions per place. [2024-06-20 19:21:03,575 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 184 selfloop transitions, 113 changer transitions 0/303 dead transitions. [2024-06-20 19:21:03,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 303 transitions, 5436 flow [2024-06-20 19:21:03,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:21:03,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:21:03,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-20 19:21:03,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48125 [2024-06-20 19:21:03,578 INFO L175 Difference]: Start difference. First operand has 149 places, 262 transitions, 4485 flow. Second operand 8 states and 154 transitions. [2024-06-20 19:21:03,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 303 transitions, 5436 flow [2024-06-20 19:21:03,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 303 transitions, 5109 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-20 19:21:03,801 INFO L231 Difference]: Finished difference. Result has 151 places, 265 transitions, 4506 flow [2024-06-20 19:21:03,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4164, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4506, PETRI_PLACES=151, PETRI_TRANSITIONS=265} [2024-06-20 19:21:03,801 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 110 predicate places. [2024-06-20 19:21:03,801 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 265 transitions, 4506 flow [2024-06-20 19:21:03,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:03,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:03,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:21:03,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-20 19:21:03,802 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:21:03,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:03,803 INFO L85 PathProgramCache]: Analyzing trace with hash -545275553, now seen corresponding path program 2 times [2024-06-20 19:21:03,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:03,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446106671] [2024-06-20 19:21:03,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:03,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:21:12,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:21:12,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:21:12,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446106671] [2024-06-20 19:21:12,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446106671] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:21:12,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:21:12,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:21:12,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361476509] [2024-06-20 19:21:12,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:21:12,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:21:12,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:21:12,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:21:12,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:21:13,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:21:13,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 265 transitions, 4506 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:13,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:21:13,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:21:13,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:21:15,392 INFO L124 PetriNetUnfolderBase]: 5031/7964 cut-off events. [2024-06-20 19:21:15,392 INFO L125 PetriNetUnfolderBase]: For 117748/117792 co-relation queries the response was YES. [2024-06-20 19:21:15,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49893 conditions, 7964 events. 5031/7964 cut-off events. For 117748/117792 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 50764 event pairs, 1951 based on Foata normal form. 42/8006 useless extension candidates. Maximal degree in co-relation 49820. Up to 7241 conditions per place. [2024-06-20 19:21:15,459 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 205 selfloop transitions, 100 changer transitions 0/308 dead transitions. [2024-06-20 19:21:15,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 308 transitions, 5541 flow [2024-06-20 19:21:15,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:21:15,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:21:15,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-20 19:21:15,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.459375 [2024-06-20 19:21:15,462 INFO L175 Difference]: Start difference. First operand has 151 places, 265 transitions, 4506 flow. Second operand 8 states and 147 transitions. [2024-06-20 19:21:15,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 308 transitions, 5541 flow [2024-06-20 19:21:15,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 308 transitions, 5279 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-20 19:21:15,711 INFO L231 Difference]: Finished difference. Result has 154 places, 275 transitions, 4681 flow [2024-06-20 19:21:15,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4258, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4681, PETRI_PLACES=154, PETRI_TRANSITIONS=275} [2024-06-20 19:21:15,712 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 113 predicate places. [2024-06-20 19:21:15,712 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 275 transitions, 4681 flow [2024-06-20 19:21:15,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:15,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:15,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:21:15,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-20 19:21:15,713 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:21:15,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:15,713 INFO L85 PathProgramCache]: Analyzing trace with hash -637167914, now seen corresponding path program 2 times [2024-06-20 19:21:15,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:15,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591184841] [2024-06-20 19:21:15,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:15,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:21:24,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:21:24,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:21:24,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591184841] [2024-06-20 19:21:24,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591184841] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:21:24,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:21:24,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:21:24,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116961458] [2024-06-20 19:21:24,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:21:24,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:21:24,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:21:24,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:21:24,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:21:24,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:21:24,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 275 transitions, 4681 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:24,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:21:24,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:21:24,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:21:26,639 INFO L124 PetriNetUnfolderBase]: 5046/7975 cut-off events. [2024-06-20 19:21:26,640 INFO L125 PetriNetUnfolderBase]: For 115025/115025 co-relation queries the response was YES. [2024-06-20 19:21:26,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50378 conditions, 7975 events. 5046/7975 cut-off events. For 115025/115025 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 50457 event pairs, 2234 based on Foata normal form. 3/7978 useless extension candidates. Maximal degree in co-relation 50303. Up to 7752 conditions per place. [2024-06-20 19:21:26,714 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 267 selfloop transitions, 30 changer transitions 0/300 dead transitions. [2024-06-20 19:21:26,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 300 transitions, 5450 flow [2024-06-20 19:21:26,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:21:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:21:26,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2024-06-20 19:21:26,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45416666666666666 [2024-06-20 19:21:26,716 INFO L175 Difference]: Start difference. First operand has 154 places, 275 transitions, 4681 flow. Second operand 6 states and 109 transitions. [2024-06-20 19:21:26,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 300 transitions, 5450 flow [2024-06-20 19:21:26,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 300 transitions, 5247 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-20 19:21:26,959 INFO L231 Difference]: Finished difference. Result has 156 places, 281 transitions, 4644 flow [2024-06-20 19:21:26,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4480, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4644, PETRI_PLACES=156, PETRI_TRANSITIONS=281} [2024-06-20 19:21:26,962 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 115 predicate places. [2024-06-20 19:21:26,962 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 281 transitions, 4644 flow [2024-06-20 19:21:26,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:26,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:26,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:21:26,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-20 19:21:26,963 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:21:26,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:26,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1406683335, now seen corresponding path program 3 times [2024-06-20 19:21:26,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:26,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900022438] [2024-06-20 19:21:26,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:26,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:21:35,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:21:35,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:21:35,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900022438] [2024-06-20 19:21:35,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900022438] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:21:35,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:21:35,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:21:35,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22114688] [2024-06-20 19:21:35,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:21:35,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:21:35,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:21:35,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:21:35,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:21:35,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:21:35,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 281 transitions, 4644 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:35,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:21:35,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:21:35,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:21:37,900 INFO L124 PetriNetUnfolderBase]: 5117/8077 cut-off events. [2024-06-20 19:21:37,900 INFO L125 PetriNetUnfolderBase]: For 114066/114066 co-relation queries the response was YES. [2024-06-20 19:21:37,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50557 conditions, 8077 events. 5117/8077 cut-off events. For 114066/114066 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 51056 event pairs, 2352 based on Foata normal form. 6/8083 useless extension candidates. Maximal degree in co-relation 50481. Up to 7799 conditions per place. [2024-06-20 19:21:37,973 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 283 selfloop transitions, 38 changer transitions 0/324 dead transitions. [2024-06-20 19:21:37,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 324 transitions, 5701 flow [2024-06-20 19:21:37,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:21:37,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:21:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-20 19:21:37,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-20 19:21:37,975 INFO L175 Difference]: Start difference. First operand has 156 places, 281 transitions, 4644 flow. Second operand 8 states and 136 transitions. [2024-06-20 19:21:37,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 324 transitions, 5701 flow [2024-06-20 19:21:38,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 324 transitions, 5641 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-20 19:21:38,141 INFO L231 Difference]: Finished difference. Result has 161 places, 294 transitions, 4947 flow [2024-06-20 19:21:38,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4584, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4947, PETRI_PLACES=161, PETRI_TRANSITIONS=294} [2024-06-20 19:21:38,143 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 120 predicate places. [2024-06-20 19:21:38,143 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 294 transitions, 4947 flow [2024-06-20 19:21:38,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:38,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:38,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:21:38,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-20 19:21:38,143 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:21:38,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:38,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1178782185, now seen corresponding path program 4 times [2024-06-20 19:21:38,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:38,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968681555] [2024-06-20 19:21:38,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:38,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:21:46,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:21:46,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:21:46,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968681555] [2024-06-20 19:21:46,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968681555] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:21:46,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:21:46,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:21:46,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464841122] [2024-06-20 19:21:46,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:21:46,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:21:46,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:21:46,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:21:46,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:21:46,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:21:46,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 294 transitions, 4947 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:46,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:21:46,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:21:46,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:21:48,487 INFO L124 PetriNetUnfolderBase]: 5104/8058 cut-off events. [2024-06-20 19:21:48,488 INFO L125 PetriNetUnfolderBase]: For 116134/116134 co-relation queries the response was YES. [2024-06-20 19:21:48,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51010 conditions, 8058 events. 5104/8058 cut-off events. For 116134/116134 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 50941 event pairs, 2354 based on Foata normal form. 6/8064 useless extension candidates. Maximal degree in co-relation 50933. Up to 7816 conditions per place. [2024-06-20 19:21:48,562 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 295 selfloop transitions, 29 changer transitions 0/327 dead transitions. [2024-06-20 19:21:48,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 327 transitions, 5871 flow [2024-06-20 19:21:48,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:21:48,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:21:48,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-20 19:21:48,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415625 [2024-06-20 19:21:48,564 INFO L175 Difference]: Start difference. First operand has 161 places, 294 transitions, 4947 flow. Second operand 8 states and 133 transitions. [2024-06-20 19:21:48,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 327 transitions, 5871 flow [2024-06-20 19:21:48,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 327 transitions, 5741 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-06-20 19:21:48,785 INFO L231 Difference]: Finished difference. Result has 165 places, 300 transitions, 5053 flow [2024-06-20 19:21:48,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4823, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5053, PETRI_PLACES=165, PETRI_TRANSITIONS=300} [2024-06-20 19:21:48,786 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 124 predicate places. [2024-06-20 19:21:48,786 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 300 transitions, 5053 flow [2024-06-20 19:21:48,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:48,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:48,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:21:48,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-20 19:21:48,787 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:21:48,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:48,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1170508223, now seen corresponding path program 1 times [2024-06-20 19:21:48,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:48,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854577358] [2024-06-20 19:21:48,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:48,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:21:56,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:21:56,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:21:56,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854577358] [2024-06-20 19:21:56,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854577358] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:21:56,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:21:56,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:21:56,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748169958] [2024-06-20 19:21:56,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:21:56,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:21:56,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:21:56,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:21:56,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:21:56,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:21:56,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 300 transitions, 5053 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:56,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:21:56,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:21:56,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:21:59,185 INFO L124 PetriNetUnfolderBase]: 5139/8109 cut-off events. [2024-06-20 19:21:59,185 INFO L125 PetriNetUnfolderBase]: For 120982/120984 co-relation queries the response was YES. [2024-06-20 19:21:59,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51782 conditions, 8109 events. 5139/8109 cut-off events. For 120982/120984 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 51287 event pairs, 2354 based on Foata normal form. 4/8113 useless extension candidates. Maximal degree in co-relation 51703. Up to 7852 conditions per place. [2024-06-20 19:21:59,253 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 294 selfloop transitions, 42 changer transitions 0/339 dead transitions. [2024-06-20 19:21:59,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 339 transitions, 6147 flow [2024-06-20 19:21:59,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:21:59,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:21:59,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2024-06-20 19:21:59,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-20 19:21:59,256 INFO L175 Difference]: Start difference. First operand has 165 places, 300 transitions, 5053 flow. Second operand 8 states and 129 transitions. [2024-06-20 19:21:59,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 339 transitions, 6147 flow [2024-06-20 19:21:59,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 339 transitions, 6054 flow, removed 31 selfloop flow, removed 4 redundant places. [2024-06-20 19:21:59,507 INFO L231 Difference]: Finished difference. Result has 169 places, 313 transitions, 5362 flow [2024-06-20 19:21:59,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4960, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5362, PETRI_PLACES=169, PETRI_TRANSITIONS=313} [2024-06-20 19:21:59,507 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 128 predicate places. [2024-06-20 19:21:59,507 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 313 transitions, 5362 flow [2024-06-20 19:21:59,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:59,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:59,508 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:21:59,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-20 19:21:59,508 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:21:59,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:59,508 INFO L85 PathProgramCache]: Analyzing trace with hash -351772703, now seen corresponding path program 5 times [2024-06-20 19:21:59,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:59,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685209117] [2024-06-20 19:21:59,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:59,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:22:07,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:22:07,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:22:07,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685209117] [2024-06-20 19:22:07,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685209117] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:22:07,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:22:07,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:22:07,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615349348] [2024-06-20 19:22:07,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:22:07,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:22:07,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:22:07,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:22:07,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:22:07,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:22:07,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 313 transitions, 5362 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:22:07,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:22:07,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:22:07,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:22:09,753 INFO L124 PetriNetUnfolderBase]: 5131/8082 cut-off events. [2024-06-20 19:22:09,754 INFO L125 PetriNetUnfolderBase]: For 125888/125888 co-relation queries the response was YES. [2024-06-20 19:22:09,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51835 conditions, 8082 events. 5131/8082 cut-off events. For 125888/125888 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 50745 event pairs, 2312 based on Foata normal form. 4/8086 useless extension candidates. Maximal degree in co-relation 51755. Up to 7885 conditions per place. [2024-06-20 19:22:09,815 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 317 selfloop transitions, 19 changer transitions 0/339 dead transitions. [2024-06-20 19:22:09,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 339 transitions, 6170 flow [2024-06-20 19:22:09,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:22:09,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:22:09,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2024-06-20 19:22:09,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39166666666666666 [2024-06-20 19:22:09,818 INFO L175 Difference]: Start difference. First operand has 169 places, 313 transitions, 5362 flow. Second operand 9 states and 141 transitions. [2024-06-20 19:22:09,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 339 transitions, 6170 flow [2024-06-20 19:22:10,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 339 transitions, 6060 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-20 19:22:10,069 INFO L231 Difference]: Finished difference. Result has 172 places, 315 transitions, 5337 flow [2024-06-20 19:22:10,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5252, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5337, PETRI_PLACES=172, PETRI_TRANSITIONS=315} [2024-06-20 19:22:10,069 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 131 predicate places. [2024-06-20 19:22:10,069 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 315 transitions, 5337 flow [2024-06-20 19:22:10,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:22:10,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:22:10,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:22:10,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-20 19:22:10,070 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:22:10,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:22:10,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1547216884, now seen corresponding path program 3 times [2024-06-20 19:22:10,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:22:10,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612294647] [2024-06-20 19:22:10,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:22:10,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:22:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:22:20,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:22:20,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:22:20,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612294647] [2024-06-20 19:22:20,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612294647] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:22:20,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:22:20,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:22:20,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695194604] [2024-06-20 19:22:20,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:22:20,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:22:20,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:22:20,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:22:20,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:22:20,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:22:20,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 315 transitions, 5337 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:22:20,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:22:20,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:22:20,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:22:22,384 INFO L124 PetriNetUnfolderBase]: 5116/8077 cut-off events. [2024-06-20 19:22:22,384 INFO L125 PetriNetUnfolderBase]: For 130292/130292 co-relation queries the response was YES. [2024-06-20 19:22:22,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51820 conditions, 8077 events. 5116/8077 cut-off events. For 130292/130292 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 51027 event pairs, 2355 based on Foata normal form. 5/8082 useless extension candidates. Maximal degree in co-relation 51739. Up to 7907 conditions per place. [2024-06-20 19:22:22,458 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 306 selfloop transitions, 17 changer transitions 0/326 dead transitions. [2024-06-20 19:22:22,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 326 transitions, 6019 flow [2024-06-20 19:22:22,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:22:22,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:22:22,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2024-06-20 19:22:22,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2024-06-20 19:22:22,460 INFO L175 Difference]: Start difference. First operand has 172 places, 315 transitions, 5337 flow. Second operand 6 states and 98 transitions. [2024-06-20 19:22:22,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 326 transitions, 6019 flow [2024-06-20 19:22:22,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 326 transitions, 5919 flow, removed 31 selfloop flow, removed 7 redundant places. [2024-06-20 19:22:22,724 INFO L231 Difference]: Finished difference. Result has 171 places, 315 transitions, 5281 flow [2024-06-20 19:22:22,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5237, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5281, PETRI_PLACES=171, PETRI_TRANSITIONS=315} [2024-06-20 19:22:22,725 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 130 predicate places. [2024-06-20 19:22:22,725 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 315 transitions, 5281 flow [2024-06-20 19:22:22,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:22:22,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:22:22,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:22:22,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-20 19:22:22,726 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:22:22,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:22:22,726 INFO L85 PathProgramCache]: Analyzing trace with hash -631448042, now seen corresponding path program 1 times [2024-06-20 19:22:22,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:22:22,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974911695] [2024-06-20 19:22:22,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:22:22,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:22:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:22:31,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:22:31,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:22:31,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974911695] [2024-06-20 19:22:31,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974911695] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:22:31,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:22:31,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:22:31,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955827670] [2024-06-20 19:22:31,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:22:31,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:22:31,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:22:31,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:22:31,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:22:31,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:22:31,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 315 transitions, 5281 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:22:31,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:22:31,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:22:31,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:22:33,639 INFO L124 PetriNetUnfolderBase]: 5131/8098 cut-off events. [2024-06-20 19:22:33,639 INFO L125 PetriNetUnfolderBase]: For 133219/133219 co-relation queries the response was YES. [2024-06-20 19:22:33,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51977 conditions, 8098 events. 5131/8098 cut-off events. For 133219/133219 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 51115 event pairs, 2355 based on Foata normal form. 3/8101 useless extension candidates. Maximal degree in co-relation 51896. Up to 7909 conditions per place. [2024-06-20 19:22:33,724 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 316 selfloop transitions, 19 changer transitions 0/338 dead transitions. [2024-06-20 19:22:33,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 338 transitions, 6115 flow [2024-06-20 19:22:33,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:22:33,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:22:33,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-20 19:22:33,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2024-06-20 19:22:33,725 INFO L175 Difference]: Start difference. First operand has 171 places, 315 transitions, 5281 flow. Second operand 6 states and 106 transitions. [2024-06-20 19:22:33,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 338 transitions, 6115 flow [2024-06-20 19:22:33,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 338 transitions, 6059 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-20 19:22:33,996 INFO L231 Difference]: Finished difference. Result has 172 places, 321 transitions, 5331 flow [2024-06-20 19:22:33,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5225, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5331, PETRI_PLACES=172, PETRI_TRANSITIONS=321} [2024-06-20 19:22:33,997 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 131 predicate places. [2024-06-20 19:22:33,997 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 321 transitions, 5331 flow [2024-06-20 19:22:33,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:22:33,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:22:33,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:22:33,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-20 19:22:33,998 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:22:33,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:22:33,998 INFO L85 PathProgramCache]: Analyzing trace with hash 347537848, now seen corresponding path program 2 times [2024-06-20 19:22:33,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:22:33,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605024976] [2024-06-20 19:22:33,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:22:33,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:22:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:22:42,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:22:42,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:22:42,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605024976] [2024-06-20 19:22:42,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605024976] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:22:42,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:22:42,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:22:42,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315286799] [2024-06-20 19:22:42,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:22:42,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:22:42,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:22:42,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:22:42,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:22:42,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:22:42,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 321 transitions, 5331 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:22:42,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:22:42,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:22:42,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:22:44,937 INFO L124 PetriNetUnfolderBase]: 5122/8087 cut-off events. [2024-06-20 19:22:44,938 INFO L125 PetriNetUnfolderBase]: For 139784/139786 co-relation queries the response was YES. [2024-06-20 19:22:44,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52624 conditions, 8087 events. 5122/8087 cut-off events. For 139784/139786 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 51131 event pairs, 2356 based on Foata normal form. 5/8092 useless extension candidates. Maximal degree in co-relation 52542. Up to 7902 conditions per place. [2024-06-20 19:22:45,000 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 311 selfloop transitions, 19 changer transitions 0/333 dead transitions. [2024-06-20 19:22:45,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 333 transitions, 6031 flow [2024-06-20 19:22:45,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:22:45,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:22:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2024-06-20 19:22:45,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-20 19:22:45,006 INFO L175 Difference]: Start difference. First operand has 172 places, 321 transitions, 5331 flow. Second operand 6 states and 100 transitions. [2024-06-20 19:22:45,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 333 transitions, 6031 flow [2024-06-20 19:22:45,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 333 transitions, 5980 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-06-20 19:22:45,287 INFO L231 Difference]: Finished difference. Result has 176 places, 321 transitions, 5325 flow [2024-06-20 19:22:45,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5280, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5325, PETRI_PLACES=176, PETRI_TRANSITIONS=321} [2024-06-20 19:22:45,288 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 135 predicate places. [2024-06-20 19:22:45,288 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 321 transitions, 5325 flow [2024-06-20 19:22:45,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:22:45,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:22:45,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:22:45,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-20 19:22:45,289 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:22:45,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:22:45,289 INFO L85 PathProgramCache]: Analyzing trace with hash -127687990, now seen corresponding path program 1 times [2024-06-20 19:22:45,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:22:45,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679988519] [2024-06-20 19:22:45,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:22:45,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:22:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:22:57,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:22:57,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:22:57,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679988519] [2024-06-20 19:22:57,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679988519] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:22:57,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:22:57,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:22:57,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391979338] [2024-06-20 19:22:57,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:22:57,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:22:57,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:22:57,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:22:57,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:22:57,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:22:57,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 321 transitions, 5325 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:22:57,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:22:57,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:22:57,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:22:59,818 INFO L124 PetriNetUnfolderBase]: 5209/8207 cut-off events. [2024-06-20 19:22:59,819 INFO L125 PetriNetUnfolderBase]: For 146931/146961 co-relation queries the response was YES. [2024-06-20 19:22:59,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53373 conditions, 8207 events. 5209/8207 cut-off events. For 146931/146961 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 51912 event pairs, 1980 based on Foata normal form. 28/8235 useless extension candidates. Maximal degree in co-relation 53289. Up to 7775 conditions per place. [2024-06-20 19:22:59,883 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 326 selfloop transitions, 60 changer transitions 0/389 dead transitions. [2024-06-20 19:22:59,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 389 transitions, 6835 flow [2024-06-20 19:22:59,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:22:59,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:22:59,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-20 19:22:59,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.465625 [2024-06-20 19:22:59,886 INFO L175 Difference]: Start difference. First operand has 176 places, 321 transitions, 5325 flow. Second operand 8 states and 149 transitions. [2024-06-20 19:22:59,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 389 transitions, 6835 flow [2024-06-20 19:23:00,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 389 transitions, 6769 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-20 19:23:00,186 INFO L231 Difference]: Finished difference. Result has 182 places, 356 transitions, 5949 flow [2024-06-20 19:23:00,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5273, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5949, PETRI_PLACES=182, PETRI_TRANSITIONS=356} [2024-06-20 19:23:00,187 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 141 predicate places. [2024-06-20 19:23:00,187 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 356 transitions, 5949 flow [2024-06-20 19:23:00,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:23:00,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:23:00,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:23:00,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-20 19:23:00,188 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:23:00,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:23:00,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1956471729, now seen corresponding path program 1 times [2024-06-20 19:23:00,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:23:00,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038085229] [2024-06-20 19:23:00,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:23:00,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:23:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:23:09,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:23:09,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:23:09,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038085229] [2024-06-20 19:23:09,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038085229] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:23:09,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:23:09,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:23:09,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149763709] [2024-06-20 19:23:09,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:23:09,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:23:09,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:23:09,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:23:09,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:23:09,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:23:09,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 356 transitions, 5949 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:23:09,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:23:09,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:23:09,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:23:12,286 INFO L124 PetriNetUnfolderBase]: 5322/8396 cut-off events. [2024-06-20 19:23:12,287 INFO L125 PetriNetUnfolderBase]: For 159537/159559 co-relation queries the response was YES. [2024-06-20 19:23:12,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56901 conditions, 8396 events. 5322/8396 cut-off events. For 159537/159559 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 53402 event pairs, 2018 based on Foata normal form. 22/8418 useless extension candidates. Maximal degree in co-relation 56813. Up to 7653 conditions per place. [2024-06-20 19:23:12,374 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 274 selfloop transitions, 153 changer transitions 0/430 dead transitions. [2024-06-20 19:23:12,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 430 transitions, 7797 flow [2024-06-20 19:23:12,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:23:12,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:23:12,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-20 19:23:12,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-20 19:23:12,377 INFO L175 Difference]: Start difference. First operand has 182 places, 356 transitions, 5949 flow. Second operand 9 states and 165 transitions. [2024-06-20 19:23:12,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 430 transitions, 7797 flow [2024-06-20 19:23:12,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 430 transitions, 7697 flow, removed 49 selfloop flow, removed 1 redundant places. [2024-06-20 19:23:12,773 INFO L231 Difference]: Finished difference. Result has 192 places, 395 transitions, 7129 flow [2024-06-20 19:23:12,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5867, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7129, PETRI_PLACES=192, PETRI_TRANSITIONS=395} [2024-06-20 19:23:12,774 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 151 predicate places. [2024-06-20 19:23:12,774 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 395 transitions, 7129 flow [2024-06-20 19:23:12,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:23:12,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:23:12,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:23:12,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-20 19:23:12,775 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:23:12,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:23:12,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1950907539, now seen corresponding path program 2 times [2024-06-20 19:23:12,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:23:12,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597681113] [2024-06-20 19:23:12,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:23:12,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:23:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:23:24,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:23:24,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:23:24,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597681113] [2024-06-20 19:23:24,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597681113] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:23:24,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:23:24,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:23:24,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259285608] [2024-06-20 19:23:24,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:23:24,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:23:24,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:23:24,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:23:24,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:23:24,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:23:24,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 395 transitions, 7129 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:23:24,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:23:24,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:23:24,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:23:27,177 INFO L124 PetriNetUnfolderBase]: 5420/8542 cut-off events. [2024-06-20 19:23:27,177 INFO L125 PetriNetUnfolderBase]: For 172441/172463 co-relation queries the response was YES. [2024-06-20 19:23:27,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59286 conditions, 8542 events. 5420/8542 cut-off events. For 172441/172463 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 54446 event pairs, 2041 based on Foata normal form. 22/8564 useless extension candidates. Maximal degree in co-relation 59193. Up to 7750 conditions per place. [2024-06-20 19:23:27,250 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 283 selfloop transitions, 167 changer transitions 0/453 dead transitions. [2024-06-20 19:23:27,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 453 transitions, 8813 flow [2024-06-20 19:23:27,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:23:27,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:23:27,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-20 19:23:27,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4527777777777778 [2024-06-20 19:23:27,269 INFO L175 Difference]: Start difference. First operand has 192 places, 395 transitions, 7129 flow. Second operand 9 states and 163 transitions. [2024-06-20 19:23:27,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 453 transitions, 8813 flow [2024-06-20 19:23:27,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 453 transitions, 8545 flow, removed 38 selfloop flow, removed 4 redundant places. [2024-06-20 19:23:27,677 INFO L231 Difference]: Finished difference. Result has 199 places, 421 transitions, 7978 flow [2024-06-20 19:23:27,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6880, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7978, PETRI_PLACES=199, PETRI_TRANSITIONS=421} [2024-06-20 19:23:27,679 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 158 predicate places. [2024-06-20 19:23:27,679 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 421 transitions, 7978 flow [2024-06-20 19:23:27,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:23:27,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:23:27,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:23:27,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-20 19:23:27,679 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:23:27,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:23:27,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1950900099, now seen corresponding path program 3 times [2024-06-20 19:23:27,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:23:27,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093086430] [2024-06-20 19:23:27,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:23:27,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:23:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:23:38,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:23:38,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:23:38,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093086430] [2024-06-20 19:23:38,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093086430] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:23:38,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:23:38,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:23:38,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790998107] [2024-06-20 19:23:38,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:23:38,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:23:38,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:23:38,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:23:38,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:23:39,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:23:39,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 421 transitions, 7978 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:23:39,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:23:39,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:23:39,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:23:41,950 INFO L124 PetriNetUnfolderBase]: 5497/8665 cut-off events. [2024-06-20 19:23:41,950 INFO L125 PetriNetUnfolderBase]: For 185494/185512 co-relation queries the response was YES. [2024-06-20 19:23:41,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60862 conditions, 8665 events. 5497/8665 cut-off events. For 185494/185512 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 55387 event pairs, 2024 based on Foata normal form. 20/8685 useless extension candidates. Maximal degree in co-relation 60766. Up to 7694 conditions per place. [2024-06-20 19:23:42,031 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 281 selfloop transitions, 180 changer transitions 0/464 dead transitions. [2024-06-20 19:23:42,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 464 transitions, 9262 flow [2024-06-20 19:23:42,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:23:42,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:23:42,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-20 19:23:42,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2024-06-20 19:23:42,035 INFO L175 Difference]: Start difference. First operand has 199 places, 421 transitions, 7978 flow. Second operand 9 states and 164 transitions. [2024-06-20 19:23:42,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 464 transitions, 9262 flow [2024-06-20 19:23:42,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 464 transitions, 8972 flow, removed 49 selfloop flow, removed 4 redundant places. [2024-06-20 19:23:42,482 INFO L231 Difference]: Finished difference. Result has 205 places, 431 transitions, 8263 flow [2024-06-20 19:23:42,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7688, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8263, PETRI_PLACES=205, PETRI_TRANSITIONS=431} [2024-06-20 19:23:42,482 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 164 predicate places. [2024-06-20 19:23:42,483 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 431 transitions, 8263 flow [2024-06-20 19:23:42,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:23:42,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:23:42,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:23:42,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-20 19:23:42,483 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:23:42,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:23:42,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1411046122, now seen corresponding path program 2 times [2024-06-20 19:23:42,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:23:42,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195705980] [2024-06-20 19:23:42,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:23:42,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:23:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:23:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:23:52,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:23:52,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195705980] [2024-06-20 19:23:52,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195705980] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:23:52,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:23:52,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:23:52,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647336763] [2024-06-20 19:23:52,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:23:52,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:23:52,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:23:52,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:23:52,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:23:52,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:23:52,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 431 transitions, 8263 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:23:52,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:23:52,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:23:52,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:23:55,173 INFO L124 PetriNetUnfolderBase]: 5653/8864 cut-off events. [2024-06-20 19:23:55,173 INFO L125 PetriNetUnfolderBase]: For 202804/202820 co-relation queries the response was YES. [2024-06-20 19:23:55,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63036 conditions, 8864 events. 5653/8864 cut-off events. For 202804/202820 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 56271 event pairs, 2057 based on Foata normal form. 20/8884 useless extension candidates. Maximal degree in co-relation 62938. Up to 8290 conditions per place. [2024-06-20 19:23:55,262 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 403 selfloop transitions, 86 changer transitions 0/492 dead transitions. [2024-06-20 19:23:55,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 492 transitions, 9948 flow [2024-06-20 19:23:55,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:23:55,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:23:55,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-20 19:23:55,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-20 19:23:55,263 INFO L175 Difference]: Start difference. First operand has 205 places, 431 transitions, 8263 flow. Second operand 8 states and 152 transitions. [2024-06-20 19:23:55,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 492 transitions, 9948 flow [2024-06-20 19:23:55,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 492 transitions, 9765 flow, removed 42 selfloop flow, removed 4 redundant places. [2024-06-20 19:23:55,726 INFO L231 Difference]: Finished difference. Result has 212 places, 460 transitions, 8762 flow [2024-06-20 19:23:55,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8082, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8762, PETRI_PLACES=212, PETRI_TRANSITIONS=460} [2024-06-20 19:23:55,728 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 171 predicate places. [2024-06-20 19:23:55,728 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 460 transitions, 8762 flow [2024-06-20 19:23:55,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:23:55,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:23:55,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:23:55,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-20 19:23:55,729 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:23:55,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:23:55,729 INFO L85 PathProgramCache]: Analyzing trace with hash -819963232, now seen corresponding path program 3 times [2024-06-20 19:23:55,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:23:55,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595950998] [2024-06-20 19:23:55,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:23:55,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:23:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:24:09,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:24:09,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:24:09,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595950998] [2024-06-20 19:24:09,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595950998] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:24:09,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:24:09,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:24:09,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421712488] [2024-06-20 19:24:09,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:24:09,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:24:09,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:24:09,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:24:09,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:24:09,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:24:09,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 460 transitions, 8762 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:24:09,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:24:09,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:24:09,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:24:12,100 INFO L124 PetriNetUnfolderBase]: 5641/8852 cut-off events. [2024-06-20 19:24:12,100 INFO L125 PetriNetUnfolderBase]: For 211395/211413 co-relation queries the response was YES. [2024-06-20 19:24:12,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64264 conditions, 8852 events. 5641/8852 cut-off events. For 211395/211413 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 56204 event pairs, 2049 based on Foata normal form. 20/8872 useless extension candidates. Maximal degree in co-relation 64161. Up to 8286 conditions per place. [2024-06-20 19:24:12,187 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 400 selfloop transitions, 83 changer transitions 0/486 dead transitions. [2024-06-20 19:24:12,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 486 transitions, 9981 flow [2024-06-20 19:24:12,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:24:12,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:24:12,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-20 19:24:12,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-20 19:24:12,189 INFO L175 Difference]: Start difference. First operand has 212 places, 460 transitions, 8762 flow. Second operand 8 states and 144 transitions. [2024-06-20 19:24:12,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 486 transitions, 9981 flow [2024-06-20 19:24:12,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 486 transitions, 9841 flow, removed 63 selfloop flow, removed 2 redundant places. [2024-06-20 19:24:12,669 INFO L231 Difference]: Finished difference. Result has 218 places, 460 transitions, 8801 flow [2024-06-20 19:24:12,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8622, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8801, PETRI_PLACES=218, PETRI_TRANSITIONS=460} [2024-06-20 19:24:12,670 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 177 predicate places. [2024-06-20 19:24:12,670 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 460 transitions, 8801 flow [2024-06-20 19:24:12,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:24:12,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:24:12,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:24:12,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-20 19:24:12,671 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:24:12,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:24:12,671 INFO L85 PathProgramCache]: Analyzing trace with hash 945519838, now seen corresponding path program 4 times [2024-06-20 19:24:12,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:24:12,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328861820] [2024-06-20 19:24:12,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:24:12,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:24:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:24:22,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:24:22,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:24:22,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328861820] [2024-06-20 19:24:22,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328861820] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:24:22,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:24:22,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:24:22,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886644016] [2024-06-20 19:24:22,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:24:22,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:24:22,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:24:22,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:24:22,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:24:22,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:24:22,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 460 transitions, 8801 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:24:22,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:24:22,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:24:22,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:24:25,493 INFO L124 PetriNetUnfolderBase]: 5687/8914 cut-off events. [2024-06-20 19:24:25,493 INFO L125 PetriNetUnfolderBase]: For 221073/221091 co-relation queries the response was YES. [2024-06-20 19:24:25,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65148 conditions, 8914 events. 5687/8914 cut-off events. For 221073/221091 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 56568 event pairs, 2049 based on Foata normal form. 22/8936 useless extension candidates. Maximal degree in co-relation 65043. Up to 8204 conditions per place. [2024-06-20 19:24:25,592 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 379 selfloop transitions, 121 changer transitions 0/503 dead transitions. [2024-06-20 19:24:25,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 503 transitions, 10321 flow [2024-06-20 19:24:25,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:24:25,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:24:25,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-20 19:24:25,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.453125 [2024-06-20 19:24:25,595 INFO L175 Difference]: Start difference. First operand has 218 places, 460 transitions, 8801 flow. Second operand 8 states and 145 transitions. [2024-06-20 19:24:25,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 503 transitions, 10321 flow [2024-06-20 19:24:26,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 503 transitions, 10101 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-20 19:24:26,129 INFO L231 Difference]: Finished difference. Result has 223 places, 476 transitions, 9265 flow [2024-06-20 19:24:26,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8587, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9265, PETRI_PLACES=223, PETRI_TRANSITIONS=476} [2024-06-20 19:24:26,130 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 182 predicate places. [2024-06-20 19:24:26,130 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 476 transitions, 9265 flow [2024-06-20 19:24:26,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:24:26,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:24:26,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:24:26,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-20 19:24:26,131 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:24:26,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:24:26,131 INFO L85 PathProgramCache]: Analyzing trace with hash 199812301, now seen corresponding path program 4 times [2024-06-20 19:24:26,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:24:26,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516394404] [2024-06-20 19:24:26,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:24:26,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:24:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:24:34,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:24:34,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:24:34,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516394404] [2024-06-20 19:24:34,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516394404] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:24:34,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:24:34,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:24:34,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165474200] [2024-06-20 19:24:34,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:24:34,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:24:34,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:24:34,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:24:34,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:24:34,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:24:34,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 476 transitions, 9265 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:24:34,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:24:34,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:24:34,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:24:36,926 INFO L124 PetriNetUnfolderBase]: 5769/9050 cut-off events. [2024-06-20 19:24:36,927 INFO L125 PetriNetUnfolderBase]: For 239724/239726 co-relation queries the response was YES. [2024-06-20 19:24:37,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67706 conditions, 9050 events. 5769/9050 cut-off events. For 239724/239726 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 57609 event pairs, 2443 based on Foata normal form. 8/9058 useless extension candidates. Maximal degree in co-relation 67599. Up to 8364 conditions per place. [2024-06-20 19:24:37,066 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 367 selfloop transitions, 159 changer transitions 0/529 dead transitions. [2024-06-20 19:24:37,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 529 transitions, 11045 flow [2024-06-20 19:24:37,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:24:37,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:24:37,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-20 19:24:37,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-20 19:24:37,071 INFO L175 Difference]: Start difference. First operand has 223 places, 476 transitions, 9265 flow. Second operand 9 states and 150 transitions. [2024-06-20 19:24:37,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 529 transitions, 11045 flow [2024-06-20 19:24:37,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 529 transitions, 10916 flow, removed 48 selfloop flow, removed 4 redundant places. [2024-06-20 19:24:37,855 INFO L231 Difference]: Finished difference. Result has 229 places, 497 transitions, 10038 flow [2024-06-20 19:24:37,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9138, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10038, PETRI_PLACES=229, PETRI_TRANSITIONS=497} [2024-06-20 19:24:37,856 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 188 predicate places. [2024-06-20 19:24:37,856 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 497 transitions, 10038 flow [2024-06-20 19:24:37,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:24:37,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:24:37,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:24:37,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-20 19:24:37,856 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:24:37,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:24:37,857 INFO L85 PathProgramCache]: Analyzing trace with hash 2002644157, now seen corresponding path program 5 times [2024-06-20 19:24:37,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:24:37,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104088321] [2024-06-20 19:24:37,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:24:37,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:24:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:24:46,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:24:46,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:24:46,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104088321] [2024-06-20 19:24:46,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104088321] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:24:46,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:24:46,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:24:46,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814645329] [2024-06-20 19:24:46,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:24:46,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:24:46,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:24:46,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:24:46,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:24:46,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:24:46,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 497 transitions, 10038 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:24:46,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:24:46,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:24:46,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:24:49,355 INFO L124 PetriNetUnfolderBase]: 5882/9223 cut-off events. [2024-06-20 19:24:49,356 INFO L125 PetriNetUnfolderBase]: For 240103/240105 co-relation queries the response was YES. [2024-06-20 19:24:49,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69073 conditions, 9223 events. 5882/9223 cut-off events. For 240103/240105 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 58799 event pairs, 2458 based on Foata normal form. 8/9231 useless extension candidates. Maximal degree in co-relation 68964. Up to 8256 conditions per place. [2024-06-20 19:24:49,465 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 360 selfloop transitions, 179 changer transitions 0/542 dead transitions. [2024-06-20 19:24:49,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 542 transitions, 11681 flow [2024-06-20 19:24:49,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:24:49,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:24:49,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-20 19:24:49,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2024-06-20 19:24:49,469 INFO L175 Difference]: Start difference. First operand has 229 places, 497 transitions, 10038 flow. Second operand 9 states and 152 transitions. [2024-06-20 19:24:49,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 542 transitions, 11681 flow [2024-06-20 19:24:50,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 542 transitions, 11296 flow, removed 77 selfloop flow, removed 5 redundant places. [2024-06-20 19:24:50,155 INFO L231 Difference]: Finished difference. Result has 234 places, 510 transitions, 10348 flow [2024-06-20 19:24:50,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9656, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10348, PETRI_PLACES=234, PETRI_TRANSITIONS=510} [2024-06-20 19:24:50,156 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 193 predicate places. [2024-06-20 19:24:50,156 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 510 transitions, 10348 flow [2024-06-20 19:24:50,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:24:50,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:24:50,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:24:50,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-20 19:24:50,157 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:24:50,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:24:50,157 INFO L85 PathProgramCache]: Analyzing trace with hash 194449921, now seen corresponding path program 6 times [2024-06-20 19:24:50,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:24:50,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476006895] [2024-06-20 19:24:50,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:24:50,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:24:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:24:58,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:24:58,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:24:58,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476006895] [2024-06-20 19:24:58,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476006895] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:24:58,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:24:58,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:24:58,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813325285] [2024-06-20 19:24:58,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:24:58,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:24:58,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:24:58,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:24:58,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:24:58,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:24:58,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 510 transitions, 10348 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:24:58,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:24:58,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:24:58,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:25:01,318 INFO L124 PetriNetUnfolderBase]: 5864/9203 cut-off events. [2024-06-20 19:25:01,318 INFO L125 PetriNetUnfolderBase]: For 248891/248893 co-relation queries the response was YES. [2024-06-20 19:25:01,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68991 conditions, 9203 events. 5864/9203 cut-off events. For 248891/248893 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 58754 event pairs, 2468 based on Foata normal form. 10/9213 useless extension candidates. Maximal degree in co-relation 68881. Up to 8509 conditions per place. [2024-06-20 19:25:01,408 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 372 selfloop transitions, 168 changer transitions 0/543 dead transitions. [2024-06-20 19:25:01,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 543 transitions, 11660 flow [2024-06-20 19:25:01,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:25:01,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:25:01,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-20 19:25:01,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2024-06-20 19:25:01,411 INFO L175 Difference]: Start difference. First operand has 234 places, 510 transitions, 10348 flow. Second operand 9 states and 152 transitions. [2024-06-20 19:25:01,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 543 transitions, 11660 flow [2024-06-20 19:25:02,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 543 transitions, 11374 flow, removed 67 selfloop flow, removed 4 redundant places. [2024-06-20 19:25:02,036 INFO L231 Difference]: Finished difference. Result has 240 places, 512 transitions, 10540 flow [2024-06-20 19:25:02,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10062, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10540, PETRI_PLACES=240, PETRI_TRANSITIONS=512} [2024-06-20 19:25:02,037 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 199 predicate places. [2024-06-20 19:25:02,037 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 512 transitions, 10540 flow [2024-06-20 19:25:02,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:25:02,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:25:02,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:25:02,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-20 19:25:02,038 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:25:02,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:25:02,038 INFO L85 PathProgramCache]: Analyzing trace with hash 708906762, now seen corresponding path program 5 times [2024-06-20 19:25:02,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:25:02,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772492822] [2024-06-20 19:25:02,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:25:02,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:25:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:25:12,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:25:12,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:25:12,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772492822] [2024-06-20 19:25:12,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772492822] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:25:12,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:25:12,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:25:12,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433201488] [2024-06-20 19:25:12,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:25:12,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:25:12,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:25:12,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:25:12,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:25:12,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:25:12,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 512 transitions, 10540 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:25:12,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:25:12,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:25:12,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:25:15,263 INFO L124 PetriNetUnfolderBase]: 5948/9311 cut-off events. [2024-06-20 19:25:15,263 INFO L125 PetriNetUnfolderBase]: For 257801/257817 co-relation queries the response was YES. [2024-06-20 19:25:15,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70817 conditions, 9311 events. 5948/9311 cut-off events. For 257801/257817 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 59351 event pairs, 2088 based on Foata normal form. 20/9331 useless extension candidates. Maximal degree in co-relation 70704. Up to 8538 conditions per place. [2024-06-20 19:25:15,379 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 428 selfloop transitions, 119 changer transitions 0/550 dead transitions. [2024-06-20 19:25:15,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 550 transitions, 12126 flow [2024-06-20 19:25:15,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:25:15,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:25:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-20 19:25:15,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-20 19:25:15,381 INFO L175 Difference]: Start difference. First operand has 240 places, 512 transitions, 10540 flow. Second operand 7 states and 130 transitions. [2024-06-20 19:25:15,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 550 transitions, 12126 flow [2024-06-20 19:25:16,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 550 transitions, 11845 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-20 19:25:16,218 INFO L231 Difference]: Finished difference. Result has 243 places, 526 transitions, 10834 flow [2024-06-20 19:25:16,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10259, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10834, PETRI_PLACES=243, PETRI_TRANSITIONS=526} [2024-06-20 19:25:16,219 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 202 predicate places. [2024-06-20 19:25:16,219 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 526 transitions, 10834 flow [2024-06-20 19:25:16,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:25:16,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:25:16,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:25:16,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-20 19:25:16,220 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:25:16,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:25:16,220 INFO L85 PathProgramCache]: Analyzing trace with hash 909328369, now seen corresponding path program 7 times [2024-06-20 19:25:16,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:25:16,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278063508] [2024-06-20 19:25:16,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:25:16,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:25:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:25:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:25:25,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:25:25,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278063508] [2024-06-20 19:25:25,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278063508] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:25:25,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:25:25,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:25:25,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547062378] [2024-06-20 19:25:25,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:25:25,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:25:25,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:25:25,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:25:25,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:25:25,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:25:25,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 526 transitions, 10834 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:25:25,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:25:25,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:25:25,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:25:28,528 INFO L124 PetriNetUnfolderBase]: 5976/9367 cut-off events. [2024-06-20 19:25:28,529 INFO L125 PetriNetUnfolderBase]: For 266949/266960 co-relation queries the response was YES. [2024-06-20 19:25:28,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71720 conditions, 9367 events. 5976/9367 cut-off events. For 266949/266960 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 60126 event pairs, 2144 based on Foata normal form. 14/9381 useless extension candidates. Maximal degree in co-relation 71605. Up to 8356 conditions per place. [2024-06-20 19:25:28,671 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 335 selfloop transitions, 218 changer transitions 0/556 dead transitions. [2024-06-20 19:25:28,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 556 transitions, 12189 flow [2024-06-20 19:25:28,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:25:28,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:25:28,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-20 19:25:28,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-06-20 19:25:28,674 INFO L175 Difference]: Start difference. First operand has 243 places, 526 transitions, 10834 flow. Second operand 7 states and 132 transitions. [2024-06-20 19:25:28,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 556 transitions, 12189 flow [2024-06-20 19:25:29,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 556 transitions, 12002 flow, removed 37 selfloop flow, removed 4 redundant places. [2024-06-20 19:25:29,498 INFO L231 Difference]: Finished difference. Result has 246 places, 529 transitions, 11235 flow [2024-06-20 19:25:29,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10647, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=215, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11235, PETRI_PLACES=246, PETRI_TRANSITIONS=529} [2024-06-20 19:25:29,498 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 205 predicate places. [2024-06-20 19:25:29,499 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 529 transitions, 11235 flow [2024-06-20 19:25:29,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:25:29,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:25:29,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:25:29,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-20 19:25:29,499 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:25:29,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:25:29,500 INFO L85 PathProgramCache]: Analyzing trace with hash 909335809, now seen corresponding path program 8 times [2024-06-20 19:25:29,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:25:29,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126406066] [2024-06-20 19:25:29,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:25:29,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:25:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:25:37,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:25:37,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:25:37,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126406066] [2024-06-20 19:25:37,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126406066] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:25:37,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:25:37,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:25:37,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341601945] [2024-06-20 19:25:37,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:25:37,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:25:37,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:25:37,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:25:37,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:25:38,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:25:38,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 529 transitions, 11235 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:25:38,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:25:38,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:25:38,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:25:41,127 INFO L124 PetriNetUnfolderBase]: 6060/9506 cut-off events. [2024-06-20 19:25:41,128 INFO L125 PetriNetUnfolderBase]: For 280998/281014 co-relation queries the response was YES. [2024-06-20 19:25:41,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73347 conditions, 9506 events. 6060/9506 cut-off events. For 280998/281014 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 61195 event pairs, 2141 based on Foata normal form. 20/9526 useless extension candidates. Maximal degree in co-relation 73232. Up to 8147 conditions per place. [2024-06-20 19:25:41,230 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 340 selfloop transitions, 217 changer transitions 0/560 dead transitions. [2024-06-20 19:25:41,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 560 transitions, 12678 flow [2024-06-20 19:25:41,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:25:41,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:25:41,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-20 19:25:41,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-20 19:25:41,236 INFO L175 Difference]: Start difference. First operand has 246 places, 529 transitions, 11235 flow. Second operand 7 states and 126 transitions. [2024-06-20 19:25:41,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 560 transitions, 12678 flow [2024-06-20 19:25:42,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 560 transitions, 12123 flow, removed 72 selfloop flow, removed 6 redundant places. [2024-06-20 19:25:42,041 INFO L231 Difference]: Finished difference. Result has 248 places, 538 transitions, 11465 flow [2024-06-20 19:25:42,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10751, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=208, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11465, PETRI_PLACES=248, PETRI_TRANSITIONS=538} [2024-06-20 19:25:42,041 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 207 predicate places. [2024-06-20 19:25:42,042 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 538 transitions, 11465 flow [2024-06-20 19:25:42,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:25:42,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:25:42,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:25:42,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-20 19:25:42,042 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:25:42,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:25:42,043 INFO L85 PathProgramCache]: Analyzing trace with hash 993051123, now seen corresponding path program 9 times [2024-06-20 19:25:42,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:25:42,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999631387] [2024-06-20 19:25:42,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:25:42,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:25:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:25:50,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:25:50,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:25:50,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999631387] [2024-06-20 19:25:50,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999631387] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:25:50,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:25:50,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:25:50,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616774978] [2024-06-20 19:25:50,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:25:50,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:25:50,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:25:50,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:25:50,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:25:50,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:25:50,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 538 transitions, 11465 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:25:50,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:25:50,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:25:50,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:25:53,783 INFO L124 PetriNetUnfolderBase]: 6052/9460 cut-off events. [2024-06-20 19:25:53,783 INFO L125 PetriNetUnfolderBase]: For 267849/267851 co-relation queries the response was YES. [2024-06-20 19:25:53,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72996 conditions, 9460 events. 6052/9460 cut-off events. For 267849/267851 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 60122 event pairs, 2530 based on Foata normal form. 4/9464 useless extension candidates. Maximal degree in co-relation 72880. Up to 9221 conditions per place. [2024-06-20 19:25:53,903 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 540 selfloop transitions, 18 changer transitions 0/561 dead transitions. [2024-06-20 19:25:53,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 561 transitions, 12719 flow [2024-06-20 19:25:53,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:25:53,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:25:53,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-20 19:25:53,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-20 19:25:53,907 INFO L175 Difference]: Start difference. First operand has 248 places, 538 transitions, 11465 flow. Second operand 7 states and 119 transitions. [2024-06-20 19:25:53,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 561 transitions, 12719 flow [2024-06-20 19:25:54,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 561 transitions, 12283 flow, removed 47 selfloop flow, removed 4 redundant places. [2024-06-20 19:25:54,761 INFO L231 Difference]: Finished difference. Result has 251 places, 540 transitions, 11122 flow [2024-06-20 19:25:54,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11029, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11122, PETRI_PLACES=251, PETRI_TRANSITIONS=540} [2024-06-20 19:25:54,762 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 210 predicate places. [2024-06-20 19:25:54,762 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 540 transitions, 11122 flow [2024-06-20 19:25:54,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:25:54,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:25:54,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:25:54,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-20 19:25:54,763 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:25:54,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:25:54,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1721401169, now seen corresponding path program 10 times [2024-06-20 19:25:54,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:25:54,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880943151] [2024-06-20 19:25:54,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:25:54,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:25:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:26:03,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:26:03,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:26:03,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880943151] [2024-06-20 19:26:03,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880943151] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:26:03,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:26:03,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:26:03,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238710397] [2024-06-20 19:26:03,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:26:03,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:26:03,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:26:03,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:26:03,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:26:03,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:26:03,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 540 transitions, 11122 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:26:03,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:26:03,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:26:03,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:26:06,791 INFO L124 PetriNetUnfolderBase]: 6039/9475 cut-off events. [2024-06-20 19:26:06,791 INFO L125 PetriNetUnfolderBase]: For 250495/250511 co-relation queries the response was YES. [2024-06-20 19:26:06,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71520 conditions, 9475 events. 6039/9475 cut-off events. For 250495/250511 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 61036 event pairs, 2122 based on Foata normal form. 18/9493 useless extension candidates. Maximal degree in co-relation 71403. Up to 8003 conditions per place. [2024-06-20 19:26:06,901 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 329 selfloop transitions, 233 changer transitions 0/565 dead transitions. [2024-06-20 19:26:06,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 565 transitions, 12446 flow [2024-06-20 19:26:06,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:26:06,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:26:06,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-20 19:26:06,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45357142857142857 [2024-06-20 19:26:06,905 INFO L175 Difference]: Start difference. First operand has 251 places, 540 transitions, 11122 flow. Second operand 7 states and 127 transitions. [2024-06-20 19:26:06,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 565 transitions, 12446 flow [2024-06-20 19:26:07,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 565 transitions, 12371 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-20 19:26:07,668 INFO L231 Difference]: Finished difference. Result has 253 places, 543 transitions, 11653 flow [2024-06-20 19:26:07,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11047, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=230, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11653, PETRI_PLACES=253, PETRI_TRANSITIONS=543} [2024-06-20 19:26:07,669 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 212 predicate places. [2024-06-20 19:26:07,670 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 543 transitions, 11653 flow [2024-06-20 19:26:07,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:26:07,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:26:07,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:26:07,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-20 19:26:07,671 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:26:07,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:26:07,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2076894790, now seen corresponding path program 6 times [2024-06-20 19:26:07,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:26:07,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232153714] [2024-06-20 19:26:07,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:26:07,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:26:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:26:17,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:26:17,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:26:17,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232153714] [2024-06-20 19:26:17,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232153714] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:26:17,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:26:17,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:26:17,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792121181] [2024-06-20 19:26:17,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:26:17,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:26:17,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:26:17,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:26:17,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:26:18,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:26:18,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 543 transitions, 11653 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:26:18,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:26:18,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:26:18,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:26:20,927 INFO L124 PetriNetUnfolderBase]: 6027/9446 cut-off events. [2024-06-20 19:26:20,927 INFO L125 PetriNetUnfolderBase]: For 264350/264352 co-relation queries the response was YES. [2024-06-20 19:26:21,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72526 conditions, 9446 events. 6027/9446 cut-off events. For 264350/264352 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 60457 event pairs, 2547 based on Foata normal form. 8/9454 useless extension candidates. Maximal degree in co-relation 72408. Up to 9134 conditions per place. [2024-06-20 19:26:21,046 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 514 selfloop transitions, 41 changer transitions 0/558 dead transitions. [2024-06-20 19:26:21,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 558 transitions, 12893 flow [2024-06-20 19:26:21,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:26:21,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:26:21,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-06-20 19:26:21,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-20 19:26:21,048 INFO L175 Difference]: Start difference. First operand has 253 places, 543 transitions, 11653 flow. Second operand 8 states and 127 transitions. [2024-06-20 19:26:21,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 558 transitions, 12893 flow [2024-06-20 19:26:21,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 558 transitions, 12319 flow, removed 65 selfloop flow, removed 5 redundant places. [2024-06-20 19:26:21,940 INFO L231 Difference]: Finished difference. Result has 256 places, 543 transitions, 11177 flow [2024-06-20 19:26:21,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11081, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11177, PETRI_PLACES=256, PETRI_TRANSITIONS=543} [2024-06-20 19:26:21,941 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 215 predicate places. [2024-06-20 19:26:21,941 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 543 transitions, 11177 flow [2024-06-20 19:26:21,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:26:21,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:26:21,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:26:21,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-20 19:26:21,942 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:26:21,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:26:21,942 INFO L85 PathProgramCache]: Analyzing trace with hash 2066351070, now seen corresponding path program 1 times [2024-06-20 19:26:21,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:26:21,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422610586] [2024-06-20 19:26:21,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:26:21,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:26:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:26:34,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:26:34,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:26:34,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422610586] [2024-06-20 19:26:34,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422610586] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:26:34,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:26:34,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:26:34,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438211138] [2024-06-20 19:26:34,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:26:34,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:26:34,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:26:34,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:26:34,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:26:34,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:26:34,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 543 transitions, 11177 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:26:34,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:26:34,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:26:34,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:26:37,914 INFO L124 PetriNetUnfolderBase]: 6092/9540 cut-off events. [2024-06-20 19:26:37,914 INFO L125 PetriNetUnfolderBase]: For 255368/255368 co-relation queries the response was YES. [2024-06-20 19:26:37,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71987 conditions, 9540 events. 6092/9540 cut-off events. For 255368/255368 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 61064 event pairs, 2554 based on Foata normal form. 6/9546 useless extension candidates. Maximal degree in co-relation 71868. Up to 9300 conditions per place. [2024-06-20 19:26:38,020 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 545 selfloop transitions, 31 changer transitions 0/579 dead transitions. [2024-06-20 19:26:38,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 579 transitions, 12739 flow [2024-06-20 19:26:38,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:26:38,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:26:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2024-06-20 19:26:38,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-20 19:26:38,021 INFO L175 Difference]: Start difference. First operand has 256 places, 543 transitions, 11177 flow. Second operand 9 states and 140 transitions. [2024-06-20 19:26:38,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 579 transitions, 12739 flow [2024-06-20 19:26:38,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 579 transitions, 12558 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-20 19:26:38,834 INFO L231 Difference]: Finished difference. Result has 260 places, 560 transitions, 11411 flow [2024-06-20 19:26:38,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11002, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11411, PETRI_PLACES=260, PETRI_TRANSITIONS=560} [2024-06-20 19:26:38,835 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 219 predicate places. [2024-06-20 19:26:38,835 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 560 transitions, 11411 flow [2024-06-20 19:26:38,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:26:38,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:26:38,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:26:38,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-20 19:26:38,836 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:26:38,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:26:38,836 INFO L85 PathProgramCache]: Analyzing trace with hash -884607084, now seen corresponding path program 2 times [2024-06-20 19:26:38,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:26:38,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733274346] [2024-06-20 19:26:38,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:26:38,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:26:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:26:50,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:26:50,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:26:50,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733274346] [2024-06-20 19:26:50,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733274346] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:26:50,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:26:50,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:26:50,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526543996] [2024-06-20 19:26:50,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:26:50,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:26:50,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:26:50,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:26:50,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:26:50,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:26:50,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 560 transitions, 11411 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:26:50,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:26:50,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:26:50,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:26:53,742 INFO L124 PetriNetUnfolderBase]: 6122/9582 cut-off events. [2024-06-20 19:26:53,742 INFO L125 PetriNetUnfolderBase]: For 263267/263267 co-relation queries the response was YES. [2024-06-20 19:26:53,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72694 conditions, 9582 events. 6122/9582 cut-off events. For 263267/263267 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 61329 event pairs, 2562 based on Foata normal form. 6/9588 useless extension candidates. Maximal degree in co-relation 72574. Up to 9314 conditions per place. [2024-06-20 19:26:53,874 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 544 selfloop transitions, 33 changer transitions 0/580 dead transitions. [2024-06-20 19:26:53,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 580 transitions, 12689 flow [2024-06-20 19:26:53,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:26:53,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:26:53,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-20 19:26:53,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2024-06-20 19:26:53,882 INFO L175 Difference]: Start difference. First operand has 260 places, 560 transitions, 11411 flow. Second operand 7 states and 116 transitions. [2024-06-20 19:26:53,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 580 transitions, 12689 flow [2024-06-20 19:26:54,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 580 transitions, 12610 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-06-20 19:26:54,766 INFO L231 Difference]: Finished difference. Result has 263 places, 563 transitions, 11470 flow [2024-06-20 19:26:54,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11342, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11470, PETRI_PLACES=263, PETRI_TRANSITIONS=563} [2024-06-20 19:26:54,767 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 222 predicate places. [2024-06-20 19:26:54,767 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 563 transitions, 11470 flow [2024-06-20 19:26:54,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:26:54,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:26:54,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:26:54,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-20 19:26:54,768 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:26:54,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:26:54,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1899947968, now seen corresponding path program 3 times [2024-06-20 19:26:54,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:26:54,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258853389] [2024-06-20 19:26:54,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:26:54,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:26:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:27:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:27:08,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:27:08,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258853389] [2024-06-20 19:27:08,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258853389] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:27:08,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:27:08,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:27:08,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347665445] [2024-06-20 19:27:08,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:27:08,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:27:08,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:27:08,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:27:08,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:27:08,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:27:08,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 563 transitions, 11470 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:08,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:27:08,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:27:08,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:27:11,523 INFO L124 PetriNetUnfolderBase]: 6152/9624 cut-off events. [2024-06-20 19:27:11,524 INFO L125 PetriNetUnfolderBase]: For 273239/273239 co-relation queries the response was YES. [2024-06-20 19:27:11,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73684 conditions, 9624 events. 6152/9624 cut-off events. For 273239/273239 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 61575 event pairs, 2556 based on Foata normal form. 6/9630 useless extension candidates. Maximal degree in co-relation 73563. Up to 9258 conditions per place. [2024-06-20 19:27:11,626 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 540 selfloop transitions, 49 changer transitions 0/592 dead transitions. [2024-06-20 19:27:11,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 592 transitions, 12930 flow [2024-06-20 19:27:11,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:27:11,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:27:11,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-20 19:27:11,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-20 19:27:11,628 INFO L175 Difference]: Start difference. First operand has 263 places, 563 transitions, 11470 flow. Second operand 7 states and 125 transitions. [2024-06-20 19:27:11,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 592 transitions, 12930 flow [2024-06-20 19:27:12,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 592 transitions, 12821 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-20 19:27:12,457 INFO L231 Difference]: Finished difference. Result has 264 places, 569 transitions, 11570 flow [2024-06-20 19:27:12,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11375, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11570, PETRI_PLACES=264, PETRI_TRANSITIONS=569} [2024-06-20 19:27:12,458 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 223 predicate places. [2024-06-20 19:27:12,458 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 569 transitions, 11570 flow [2024-06-20 19:27:12,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:12,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:27:12,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:27:12,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-20 19:27:12,459 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:27:12,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:27:12,459 INFO L85 PathProgramCache]: Analyzing trace with hash -2111227810, now seen corresponding path program 4 times [2024-06-20 19:27:12,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:27:12,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878407419] [2024-06-20 19:27:12,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:27:12,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:27:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:27:26,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:27:26,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:27:26,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878407419] [2024-06-20 19:27:26,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878407419] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:27:26,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:27:26,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:27:26,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18813545] [2024-06-20 19:27:26,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:27:26,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:27:26,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:27:26,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:27:26,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:27:26,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:27:26,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 569 transitions, 11570 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:26,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:27:26,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:27:26,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:27:29,528 INFO L124 PetriNetUnfolderBase]: 6134/9601 cut-off events. [2024-06-20 19:27:29,528 INFO L125 PetriNetUnfolderBase]: For 270483/270487 co-relation queries the response was YES. [2024-06-20 19:27:29,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73282 conditions, 9601 events. 6134/9601 cut-off events. For 270483/270487 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 61403 event pairs, 2555 based on Foata normal form. 6/9607 useless extension candidates. Maximal degree in co-relation 73160. Up to 9247 conditions per place. [2024-06-20 19:27:29,654 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 534 selfloop transitions, 49 changer transitions 0/586 dead transitions. [2024-06-20 19:27:29,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 586 transitions, 12822 flow [2024-06-20 19:27:29,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:27:29,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:27:29,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-20 19:27:29,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-20 19:27:29,656 INFO L175 Difference]: Start difference. First operand has 264 places, 569 transitions, 11570 flow. Second operand 7 states and 119 transitions. [2024-06-20 19:27:29,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 586 transitions, 12822 flow [2024-06-20 19:27:30,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 586 transitions, 12740 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-06-20 19:27:30,558 INFO L231 Difference]: Finished difference. Result has 268 places, 569 transitions, 11593 flow [2024-06-20 19:27:30,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11488, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11593, PETRI_PLACES=268, PETRI_TRANSITIONS=569} [2024-06-20 19:27:30,558 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 227 predicate places. [2024-06-20 19:27:30,559 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 569 transitions, 11593 flow [2024-06-20 19:27:30,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:30,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:27:30,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:27:30,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-20 19:27:30,559 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:27:30,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:27:30,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1214288700, now seen corresponding path program 1 times [2024-06-20 19:27:30,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:27:30,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240342736] [2024-06-20 19:27:30,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:27:30,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:27:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:27:44,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:27:44,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:27:44,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240342736] [2024-06-20 19:27:44,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240342736] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:27:44,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:27:44,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:27:44,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472787314] [2024-06-20 19:27:44,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:27:44,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:27:44,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:27:44,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:27:44,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:27:44,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:27:44,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 569 transitions, 11593 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:44,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:27:44,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:27:44,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:27:47,365 INFO L124 PetriNetUnfolderBase]: 6129/9593 cut-off events. [2024-06-20 19:27:47,366 INFO L125 PetriNetUnfolderBase]: For 274044/274044 co-relation queries the response was YES. [2024-06-20 19:27:47,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73332 conditions, 9593 events. 6129/9593 cut-off events. For 274044/274044 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 61320 event pairs, 2555 based on Foata normal form. 2/9595 useless extension candidates. Maximal degree in co-relation 73208. Up to 9408 conditions per place. [2024-06-20 19:27:47,479 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 565 selfloop transitions, 14 changer transitions 0/582 dead transitions. [2024-06-20 19:27:47,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 582 transitions, 12829 flow [2024-06-20 19:27:47,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:27:47,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:27:47,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2024-06-20 19:27:47,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3821428571428571 [2024-06-20 19:27:47,480 INFO L175 Difference]: Start difference. First operand has 268 places, 569 transitions, 11593 flow. Second operand 7 states and 107 transitions. [2024-06-20 19:27:47,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 582 transitions, 12829 flow [2024-06-20 19:27:48,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 582 transitions, 12671 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-20 19:27:48,272 INFO L231 Difference]: Finished difference. Result has 268 places, 571 transitions, 11510 flow [2024-06-20 19:27:48,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11435, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11510, PETRI_PLACES=268, PETRI_TRANSITIONS=571} [2024-06-20 19:27:48,272 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 227 predicate places. [2024-06-20 19:27:48,273 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 571 transitions, 11510 flow [2024-06-20 19:27:48,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:27:48,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:27:48,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:27:48,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-20 19:27:48,273 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:27:48,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:27:48,274 INFO L85 PathProgramCache]: Analyzing trace with hash 832401947, now seen corresponding path program 1 times [2024-06-20 19:27:48,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:27:48,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468659671] [2024-06-20 19:27:48,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:27:48,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:27:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:28:00,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:28:00,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:28:00,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468659671] [2024-06-20 19:28:00,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468659671] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:28:00,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:28:00,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:28:00,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533556079] [2024-06-20 19:28:00,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:28:00,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:28:00,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:28:00,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:28:00,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:28:00,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:28:00,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 571 transitions, 11510 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:28:00,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:28:00,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:28:00,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:28:03,907 INFO L124 PetriNetUnfolderBase]: 6147/9629 cut-off events. [2024-06-20 19:28:03,907 INFO L125 PetriNetUnfolderBase]: For 280930/280941 co-relation queries the response was YES. [2024-06-20 19:28:03,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73556 conditions, 9629 events. 6147/9629 cut-off events. For 280930/280941 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 61900 event pairs, 2055 based on Foata normal form. 12/9641 useless extension candidates. Maximal degree in co-relation 73432. Up to 9001 conditions per place. [2024-06-20 19:28:04,037 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 517 selfloop transitions, 112 changer transitions 0/632 dead transitions. [2024-06-20 19:28:04,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 632 transitions, 13439 flow [2024-06-20 19:28:04,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:28:04,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:28:04,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-20 19:28:04,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-20 19:28:04,039 INFO L175 Difference]: Start difference. First operand has 268 places, 571 transitions, 11510 flow. Second operand 9 states and 165 transitions. [2024-06-20 19:28:04,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 632 transitions, 13439 flow [2024-06-20 19:28:04,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 632 transitions, 13371 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-20 19:28:04,984 INFO L231 Difference]: Finished difference. Result has 276 places, 595 transitions, 12185 flow [2024-06-20 19:28:04,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11442, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12185, PETRI_PLACES=276, PETRI_TRANSITIONS=595} [2024-06-20 19:28:04,985 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 235 predicate places. [2024-06-20 19:28:04,985 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 595 transitions, 12185 flow [2024-06-20 19:28:04,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:28:04,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:28:04,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:28:04,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-20 19:28:04,986 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:28:04,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:28:04,986 INFO L85 PathProgramCache]: Analyzing trace with hash -794296626, now seen corresponding path program 1 times [2024-06-20 19:28:04,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:28:04,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513516862] [2024-06-20 19:28:04,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:28:04,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:28:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:28:16,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:28:16,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:28:16,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513516862] [2024-06-20 19:28:16,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513516862] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:28:16,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:28:16,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:28:16,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304160208] [2024-06-20 19:28:16,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:28:16,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:28:16,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:28:16,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:28:16,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:28:16,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:28:16,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 595 transitions, 12185 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:28:16,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:28:16,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:28:16,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:28:19,803 INFO L124 PetriNetUnfolderBase]: 6215/9744 cut-off events. [2024-06-20 19:28:19,803 INFO L125 PetriNetUnfolderBase]: For 310051/310069 co-relation queries the response was YES. [2024-06-20 19:28:19,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76318 conditions, 9744 events. 6215/9744 cut-off events. For 310051/310069 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 62882 event pairs, 2102 based on Foata normal form. 34/9778 useless extension candidates. Maximal degree in co-relation 76190. Up to 8743 conditions per place. [2024-06-20 19:28:19,935 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 434 selfloop transitions, 198 changer transitions 0/635 dead transitions. [2024-06-20 19:28:19,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 635 transitions, 13705 flow [2024-06-20 19:28:19,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:28:19,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:28:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions. [2024-06-20 19:28:19,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-20 19:28:19,938 INFO L175 Difference]: Start difference. First operand has 276 places, 595 transitions, 12185 flow. Second operand 10 states and 180 transitions. [2024-06-20 19:28:19,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 635 transitions, 13705 flow [2024-06-20 19:28:20,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 635 transitions, 13617 flow, removed 36 selfloop flow, removed 2 redundant places. [2024-06-20 19:28:20,840 INFO L231 Difference]: Finished difference. Result has 284 places, 597 transitions, 12585 flow [2024-06-20 19:28:20,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12097, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=196, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12585, PETRI_PLACES=284, PETRI_TRANSITIONS=597} [2024-06-20 19:28:20,850 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 243 predicate places. [2024-06-20 19:28:20,850 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 597 transitions, 12585 flow [2024-06-20 19:28:20,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:28:20,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:28:20,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:28:20,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-20 19:28:20,851 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:28:20,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:28:20,851 INFO L85 PathProgramCache]: Analyzing trace with hash 304975601, now seen corresponding path program 2 times [2024-06-20 19:28:20,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:28:20,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127920828] [2024-06-20 19:28:20,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:28:20,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:28:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:28:32,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:28:32,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:28:32,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127920828] [2024-06-20 19:28:32,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127920828] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:28:32,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:28:32,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:28:32,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44445836] [2024-06-20 19:28:32,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:28:32,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:28:32,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:28:32,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:28:32,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:28:32,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:28:32,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 597 transitions, 12585 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:28:32,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:28:32,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:28:32,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:28:35,467 INFO L124 PetriNetUnfolderBase]: 6272/9820 cut-off events. [2024-06-20 19:28:35,468 INFO L125 PetriNetUnfolderBase]: For 317488/317499 co-relation queries the response was YES. [2024-06-20 19:28:35,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77832 conditions, 9820 events. 6272/9820 cut-off events. For 317488/317499 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 63305 event pairs, 2110 based on Foata normal form. 12/9832 useless extension candidates. Maximal degree in co-relation 77702. Up to 9282 conditions per place. [2024-06-20 19:28:35,598 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 534 selfloop transitions, 111 changer transitions 0/648 dead transitions. [2024-06-20 19:28:35,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 648 transitions, 14401 flow [2024-06-20 19:28:35,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:28:35,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:28:35,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-20 19:28:35,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2024-06-20 19:28:35,599 INFO L175 Difference]: Start difference. First operand has 284 places, 597 transitions, 12585 flow. Second operand 9 states and 164 transitions. [2024-06-20 19:28:35,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 648 transitions, 14401 flow [2024-06-20 19:28:36,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 648 transitions, 13990 flow, removed 33 selfloop flow, removed 7 redundant places. [2024-06-20 19:28:36,524 INFO L231 Difference]: Finished difference. Result has 287 places, 614 transitions, 12663 flow [2024-06-20 19:28:36,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12174, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=490, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12663, PETRI_PLACES=287, PETRI_TRANSITIONS=614} [2024-06-20 19:28:36,526 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 246 predicate places. [2024-06-20 19:28:36,526 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 614 transitions, 12663 flow [2024-06-20 19:28:36,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:28:36,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:28:36,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:28:36,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-20 19:28:36,527 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:28:36,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:28:36,527 INFO L85 PathProgramCache]: Analyzing trace with hash 336640241, now seen corresponding path program 3 times [2024-06-20 19:28:36,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:28:36,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228030467] [2024-06-20 19:28:36,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:28:36,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:28:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:28:49,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:28:49,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:28:49,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228030467] [2024-06-20 19:28:49,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228030467] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:28:49,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:28:49,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:28:49,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919157040] [2024-06-20 19:28:49,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:28:49,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:28:49,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:28:49,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:28:49,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:28:49,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:28:49,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 614 transitions, 12663 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:28:49,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:28:49,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:28:49,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:28:53,071 INFO L124 PetriNetUnfolderBase]: 6286/9837 cut-off events. [2024-06-20 19:28:53,071 INFO L125 PetriNetUnfolderBase]: For 321402/321415 co-relation queries the response was YES. [2024-06-20 19:28:53,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77589 conditions, 9837 events. 6286/9837 cut-off events. For 321402/321415 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 63379 event pairs, 2114 based on Foata normal form. 18/9855 useless extension candidates. Maximal degree in co-relation 77457. Up to 9280 conditions per place. [2024-06-20 19:28:53,187 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 531 selfloop transitions, 116 changer transitions 0/650 dead transitions. [2024-06-20 19:28:53,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 650 transitions, 14248 flow [2024-06-20 19:28:53,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:28:53,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:28:53,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-20 19:28:53,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4527777777777778 [2024-06-20 19:28:53,189 INFO L175 Difference]: Start difference. First operand has 287 places, 614 transitions, 12663 flow. Second operand 9 states and 163 transitions. [2024-06-20 19:28:53,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 650 transitions, 14248 flow [2024-06-20 19:28:54,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 650 transitions, 14044 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-20 19:28:54,121 INFO L231 Difference]: Finished difference. Result has 291 places, 619 transitions, 12787 flow [2024-06-20 19:28:54,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12459, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=614, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12787, PETRI_PLACES=291, PETRI_TRANSITIONS=619} [2024-06-20 19:28:54,121 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 250 predicate places. [2024-06-20 19:28:54,121 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 619 transitions, 12787 flow [2024-06-20 19:28:54,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:28:54,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:28:54,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:28:54,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-20 19:28:54,122 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:28:54,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:28:54,122 INFO L85 PathProgramCache]: Analyzing trace with hash -621653221, now seen corresponding path program 1 times [2024-06-20 19:28:54,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:28:54,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359654847] [2024-06-20 19:28:54,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:28:54,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:28:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:29:05,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:29:05,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:29:05,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359654847] [2024-06-20 19:29:05,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359654847] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:29:05,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:29:05,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:29:05,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508292577] [2024-06-20 19:29:05,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:29:05,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:29:05,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:29:05,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:29:05,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:29:05,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:29:05,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 619 transitions, 12787 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:29:05,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:29:05,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:29:05,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:29:08,900 INFO L124 PetriNetUnfolderBase]: 6378/9966 cut-off events. [2024-06-20 19:29:08,900 INFO L125 PetriNetUnfolderBase]: For 343248/343273 co-relation queries the response was YES. [2024-06-20 19:29:08,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80467 conditions, 9966 events. 6378/9966 cut-off events. For 343248/343273 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 64101 event pairs, 2157 based on Foata normal form. 28/9994 useless extension candidates. Maximal degree in co-relation 80333. Up to 9301 conditions per place. [2024-06-20 19:29:09,021 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 548 selfloop transitions, 120 changer transitions 0/671 dead transitions. [2024-06-20 19:29:09,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 671 transitions, 14989 flow [2024-06-20 19:29:09,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:29:09,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:29:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-20 19:29:09,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-20 19:29:09,023 INFO L175 Difference]: Start difference. First operand has 291 places, 619 transitions, 12787 flow. Second operand 9 states and 165 transitions. [2024-06-20 19:29:09,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 671 transitions, 14989 flow [2024-06-20 19:29:10,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 671 transitions, 14740 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-20 19:29:10,059 INFO L231 Difference]: Finished difference. Result has 296 places, 638 transitions, 13303 flow [2024-06-20 19:29:10,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=12557, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13303, PETRI_PLACES=296, PETRI_TRANSITIONS=638} [2024-06-20 19:29:10,060 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 255 predicate places. [2024-06-20 19:29:10,060 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 638 transitions, 13303 flow [2024-06-20 19:29:10,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:29:10,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:29:10,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:29:10,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-20 19:29:10,061 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:29:10,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:29:10,061 INFO L85 PathProgramCache]: Analyzing trace with hash -628037703, now seen corresponding path program 2 times [2024-06-20 19:29:10,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:29:10,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884314764] [2024-06-20 19:29:10,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:29:10,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:29:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:29:19,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:29:19,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:29:19,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884314764] [2024-06-20 19:29:19,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884314764] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:29:19,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:29:19,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:29:19,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98831290] [2024-06-20 19:29:19,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:29:19,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:29:19,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:29:19,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:29:19,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:29:19,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:29:19,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 638 transitions, 13303 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:29:19,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:29:19,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:29:19,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:29:22,835 INFO L124 PetriNetUnfolderBase]: 6408/10009 cut-off events. [2024-06-20 19:29:22,835 INFO L125 PetriNetUnfolderBase]: For 355175/355200 co-relation queries the response was YES. [2024-06-20 19:29:22,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81292 conditions, 10009 events. 6408/10009 cut-off events. For 355175/355200 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 64351 event pairs, 2160 based on Foata normal form. 28/10037 useless extension candidates. Maximal degree in co-relation 81155. Up to 9323 conditions per place. [2024-06-20 19:29:22,967 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 545 selfloop transitions, 128 changer transitions 0/676 dead transitions. [2024-06-20 19:29:22,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 676 transitions, 15221 flow [2024-06-20 19:29:22,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:29:22,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:29:22,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-20 19:29:22,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.471875 [2024-06-20 19:29:22,969 INFO L175 Difference]: Start difference. First operand has 296 places, 638 transitions, 13303 flow. Second operand 8 states and 151 transitions. [2024-06-20 19:29:22,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 676 transitions, 15221 flow [2024-06-20 19:29:23,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 676 transitions, 14989 flow, removed 40 selfloop flow, removed 5 redundant places. [2024-06-20 19:29:23,988 INFO L231 Difference]: Finished difference. Result has 299 places, 645 transitions, 13517 flow [2024-06-20 19:29:23,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=13082, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=13517, PETRI_PLACES=299, PETRI_TRANSITIONS=645} [2024-06-20 19:29:23,988 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 258 predicate places. [2024-06-20 19:29:23,989 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 645 transitions, 13517 flow [2024-06-20 19:29:23,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:29:23,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:29:23,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:29:23,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-20 19:29:23,989 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:29:23,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:29:23,990 INFO L85 PathProgramCache]: Analyzing trace with hash 337198974, now seen corresponding path program 2 times [2024-06-20 19:29:23,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:29:23,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706451840] [2024-06-20 19:29:23,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:29:23,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:29:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:29:35,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:29:35,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:29:35,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706451840] [2024-06-20 19:29:35,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706451840] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:29:35,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:29:35,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:29:35,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526571958] [2024-06-20 19:29:35,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:29:35,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:29:35,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:29:35,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:29:35,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:29:35,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:29:35,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 645 transitions, 13517 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:29:35,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:29:35,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:29:35,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:29:39,112 INFO L124 PetriNetUnfolderBase]: 6476/10130 cut-off events. [2024-06-20 19:29:39,112 INFO L125 PetriNetUnfolderBase]: For 376638/376653 co-relation queries the response was YES. [2024-06-20 19:29:39,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82333 conditions, 10130 events. 6476/10130 cut-off events. For 376638/376653 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 65615 event pairs, 2155 based on Foata normal form. 32/10162 useless extension candidates. Maximal degree in co-relation 82196. Up to 9152 conditions per place. [2024-06-20 19:29:39,252 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 479 selfloop transitions, 205 changer transitions 0/687 dead transitions. [2024-06-20 19:29:39,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 687 transitions, 15167 flow [2024-06-20 19:29:39,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:29:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:29:39,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-06-20 19:29:39,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4525 [2024-06-20 19:29:39,255 INFO L175 Difference]: Start difference. First operand has 299 places, 645 transitions, 13517 flow. Second operand 10 states and 181 transitions. [2024-06-20 19:29:39,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 687 transitions, 15167 flow [2024-06-20 19:29:40,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 687 transitions, 14918 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-20 19:29:40,368 INFO L231 Difference]: Finished difference. Result has 303 places, 647 transitions, 13774 flow [2024-06-20 19:29:40,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=13268, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13774, PETRI_PLACES=303, PETRI_TRANSITIONS=647} [2024-06-20 19:29:40,369 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 262 predicate places. [2024-06-20 19:29:40,369 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 647 transitions, 13774 flow [2024-06-20 19:29:40,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:29:40,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:29:40,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:29:40,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-20 19:29:40,370 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:29:40,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:29:40,370 INFO L85 PathProgramCache]: Analyzing trace with hash -348591020, now seen corresponding path program 3 times [2024-06-20 19:29:40,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:29:40,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920869101] [2024-06-20 19:29:40,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:29:40,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:29:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:29:52,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:29:52,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:29:52,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920869101] [2024-06-20 19:29:52,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920869101] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:29:52,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:29:52,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:29:52,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599810813] [2024-06-20 19:29:52,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:29:52,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:29:52,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:29:52,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:29:52,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:29:53,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:29:53,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 647 transitions, 13774 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:29:53,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:29:53,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:29:53,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:29:56,805 INFO L124 PetriNetUnfolderBase]: 6544/10246 cut-off events. [2024-06-20 19:29:56,805 INFO L125 PetriNetUnfolderBase]: For 387959/387986 co-relation queries the response was YES. [2024-06-20 19:29:56,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83450 conditions, 10246 events. 6544/10246 cut-off events. For 387959/387986 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 66602 event pairs, 2181 based on Foata normal form. 42/10288 useless extension candidates. Maximal degree in co-relation 83313. Up to 9268 conditions per place. [2024-06-20 19:29:56,929 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 487 selfloop transitions, 198 changer transitions 0/688 dead transitions. [2024-06-20 19:29:56,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 688 transitions, 15426 flow [2024-06-20 19:29:56,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:29:56,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:29:56,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2024-06-20 19:29:56,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4475 [2024-06-20 19:29:56,932 INFO L175 Difference]: Start difference. First operand has 303 places, 647 transitions, 13774 flow. Second operand 10 states and 179 transitions. [2024-06-20 19:29:56,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 688 transitions, 15426 flow [2024-06-20 19:29:57,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 688 transitions, 14955 flow, removed 35 selfloop flow, removed 8 redundant places. [2024-06-20 19:29:57,964 INFO L231 Difference]: Finished difference. Result has 305 places, 649 transitions, 13799 flow [2024-06-20 19:29:57,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=13303, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=647, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=196, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13799, PETRI_PLACES=305, PETRI_TRANSITIONS=649} [2024-06-20 19:29:57,965 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 264 predicate places. [2024-06-20 19:29:57,965 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 649 transitions, 13799 flow [2024-06-20 19:29:57,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:29:57,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:29:57,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:29:57,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-20 19:29:57,966 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:29:57,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:29:57,966 INFO L85 PathProgramCache]: Analyzing trace with hash -348360380, now seen corresponding path program 4 times [2024-06-20 19:29:57,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:29:57,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407151001] [2024-06-20 19:29:57,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:29:57,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:29:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:30:09,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:30:09,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:30:09,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407151001] [2024-06-20 19:30:09,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407151001] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:30:09,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:30:09,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:30:09,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544085057] [2024-06-20 19:30:09,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:30:09,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:30:09,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:30:09,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:30:09,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:30:09,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-20 19:30:09,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 649 transitions, 13799 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:30:09,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:30:09,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-20 19:30:09,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:30:13,080 INFO L124 PetriNetUnfolderBase]: 6612/10369 cut-off events. [2024-06-20 19:30:13,081 INFO L125 PetriNetUnfolderBase]: For 401381/401408 co-relation queries the response was YES. [2024-06-20 19:30:13,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84271 conditions, 10369 events. 6612/10369 cut-off events. For 401381/401408 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 67738 event pairs, 2177 based on Foata normal form. 42/10411 useless extension candidates. Maximal degree in co-relation 84133. Up to 9178 conditions per place. [2024-06-20 19:30:13,213 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 469 selfloop transitions, 218 changer transitions 0/690 dead transitions. [2024-06-20 19:30:13,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 690 transitions, 15447 flow [2024-06-20 19:30:13,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:30:13,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:30:13,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2024-06-20 19:30:13,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4475 [2024-06-20 19:30:13,216 INFO L175 Difference]: Start difference. First operand has 305 places, 649 transitions, 13799 flow. Second operand 10 states and 179 transitions. [2024-06-20 19:30:13,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 690 transitions, 15447 flow [2024-06-20 19:30:14,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 690 transitions, 14929 flow, removed 37 selfloop flow, removed 9 redundant places. [2024-06-20 19:30:14,416 INFO L231 Difference]: Finished difference. Result has 306 places, 651 transitions, 13821 flow [2024-06-20 19:30:14,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=13281, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13821, PETRI_PLACES=306, PETRI_TRANSITIONS=651} [2024-06-20 19:30:14,417 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 265 predicate places. [2024-06-20 19:30:14,417 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 651 transitions, 13821 flow [2024-06-20 19:30:14,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:30:14,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:30:14,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:30:14,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-20 19:30:14,417 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:30:14,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:30:14,418 INFO L85 PathProgramCache]: Analyzing trace with hash -622323783, now seen corresponding path program 3 times [2024-06-20 19:30:14,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:30:14,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388890408] [2024-06-20 19:30:14,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:30:14,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:30:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15