./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 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/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m [2024-06-14 15:53:15,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 15:53:15,279 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 15:53:15,283 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 15:53:15,284 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 15:53:15,313 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 15:53:15,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 15:53:15,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 15:53:15,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 15:53:15,319 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 15:53:15,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 15:53:15,320 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 15:53:15,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 15:53:15,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 15:53:15,322 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 15:53:15,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 15:53:15,323 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 15:53:15,323 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 15:53:15,323 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 15:53:15,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 15:53:15,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 15:53:15,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 15:53:15,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 15:53:15,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 15:53:15,325 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 15:53:15,326 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 15:53:15,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 15:53:15,326 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 15:53:15,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 15:53:15,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 15:53:15,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 15:53:15,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 15:53:15,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:53:15,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 15:53:15,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 15:53:15,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 15:53:15,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 15:53:15,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 15:53:15,335 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 15:53:15,336 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 15:53:15,336 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 15:53:15,336 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 15:53:15,336 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 15:53:15,337 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-14 15:53:15,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 15:53:15,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 15:53:15,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 15:53:15,623 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 15:53:15,624 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 15:53:15,625 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/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-14 15:53:15,836 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 15:53:15,836 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 15:53:15,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-14 15:53:16,970 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 15:53:17,213 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 15:53:17,214 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-14 15:53:17,230 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a15dc0c82/c3774a100f204d84abe5c0103f71e305/FLAG435089d81 [2024-06-14 15:53:17,243 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a15dc0c82/c3774a100f204d84abe5c0103f71e305 [2024-06-14 15:53:17,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 15:53:17,244 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 15:53:17,245 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 15:53:17,245 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 15:53:17,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 15:53:17,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:53:15" (1/2) ... [2024-06-14 15:53:17,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42edd120 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:53:17, skipping insertion in model container [2024-06-14 15:53:17,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:53:15" (1/2) ... [2024-06-14 15:53:17,256 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@72a04204 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:53:17, skipping insertion in model container [2024-06-14 15:53:17,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:53:17" (2/2) ... [2024-06-14 15:53:17,256 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42edd120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:53:17, skipping insertion in model container [2024-06-14 15:53:17,257 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:53:17" (2/2) ... [2024-06-14 15:53:17,257 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 15:53:17,355 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 15:53:17,356 INFO L97 edCorrectnessWitness]: Location invariant before [L834-L834] ((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 2) && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0) [2024-06-14 15:53:17,357 INFO L97 edCorrectnessWitness]: Location invariant before [L836-L836] ((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 2) && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0) [2024-06-14 15:53:17,358 INFO L97 edCorrectnessWitness]: Location invariant before [L837-L837] ((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 2) && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0) [2024-06-14 15:53:17,358 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 15:53:17,358 INFO L106 edCorrectnessWitness]: ghost_update [L832-L832] multithreaded = 1; [2024-06-14 15:53:17,408 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 15:53:17,855 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:53:17,868 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 15:53:18,298 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:53:18,342 INFO L206 MainTranslator]: Completed translation [2024-06-14 15:53:18,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:53:18 WrapperNode [2024-06-14 15:53:18,343 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 15:53:18,344 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 15:53:18,344 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 15:53:18,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 15:53:18,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:53:18" (1/1) ... [2024-06-14 15:53:18,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:53:18" (1/1) ... [2024-06-14 15:53:18,534 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 125 [2024-06-14 15:53:18,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 15:53:18,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 15:53:18,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 15:53:18,536 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 15:53:18,548 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:53:18" (1/1) ... [2024-06-14 15:53:18,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:53:18" (1/1) ... [2024-06-14 15:53:18,581 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:53:18" (1/1) ... [2024-06-14 15:53:18,638 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-14 15:53:18,639 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:53:18" (1/1) ... [2024-06-14 15:53:18,639 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:53:18" (1/1) ... [2024-06-14 15:53:18,697 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:53:18" (1/1) ... [2024-06-14 15:53:18,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:53:18" (1/1) ... [2024-06-14 15:53:18,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:53:18" (1/1) ... [2024-06-14 15:53:18,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:53:18" (1/1) ... [2024-06-14 15:53:18,771 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 15:53:18,772 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 15:53:18,773 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 15:53:18,773 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 15:53:18,774 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:53:18" (1/1) ... [2024-06-14 15:53:18,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:53:18,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 15:53:18,803 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-14 15:53:18,831 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-14 15:53:18,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 15:53:18,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 15:53:18,848 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 15:53:18,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 15:53:18,849 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 15:53:18,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 15:53:18,850 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-14 15:53:18,850 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-14 15:53:18,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 15:53:18,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 15:53:18,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 15:53:18,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 15:53:18,852 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 15:53:19,018 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 15:53:19,021 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 15:53:20,564 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 15:53:20,565 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 15:53:20,893 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 15:53:20,893 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 15:53:20,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:53:20 BoogieIcfgContainer [2024-06-14 15:53:20,894 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 15:53:20,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 15:53:20,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 15:53:20,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 15:53:20,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:53:15" (1/4) ... [2024-06-14 15:53:20,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@93c4369 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:53:20, skipping insertion in model container [2024-06-14 15:53:20,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:53:17" (2/4) ... [2024-06-14 15:53:20,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@93c4369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:53:20, skipping insertion in model container [2024-06-14 15:53:20,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:53:18" (3/4) ... [2024-06-14 15:53:20,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@93c4369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:53:20, skipping insertion in model container [2024-06-14 15:53:20,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:53:20" (4/4) ... [2024-06-14 15:53:20,906 INFO L112 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-14 15:53:20,923 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 15:53:20,923 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-14 15:53:20,924 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 15:53:21,077 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 15:53:21,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow [2024-06-14 15:53:21,187 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2024-06-14 15:53:21,188 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:53:21,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 15:53:21,191 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow [2024-06-14 15:53:21,195 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2024-06-14 15:53:21,209 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 15:53:21,219 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;@568d2512, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 15:53:21,219 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-14 15:53:21,232 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 15:53:21,232 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 15:53:21,232 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:53:21,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:21,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 15:53:21,234 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-14 15:53:21,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:21,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1642982905, now seen corresponding path program 1 times [2024-06-14 15:53:21,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:21,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543624442] [2024-06-14 15:53:21,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:21,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:28,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:53:28,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:28,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543624442] [2024-06-14 15:53:28,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543624442] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:28,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:28,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 15:53:28,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610221326] [2024-06-14 15:53:28,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:28,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 15:53:28,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:28,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 15:53:28,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 15:53:28,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2024-06-14 15:53:28,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:28,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:28,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2024-06-14 15:53:28,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:29,542 INFO L124 PetriNetUnfolderBase]: 942/1466 cut-off events. [2024-06-14 15:53:29,543 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-06-14 15:53:29,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2984 conditions, 1466 events. 942/1466 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7305 event pairs, 546 based on Foata normal form. 2/1428 useless extension candidates. Maximal degree in co-relation 2969. Up to 1428 conditions per place. [2024-06-14 15:53:29,557 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 33 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2024-06-14 15:53:29,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 44 transitions, 177 flow [2024-06-14 15:53:29,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 15:53:29,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 15:53:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-06-14 15:53:29,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.626984126984127 [2024-06-14 15:53:29,569 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 79 transitions. [2024-06-14 15:53:29,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 44 transitions, 177 flow [2024-06-14 15:53:29,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-14 15:53:29,574 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow [2024-06-14 15:53:29,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2024-06-14 15:53:29,578 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2024-06-14 15:53:29,579 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow [2024-06-14 15:53:29,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:29,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:29,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:29,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 15:53:29,580 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-14 15:53:29,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:29,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1641423846, now seen corresponding path program 1 times [2024-06-14 15:53:29,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:29,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015066028] [2024-06-14 15:53:29,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:29,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:53:34,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:34,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015066028] [2024-06-14 15:53:34,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015066028] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:34,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:34,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 15:53:34,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353858278] [2024-06-14 15:53:34,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:34,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 15:53:34,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:34,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 15:53:34,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 15:53:34,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 15:53:34,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:34,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:34,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 15:53:34,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:36,000 INFO L124 PetriNetUnfolderBase]: 1344/2037 cut-off events. [2024-06-14 15:53:36,000 INFO L125 PetriNetUnfolderBase]: For 326/326 co-relation queries the response was YES. [2024-06-14 15:53:36,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4687 conditions, 2037 events. 1344/2037 cut-off events. For 326/326 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9714 event pairs, 792 based on Foata normal form. 3/2039 useless extension candidates. Maximal degree in co-relation 4672. Up to 1993 conditions per place. [2024-06-14 15:53:36,015 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 44 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2024-06-14 15:53:36,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 260 flow [2024-06-14 15:53:36,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 15:53:36,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 15:53:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2024-06-14 15:53:36,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5654761904761905 [2024-06-14 15:53:36,020 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 95 transitions. [2024-06-14 15:53:36,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 260 flow [2024-06-14 15:53:36,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 15:53:36,024 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 154 flow [2024-06-14 15:53:36,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2024-06-14 15:53:36,025 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2024-06-14 15:53:36,025 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 154 flow [2024-06-14 15:53:36,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:36,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:36,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:36,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 15:53:36,029 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-14 15:53:36,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:36,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1155350981, now seen corresponding path program 1 times [2024-06-14 15:53:36,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:36,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234895341] [2024-06-14 15:53:36,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:36,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:43,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:53:43,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:43,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234895341] [2024-06-14 15:53:43,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234895341] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:43,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:43,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 15:53:43,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114947427] [2024-06-14 15:53:43,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:43,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 15:53:43,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:43,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 15:53:43,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-14 15:53:43,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 15:53:43,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 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-14 15:53:43,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:43,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 15:53:43,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:44,769 INFO L124 PetriNetUnfolderBase]: 1338/2028 cut-off events. [2024-06-14 15:53:44,769 INFO L125 PetriNetUnfolderBase]: For 1040/1040 co-relation queries the response was YES. [2024-06-14 15:53:44,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5208 conditions, 2028 events. 1338/2028 cut-off events. For 1040/1040 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9740 event pairs, 646 based on Foata normal form. 3/2030 useless extension candidates. Maximal degree in co-relation 5190. Up to 1969 conditions per place. [2024-06-14 15:53:44,783 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 51 selfloop transitions, 10 changer transitions 0/66 dead transitions. [2024-06-14 15:53:44,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 342 flow [2024-06-14 15:53:44,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:53:44,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:53:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2024-06-14 15:53:44,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2024-06-14 15:53:44,787 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 154 flow. Second operand 5 states and 116 transitions. [2024-06-14 15:53:44,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 342 flow [2024-06-14 15:53:44,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 340 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-14 15:53:44,790 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 200 flow [2024-06-14 15:53:44,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2024-06-14 15:53:44,790 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2024-06-14 15:53:44,791 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 200 flow [2024-06-14 15:53:44,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 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-14 15:53:44,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:44,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:44,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 15:53:44,792 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:53:44,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:44,792 INFO L85 PathProgramCache]: Analyzing trace with hash 929851592, now seen corresponding path program 1 times [2024-06-14 15:53:44,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:44,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860502372] [2024-06-14 15:53:44,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:44,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:54,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:53:54,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:54,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860502372] [2024-06-14 15:53:54,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860502372] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:54,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:54,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:53:54,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123203311] [2024-06-14 15:53:54,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:54,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:53:54,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:54,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:53:54,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:53:54,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-06-14 15:53:54,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:54,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:54,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-06-14 15:53:54,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:55,161 INFO L124 PetriNetUnfolderBase]: 1038/1643 cut-off events. [2024-06-14 15:53:55,161 INFO L125 PetriNetUnfolderBase]: For 1683/1683 co-relation queries the response was YES. [2024-06-14 15:53:55,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4615 conditions, 1643 events. 1038/1643 cut-off events. For 1683/1683 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8196 event pairs, 474 based on Foata normal form. 4/1593 useless extension candidates. Maximal degree in co-relation 4594. Up to 1525 conditions per place. [2024-06-14 15:53:55,173 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 43 selfloop transitions, 10 changer transitions 0/63 dead transitions. [2024-06-14 15:53:55,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 63 transitions, 360 flow [2024-06-14 15:53:55,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:53:55,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:53:55,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2024-06-14 15:53:55,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2024-06-14 15:53:55,177 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 200 flow. Second operand 5 states and 106 transitions. [2024-06-14 15:53:55,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 63 transitions, 360 flow [2024-06-14 15:53:55,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 63 transitions, 338 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-14 15:53:55,184 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 249 flow [2024-06-14 15:53:55,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2024-06-14 15:53:55,186 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2024-06-14 15:53:55,186 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 249 flow [2024-06-14 15:53:55,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:55,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:55,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:55,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 15:53:55,188 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-14 15:53:55,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:55,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2104202332, now seen corresponding path program 1 times [2024-06-14 15:53:55,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:55,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667127999] [2024-06-14 15:53:55,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:55,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:00,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:00,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:00,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667127999] [2024-06-14 15:54:00,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667127999] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:00,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:00,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:54:00,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843328899] [2024-06-14 15:54:00,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:00,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:54:00,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:00,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:54:00,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:54:01,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-14 15:54:01,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 249 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:01,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:01,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-14 15:54:01,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:02,290 INFO L124 PetriNetUnfolderBase]: 1323/2005 cut-off events. [2024-06-14 15:54:02,290 INFO L125 PetriNetUnfolderBase]: For 2854/2854 co-relation queries the response was YES. [2024-06-14 15:54:02,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6279 conditions, 2005 events. 1323/2005 cut-off events. For 2854/2854 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9500 event pairs, 467 based on Foata normal form. 6/2010 useless extension candidates. Maximal degree in co-relation 6255. Up to 1916 conditions per place. [2024-06-14 15:54:02,304 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 61 selfloop transitions, 12 changer transitions 0/78 dead transitions. [2024-06-14 15:54:02,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 78 transitions, 467 flow [2024-06-14 15:54:02,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:54:02,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:54:02,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2024-06-14 15:54:02,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-06-14 15:54:02,310 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 249 flow. Second operand 6 states and 133 transitions. [2024-06-14 15:54:02,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 78 transitions, 467 flow [2024-06-14 15:54:02,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 78 transitions, 454 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-14 15:54:02,320 INFO L231 Difference]: Finished difference. Result has 58 places, 52 transitions, 277 flow [2024-06-14 15:54:02,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=277, PETRI_PLACES=58, PETRI_TRANSITIONS=52} [2024-06-14 15:54:02,323 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places. [2024-06-14 15:54:02,323 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 277 flow [2024-06-14 15:54:02,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:02,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:02,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:02,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 15:54:02,326 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-14 15:54:02,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:02,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1239370335, now seen corresponding path program 1 times [2024-06-14 15:54:02,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:02,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366768935] [2024-06-14 15:54:02,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:02,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:10,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:10,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:10,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366768935] [2024-06-14 15:54:10,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366768935] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:10,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:10,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:54:10,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888960898] [2024-06-14 15:54:10,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:10,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:54:10,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:10,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:54:10,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:54:10,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:54:10,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 277 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:10,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:10,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:54:10,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:11,673 INFO L124 PetriNetUnfolderBase]: 1378/2096 cut-off events. [2024-06-14 15:54:11,673 INFO L125 PetriNetUnfolderBase]: For 4215/4215 co-relation queries the response was YES. [2024-06-14 15:54:11,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6889 conditions, 2096 events. 1378/2096 cut-off events. For 4215/4215 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10022 event pairs, 516 based on Foata normal form. 6/2100 useless extension candidates. Maximal degree in co-relation 6864. Up to 1942 conditions per place. [2024-06-14 15:54:11,689 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 60 selfloop transitions, 16 changer transitions 0/81 dead transitions. [2024-06-14 15:54:11,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 81 transitions, 545 flow [2024-06-14 15:54:11,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:54:11,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:54:11,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2024-06-14 15:54:11,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4801587301587302 [2024-06-14 15:54:11,691 INFO L175 Difference]: Start difference. First operand has 58 places, 52 transitions, 277 flow. Second operand 6 states and 121 transitions. [2024-06-14 15:54:11,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 81 transitions, 545 flow [2024-06-14 15:54:11,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 81 transitions, 514 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-14 15:54:11,696 INFO L231 Difference]: Finished difference. Result has 61 places, 61 transitions, 350 flow [2024-06-14 15:54:11,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=350, PETRI_PLACES=61, PETRI_TRANSITIONS=61} [2024-06-14 15:54:11,697 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2024-06-14 15:54:11,697 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 61 transitions, 350 flow [2024-06-14 15:54:11,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:11,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:11,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:11,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 15:54:11,698 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-14 15:54:11,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:11,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1568031445, now seen corresponding path program 1 times [2024-06-14 15:54:11,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:11,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532865041] [2024-06-14 15:54:11,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:11,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:18,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:18,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:18,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532865041] [2024-06-14 15:54:18,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532865041] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:18,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:18,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:54:18,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268992452] [2024-06-14 15:54:18,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:18,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:54:18,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:18,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:54:18,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:54:18,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:54:18,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 350 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:18,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:18,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:54:18,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:19,307 INFO L124 PetriNetUnfolderBase]: 1412/2158 cut-off events. [2024-06-14 15:54:19,308 INFO L125 PetriNetUnfolderBase]: For 6129/6129 co-relation queries the response was YES. [2024-06-14 15:54:19,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7931 conditions, 2158 events. 1412/2158 cut-off events. For 6129/6129 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10324 event pairs, 547 based on Foata normal form. 4/2161 useless extension candidates. Maximal degree in co-relation 7903. Up to 2069 conditions per place. [2024-06-14 15:54:19,327 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 70 selfloop transitions, 16 changer transitions 0/91 dead transitions. [2024-06-14 15:54:19,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 91 transitions, 636 flow [2024-06-14 15:54:19,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:54:19,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:54:19,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-14 15:54:19,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45918367346938777 [2024-06-14 15:54:19,329 INFO L175 Difference]: Start difference. First operand has 61 places, 61 transitions, 350 flow. Second operand 7 states and 135 transitions. [2024-06-14 15:54:19,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 91 transitions, 636 flow [2024-06-14 15:54:19,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 91 transitions, 607 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-06-14 15:54:19,336 INFO L231 Difference]: Finished difference. Result has 67 places, 69 transitions, 431 flow [2024-06-14 15:54:19,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=431, PETRI_PLACES=67, PETRI_TRANSITIONS=69} [2024-06-14 15:54:19,337 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2024-06-14 15:54:19,338 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 69 transitions, 431 flow [2024-06-14 15:54:19,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:19,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:19,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:19,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 15:54:19,339 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-14 15:54:19,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:19,339 INFO L85 PathProgramCache]: Analyzing trace with hash 233980617, now seen corresponding path program 2 times [2024-06-14 15:54:19,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:19,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248989286] [2024-06-14 15:54:19,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:19,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:27,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:27,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:27,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248989286] [2024-06-14 15:54:27,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248989286] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:27,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:27,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:54:27,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932674368] [2024-06-14 15:54:27,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:27,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:54:27,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:27,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:54:27,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:54:27,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:54:27,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 69 transitions, 431 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:27,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:27,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:54:27,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:28,373 INFO L124 PetriNetUnfolderBase]: 1434/2200 cut-off events. [2024-06-14 15:54:28,373 INFO L125 PetriNetUnfolderBase]: For 7663/7663 co-relation queries the response was YES. [2024-06-14 15:54:28,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8319 conditions, 2200 events. 1434/2200 cut-off events. For 7663/7663 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10616 event pairs, 538 based on Foata normal form. 4/2203 useless extension candidates. Maximal degree in co-relation 8288. Up to 2083 conditions per place. [2024-06-14 15:54:28,386 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 68 selfloop transitions, 17 changer transitions 0/90 dead transitions. [2024-06-14 15:54:28,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 90 transitions, 687 flow [2024-06-14 15:54:28,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:54:28,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:54:28,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2024-06-14 15:54:28,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-14 15:54:28,388 INFO L175 Difference]: Start difference. First operand has 67 places, 69 transitions, 431 flow. Second operand 6 states and 117 transitions. [2024-06-14 15:54:28,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 90 transitions, 687 flow [2024-06-14 15:54:28,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 646 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 15:54:28,395 INFO L231 Difference]: Finished difference. Result has 68 places, 72 transitions, 472 flow [2024-06-14 15:54:28,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=472, PETRI_PLACES=68, PETRI_TRANSITIONS=72} [2024-06-14 15:54:28,397 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2024-06-14 15:54:28,397 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 72 transitions, 472 flow [2024-06-14 15:54:28,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:28,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:28,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:28,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 15:54:28,398 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-14 15:54:28,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:28,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2120792895, now seen corresponding path program 3 times [2024-06-14 15:54:28,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:28,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888205571] [2024-06-14 15:54:28,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:28,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:36,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:36,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:36,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888205571] [2024-06-14 15:54:36,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888205571] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:36,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:36,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:54:36,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15853705] [2024-06-14 15:54:36,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:36,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:54:36,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:36,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:54:36,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:54:36,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:54:36,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 72 transitions, 472 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:36,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:36,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:54:36,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:37,154 INFO L124 PetriNetUnfolderBase]: 1408/2159 cut-off events. [2024-06-14 15:54:37,155 INFO L125 PetriNetUnfolderBase]: For 9080/9080 co-relation queries the response was YES. [2024-06-14 15:54:37,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8358 conditions, 2159 events. 1408/2159 cut-off events. For 9080/9080 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10411 event pairs, 542 based on Foata normal form. 8/2164 useless extension candidates. Maximal degree in co-relation 8327. Up to 1948 conditions per place. [2024-06-14 15:54:37,171 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 62 selfloop transitions, 24 changer transitions 0/91 dead transitions. [2024-06-14 15:54:37,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 91 transitions, 715 flow [2024-06-14 15:54:37,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:54:37,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:54:37,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2024-06-14 15:54:37,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-14 15:54:37,173 INFO L175 Difference]: Start difference. First operand has 68 places, 72 transitions, 472 flow. Second operand 6 states and 119 transitions. [2024-06-14 15:54:37,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 91 transitions, 715 flow [2024-06-14 15:54:37,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 91 transitions, 659 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-14 15:54:37,184 INFO L231 Difference]: Finished difference. Result has 71 places, 74 transitions, 507 flow [2024-06-14 15:54:37,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=507, PETRI_PLACES=71, PETRI_TRANSITIONS=74} [2024-06-14 15:54:37,185 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2024-06-14 15:54:37,185 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 507 flow [2024-06-14 15:54:37,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:37,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:37,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:37,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 15:54:37,186 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-14 15:54:37,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:37,186 INFO L85 PathProgramCache]: Analyzing trace with hash 234226695, now seen corresponding path program 1 times [2024-06-14 15:54:37,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:37,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094257814] [2024-06-14 15:54:37,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:37,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:46,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:46,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094257814] [2024-06-14 15:54:46,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094257814] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:46,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:46,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:54:46,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017000750] [2024-06-14 15:54:46,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:46,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:54:46,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:46,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:54:46,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:54:46,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:54:46,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 507 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:46,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:46,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:54:46,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:47,424 INFO L124 PetriNetUnfolderBase]: 1414/2168 cut-off events. [2024-06-14 15:54:47,424 INFO L125 PetriNetUnfolderBase]: For 8899/8899 co-relation queries the response was YES. [2024-06-14 15:54:47,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8442 conditions, 2168 events. 1414/2168 cut-off events. For 8899/8899 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10459 event pairs, 501 based on Foata normal form. 4/2169 useless extension candidates. Maximal degree in co-relation 8409. Up to 1999 conditions per place. [2024-06-14 15:54:47,437 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 75 selfloop transitions, 28 changer transitions 0/108 dead transitions. [2024-06-14 15:54:47,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 108 transitions, 893 flow [2024-06-14 15:54:47,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:54:47,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:54:47,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-14 15:54:47,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45918367346938777 [2024-06-14 15:54:47,439 INFO L175 Difference]: Start difference. First operand has 71 places, 74 transitions, 507 flow. Second operand 7 states and 135 transitions. [2024-06-14 15:54:47,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 108 transitions, 893 flow [2024-06-14 15:54:47,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 108 transitions, 845 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-14 15:54:47,449 INFO L231 Difference]: Finished difference. Result has 77 places, 89 transitions, 694 flow [2024-06-14 15:54:47,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=694, PETRI_PLACES=77, PETRI_TRANSITIONS=89} [2024-06-14 15:54:47,450 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2024-06-14 15:54:47,451 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 89 transitions, 694 flow [2024-06-14 15:54:47,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:47,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:47,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:47,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 15:54:47,451 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:54:47,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:47,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1328905600, now seen corresponding path program 1 times [2024-06-14 15:54:47,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:47,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107010814] [2024-06-14 15:54:47,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:47,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:57,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:57,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:57,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107010814] [2024-06-14 15:54:57,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107010814] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:57,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:57,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:54:57,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759008300] [2024-06-14 15:54:57,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:57,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:54:57,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:57,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:54:57,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:54:57,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:54:57,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 89 transitions, 694 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-14 15:54:57,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:57,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:54:57,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:58,472 INFO L124 PetriNetUnfolderBase]: 1509/2339 cut-off events. [2024-06-14 15:54:58,472 INFO L125 PetriNetUnfolderBase]: For 11895/11895 co-relation queries the response was YES. [2024-06-14 15:54:58,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9622 conditions, 2339 events. 1509/2339 cut-off events. For 11895/11895 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11624 event pairs, 473 based on Foata normal form. 30/2366 useless extension candidates. Maximal degree in co-relation 9586. Up to 1930 conditions per place. [2024-06-14 15:54:58,485 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 73 selfloop transitions, 45 changer transitions 0/123 dead transitions. [2024-06-14 15:54:58,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 123 transitions, 1064 flow [2024-06-14 15:54:58,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:54:58,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:54:58,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions. [2024-06-14 15:54:58,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2024-06-14 15:54:58,488 INFO L175 Difference]: Start difference. First operand has 77 places, 89 transitions, 694 flow. Second operand 8 states and 162 transitions. [2024-06-14 15:54:58,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 123 transitions, 1064 flow [2024-06-14 15:54:58,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 123 transitions, 1012 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-14 15:54:58,503 INFO L231 Difference]: Finished difference. Result has 83 places, 95 transitions, 812 flow [2024-06-14 15:54:58,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=812, PETRI_PLACES=83, PETRI_TRANSITIONS=95} [2024-06-14 15:54:58,503 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 40 predicate places. [2024-06-14 15:54:58,504 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 95 transitions, 812 flow [2024-06-14 15:54:58,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-14 15:54:58,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:58,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:58,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 15:54:58,504 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-14 15:54:58,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:58,505 INFO L85 PathProgramCache]: Analyzing trace with hash 528174350, now seen corresponding path program 1 times [2024-06-14 15:54:58,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:58,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384109044] [2024-06-14 15:54:58,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:58,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:55:07,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:07,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384109044] [2024-06-14 15:55:07,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384109044] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:07,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:07,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:55:07,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079324507] [2024-06-14 15:55:07,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:07,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:55:07,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:07,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:55:07,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:55:07,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:55:07,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 95 transitions, 812 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:55:07,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:07,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:55:07,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:08,805 INFO L124 PetriNetUnfolderBase]: 1504/2320 cut-off events. [2024-06-14 15:55:08,806 INFO L125 PetriNetUnfolderBase]: For 15463/15463 co-relation queries the response was YES. [2024-06-14 15:55:08,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10652 conditions, 2320 events. 1504/2320 cut-off events. For 15463/15463 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11445 event pairs, 489 based on Foata normal form. 2/2321 useless extension candidates. Maximal degree in co-relation 10613. Up to 2209 conditions per place. [2024-06-14 15:55:08,820 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 100 selfloop transitions, 17 changer transitions 0/122 dead transitions. [2024-06-14 15:55:08,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 122 transitions, 1146 flow [2024-06-14 15:55:08,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:55:08,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:55:08,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-14 15:55:08,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46258503401360546 [2024-06-14 15:55:08,823 INFO L175 Difference]: Start difference. First operand has 83 places, 95 transitions, 812 flow. Second operand 7 states and 136 transitions. [2024-06-14 15:55:08,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 122 transitions, 1146 flow [2024-06-14 15:55:08,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 122 transitions, 1077 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-14 15:55:08,844 INFO L231 Difference]: Finished difference. Result has 86 places, 98 transitions, 817 flow [2024-06-14 15:55:08,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=817, PETRI_PLACES=86, PETRI_TRANSITIONS=98} [2024-06-14 15:55:08,845 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places. [2024-06-14 15:55:08,845 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 98 transitions, 817 flow [2024-06-14 15:55:08,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:55:08,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:08,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:08,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 15:55:08,846 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-14 15:55:08,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:08,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1753293256, now seen corresponding path program 1 times [2024-06-14 15:55:08,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:08,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995288708] [2024-06-14 15:55:08,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:08,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:18,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:55:18,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:18,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995288708] [2024-06-14 15:55:18,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995288708] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:18,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:18,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:55:18,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216637374] [2024-06-14 15:55:18,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:18,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:55:18,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:18,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:55:18,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:55:18,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:55:18,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 98 transitions, 817 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 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-14 15:55:18,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:18,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:55:18,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:19,389 INFO L124 PetriNetUnfolderBase]: 1526/2354 cut-off events. [2024-06-14 15:55:19,389 INFO L125 PetriNetUnfolderBase]: For 17874/17874 co-relation queries the response was YES. [2024-06-14 15:55:19,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11179 conditions, 2354 events. 1526/2354 cut-off events. For 17874/17874 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11616 event pairs, 492 based on Foata normal form. 4/2355 useless extension candidates. Maximal degree in co-relation 11138. Up to 2120 conditions per place. [2024-06-14 15:55:19,404 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 82 selfloop transitions, 35 changer transitions 0/122 dead transitions. [2024-06-14 15:55:19,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 122 transitions, 1152 flow [2024-06-14 15:55:19,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:55:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:55:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-06-14 15:55:19,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46598639455782315 [2024-06-14 15:55:19,408 INFO L175 Difference]: Start difference. First operand has 86 places, 98 transitions, 817 flow. Second operand 7 states and 137 transitions. [2024-06-14 15:55:19,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 122 transitions, 1152 flow [2024-06-14 15:55:19,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 122 transitions, 1102 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-14 15:55:19,428 INFO L231 Difference]: Finished difference. Result has 88 places, 102 transitions, 893 flow [2024-06-14 15:55:19,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=893, PETRI_PLACES=88, PETRI_TRANSITIONS=102} [2024-06-14 15:55:19,429 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 45 predicate places. [2024-06-14 15:55:19,429 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 102 transitions, 893 flow [2024-06-14 15:55:19,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 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-14 15:55:19,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:19,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:19,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 15:55:19,429 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-14 15:55:19,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:19,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1538598508, now seen corresponding path program 2 times [2024-06-14 15:55:19,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:19,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726891199] [2024-06-14 15:55:19,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:19,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:27,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:55:27,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:27,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726891199] [2024-06-14 15:55:27,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726891199] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:27,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:27,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:55:27,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010059124] [2024-06-14 15:55:27,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:27,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:55:27,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:27,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:55:27,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:55:27,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:55:27,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 102 transitions, 893 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 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-14 15:55:27,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:27,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:55:27,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:28,820 INFO L124 PetriNetUnfolderBase]: 1521/2347 cut-off events. [2024-06-14 15:55:28,821 INFO L125 PetriNetUnfolderBase]: For 20957/20957 co-relation queries the response was YES. [2024-06-14 15:55:28,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11778 conditions, 2347 events. 1521/2347 cut-off events. For 20957/20957 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11564 event pairs, 492 based on Foata normal form. 2/2346 useless extension candidates. Maximal degree in co-relation 11736. Up to 2155 conditions per place. [2024-06-14 15:55:28,833 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 92 selfloop transitions, 29 changer transitions 0/126 dead transitions. [2024-06-14 15:55:28,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 126 transitions, 1253 flow [2024-06-14 15:55:28,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:55:28,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:55:28,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-14 15:55:28,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4557823129251701 [2024-06-14 15:55:28,836 INFO L175 Difference]: Start difference. First operand has 88 places, 102 transitions, 893 flow. Second operand 7 states and 134 transitions. [2024-06-14 15:55:28,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 126 transitions, 1253 flow [2024-06-14 15:55:28,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 126 transitions, 1141 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-14 15:55:28,860 INFO L231 Difference]: Finished difference. Result has 91 places, 107 transitions, 926 flow [2024-06-14 15:55:28,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=926, PETRI_PLACES=91, PETRI_TRANSITIONS=107} [2024-06-14 15:55:28,861 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 48 predicate places. [2024-06-14 15:55:28,861 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 107 transitions, 926 flow [2024-06-14 15:55:28,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 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-14 15:55:28,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:28,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:28,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 15:55:28,862 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-14 15:55:28,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:28,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1845663359, now seen corresponding path program 1 times [2024-06-14 15:55:28,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:28,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420345768] [2024-06-14 15:55:28,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:28,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:55:37,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:37,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420345768] [2024-06-14 15:55:37,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420345768] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:37,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:37,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:55:37,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022817088] [2024-06-14 15:55:37,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:37,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:55:37,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:37,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:55:37,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:55:38,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:55:38,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 107 transitions, 926 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 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-14 15:55:38,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:38,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:55:38,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:38,944 INFO L124 PetriNetUnfolderBase]: 1516/2340 cut-off events. [2024-06-14 15:55:38,945 INFO L125 PetriNetUnfolderBase]: For 23963/23963 co-relation queries the response was YES. [2024-06-14 15:55:38,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12123 conditions, 2340 events. 1516/2340 cut-off events. For 23963/23963 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11609 event pairs, 476 based on Foata normal form. 2/2338 useless extension candidates. Maximal degree in co-relation 12079. Up to 2085 conditions per place. [2024-06-14 15:55:38,957 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 78 selfloop transitions, 42 changer transitions 0/125 dead transitions. [2024-06-14 15:55:38,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 125 transitions, 1246 flow [2024-06-14 15:55:38,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:55:38,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:55:38,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2024-06-14 15:55:38,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-14 15:55:38,960 INFO L175 Difference]: Start difference. First operand has 91 places, 107 transitions, 926 flow. Second operand 6 states and 120 transitions. [2024-06-14 15:55:38,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 125 transitions, 1246 flow [2024-06-14 15:55:38,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 125 transitions, 1173 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-14 15:55:38,987 INFO L231 Difference]: Finished difference. Result has 93 places, 110 transitions, 998 flow [2024-06-14 15:55:38,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=998, PETRI_PLACES=93, PETRI_TRANSITIONS=110} [2024-06-14 15:55:38,988 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places. [2024-06-14 15:55:38,988 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 110 transitions, 998 flow [2024-06-14 15:55:38,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 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-14 15:55:38,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:38,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:38,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 15:55:38,989 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:55:38,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:38,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1665671603, now seen corresponding path program 1 times [2024-06-14 15:55:38,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:38,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559151338] [2024-06-14 15:55:38,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:38,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:51,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:55:51,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:51,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559151338] [2024-06-14 15:55:51,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559151338] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:51,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:51,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:55:51,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521467459] [2024-06-14 15:55:51,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:51,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:55:51,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:51,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:55:51,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:55:51,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:55:51,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 110 transitions, 998 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-14 15:55:51,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:51,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:55:51,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:52,507 INFO L124 PetriNetUnfolderBase]: 1526/2371 cut-off events. [2024-06-14 15:55:52,508 INFO L125 PetriNetUnfolderBase]: For 26534/26534 co-relation queries the response was YES. [2024-06-14 15:55:52,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12698 conditions, 2371 events. 1526/2371 cut-off events. For 26534/26534 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11888 event pairs, 469 based on Foata normal form. 2/2372 useless extension candidates. Maximal degree in co-relation 12653. Up to 2228 conditions per place. [2024-06-14 15:55:52,523 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 112 selfloop transitions, 20 changer transitions 0/137 dead transitions. [2024-06-14 15:55:52,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 137 transitions, 1436 flow [2024-06-14 15:55:52,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:55:52,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:55:52,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2024-06-14 15:55:52,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-14 15:55:52,524 INFO L175 Difference]: Start difference. First operand has 93 places, 110 transitions, 998 flow. Second operand 6 states and 117 transitions. [2024-06-14 15:55:52,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 137 transitions, 1436 flow [2024-06-14 15:55:52,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 137 transitions, 1349 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-14 15:55:52,553 INFO L231 Difference]: Finished difference. Result has 96 places, 119 transitions, 1047 flow [2024-06-14 15:55:52,554 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1047, PETRI_PLACES=96, PETRI_TRANSITIONS=119} [2024-06-14 15:55:52,555 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 53 predicate places. [2024-06-14 15:55:52,557 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 119 transitions, 1047 flow [2024-06-14 15:55:52,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-14 15:55:52,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:52,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:52,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 15:55:52,559 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-14 15:55:52,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:52,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1472959265, now seen corresponding path program 1 times [2024-06-14 15:55:52,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:52,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039390240] [2024-06-14 15:55:52,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:52,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:01,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:56:01,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:01,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039390240] [2024-06-14 15:56:01,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039390240] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:01,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:01,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:56:01,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708610057] [2024-06-14 15:56:01,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:01,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:56:01,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:01,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:56:01,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:56:01,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:56:01,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 119 transitions, 1047 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:01,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:01,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:56:01,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:02,773 INFO L124 PetriNetUnfolderBase]: 1543/2395 cut-off events. [2024-06-14 15:56:02,774 INFO L125 PetriNetUnfolderBase]: For 30418/30418 co-relation queries the response was YES. [2024-06-14 15:56:02,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13201 conditions, 2395 events. 1543/2395 cut-off events. For 30418/30418 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 12020 event pairs, 438 based on Foata normal form. 4/2396 useless extension candidates. Maximal degree in co-relation 13154. Up to 2101 conditions per place. [2024-06-14 15:56:02,786 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 111 selfloop transitions, 35 changer transitions 0/151 dead transitions. [2024-06-14 15:56:02,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 151 transitions, 1554 flow [2024-06-14 15:56:02,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:56:02,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:56:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-14 15:56:02,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-14 15:56:02,789 INFO L175 Difference]: Start difference. First operand has 96 places, 119 transitions, 1047 flow. Second operand 8 states and 154 transitions. [2024-06-14 15:56:02,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 151 transitions, 1554 flow [2024-06-14 15:56:02,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 151 transitions, 1536 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-06-14 15:56:02,808 INFO L231 Difference]: Finished difference. Result has 104 places, 124 transitions, 1195 flow [2024-06-14 15:56:02,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1195, PETRI_PLACES=104, PETRI_TRANSITIONS=124} [2024-06-14 15:56:02,809 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 61 predicate places. [2024-06-14 15:56:02,809 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 124 transitions, 1195 flow [2024-06-14 15:56:02,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:02,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:02,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:02,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 15:56:02,809 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-14 15:56:02,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:02,810 INFO L85 PathProgramCache]: Analyzing trace with hash -451912045, now seen corresponding path program 2 times [2024-06-14 15:56:02,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:02,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082746045] [2024-06-14 15:56:02,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:02,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:11,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:56:11,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:11,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082746045] [2024-06-14 15:56:11,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082746045] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:11,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:11,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:56:11,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126751934] [2024-06-14 15:56:11,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:11,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:56:11,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:11,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:56:11,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:56:12,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:56:12,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 124 transitions, 1195 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:12,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:12,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:56:12,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:13,171 INFO L124 PetriNetUnfolderBase]: 1560/2422 cut-off events. [2024-06-14 15:56:13,171 INFO L125 PetriNetUnfolderBase]: For 34803/34803 co-relation queries the response was YES. [2024-06-14 15:56:13,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13939 conditions, 2422 events. 1560/2422 cut-off events. For 34803/34803 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 12109 event pairs, 473 based on Foata normal form. 4/2423 useless extension candidates. Maximal degree in co-relation 13888. Up to 2198 conditions per place. [2024-06-14 15:56:13,184 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 114 selfloop transitions, 31 changer transitions 0/150 dead transitions. [2024-06-14 15:56:13,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 150 transitions, 1595 flow [2024-06-14 15:56:13,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:56:13,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:56:13,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-14 15:56:13,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2024-06-14 15:56:13,188 INFO L175 Difference]: Start difference. First operand has 104 places, 124 transitions, 1195 flow. Second operand 8 states and 151 transitions. [2024-06-14 15:56:13,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 150 transitions, 1595 flow [2024-06-14 15:56:13,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 150 transitions, 1503 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-14 15:56:13,213 INFO L231 Difference]: Finished difference. Result has 107 places, 126 transitions, 1214 flow [2024-06-14 15:56:13,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1214, PETRI_PLACES=107, PETRI_TRANSITIONS=126} [2024-06-14 15:56:13,213 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 64 predicate places. [2024-06-14 15:56:13,213 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 126 transitions, 1214 flow [2024-06-14 15:56:13,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:13,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:13,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:13,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 15:56:13,214 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-14 15:56:13,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:13,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1482482465, now seen corresponding path program 3 times [2024-06-14 15:56:13,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:13,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662075802] [2024-06-14 15:56:13,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:13,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:23,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:56:23,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:23,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662075802] [2024-06-14 15:56:23,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662075802] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:23,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:23,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:56:23,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536420399] [2024-06-14 15:56:23,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:23,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:56:23,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:23,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:56:23,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:56:23,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:56:23,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 126 transitions, 1214 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:23,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:23,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:56:23,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:24,566 INFO L124 PetriNetUnfolderBase]: 1644/2557 cut-off events. [2024-06-14 15:56:24,566 INFO L125 PetriNetUnfolderBase]: For 41229/41229 co-relation queries the response was YES. [2024-06-14 15:56:24,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14553 conditions, 2557 events. 1644/2557 cut-off events. For 41229/41229 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 13011 event pairs, 493 based on Foata normal form. 28/2581 useless extension candidates. Maximal degree in co-relation 14501. Up to 2119 conditions per place. [2024-06-14 15:56:24,581 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 105 selfloop transitions, 47 changer transitions 0/157 dead transitions. [2024-06-14 15:56:24,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 157 transitions, 1661 flow [2024-06-14 15:56:24,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:56:24,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:56:24,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2024-06-14 15:56:24,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-14 15:56:24,584 INFO L175 Difference]: Start difference. First operand has 107 places, 126 transitions, 1214 flow. Second operand 8 states and 160 transitions. [2024-06-14 15:56:24,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 157 transitions, 1661 flow [2024-06-14 15:56:24,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 157 transitions, 1550 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-14 15:56:24,616 INFO L231 Difference]: Finished difference. Result has 109 places, 128 transitions, 1245 flow [2024-06-14 15:56:24,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1245, PETRI_PLACES=109, PETRI_TRANSITIONS=128} [2024-06-14 15:56:24,617 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 66 predicate places. [2024-06-14 15:56:24,617 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 128 transitions, 1245 flow [2024-06-14 15:56:24,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:24,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:24,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:24,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 15:56:24,617 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:56:24,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:24,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1948024273, now seen corresponding path program 2 times [2024-06-14 15:56:24,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:24,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402387204] [2024-06-14 15:56:24,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:24,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:37,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:56:37,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:37,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402387204] [2024-06-14 15:56:37,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402387204] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:37,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:37,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:56:37,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702160048] [2024-06-14 15:56:37,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:37,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:56:37,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:37,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:56:37,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:56:37,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:56:37,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 128 transitions, 1245 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-14 15:56:37,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:37,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:56:37,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:38,967 INFO L124 PetriNetUnfolderBase]: 1658/2588 cut-off events. [2024-06-14 15:56:38,967 INFO L125 PetriNetUnfolderBase]: For 40855/40855 co-relation queries the response was YES. [2024-06-14 15:56:38,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14903 conditions, 2588 events. 1658/2588 cut-off events. For 40855/40855 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13244 event pairs, 483 based on Foata normal form. 6/2593 useless extension candidates. Maximal degree in co-relation 14850. Up to 2433 conditions per place. [2024-06-14 15:56:38,982 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 118 selfloop transitions, 24 changer transitions 0/147 dead transitions. [2024-06-14 15:56:38,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 147 transitions, 1623 flow [2024-06-14 15:56:38,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:56:38,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:56:38,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2024-06-14 15:56:38,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-14 15:56:38,983 INFO L175 Difference]: Start difference. First operand has 109 places, 128 transitions, 1245 flow. Second operand 5 states and 105 transitions. [2024-06-14 15:56:38,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 147 transitions, 1623 flow [2024-06-14 15:56:39,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 147 transitions, 1511 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-14 15:56:39,015 INFO L231 Difference]: Finished difference. Result has 108 places, 131 transitions, 1240 flow [2024-06-14 15:56:39,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1240, PETRI_PLACES=108, PETRI_TRANSITIONS=131} [2024-06-14 15:56:39,016 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 65 predicate places. [2024-06-14 15:56:39,016 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 131 transitions, 1240 flow [2024-06-14 15:56:39,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-14 15:56:39,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:39,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:39,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 15:56:39,017 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-14 15:56:39,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:39,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1508952915, now seen corresponding path program 1 times [2024-06-14 15:56:39,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:39,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595177012] [2024-06-14 15:56:39,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:39,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:47,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:56:47,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:47,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595177012] [2024-06-14 15:56:47,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595177012] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:47,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:47,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:56:47,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349974392] [2024-06-14 15:56:47,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:47,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:56:47,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:47,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:56:47,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:56:48,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:56:48,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 131 transitions, 1240 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-14 15:56:48,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:48,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:56:48,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:49,213 INFO L124 PetriNetUnfolderBase]: 1675/2611 cut-off events. [2024-06-14 15:56:49,213 INFO L125 PetriNetUnfolderBase]: For 43856/43856 co-relation queries the response was YES. [2024-06-14 15:56:49,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15306 conditions, 2611 events. 1675/2611 cut-off events. For 43856/43856 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13370 event pairs, 323 based on Foata normal form. 4/2614 useless extension candidates. Maximal degree in co-relation 15252. Up to 2438 conditions per place. [2024-06-14 15:56:49,227 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 140 selfloop transitions, 18 changer transitions 0/163 dead transitions. [2024-06-14 15:56:49,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 163 transitions, 1680 flow [2024-06-14 15:56:49,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:56:49,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:56:49,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-14 15:56:49,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45535714285714285 [2024-06-14 15:56:49,229 INFO L175 Difference]: Start difference. First operand has 108 places, 131 transitions, 1240 flow. Second operand 8 states and 153 transitions. [2024-06-14 15:56:49,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 163 transitions, 1680 flow [2024-06-14 15:56:49,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 163 transitions, 1635 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-14 15:56:49,269 INFO L231 Difference]: Finished difference. Result has 113 places, 133 transitions, 1276 flow [2024-06-14 15:56:49,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1276, PETRI_PLACES=113, PETRI_TRANSITIONS=133} [2024-06-14 15:56:49,270 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 70 predicate places. [2024-06-14 15:56:49,270 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 133 transitions, 1276 flow [2024-06-14 15:56:49,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-14 15:56:49,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:49,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:49,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 15:56:49,271 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-14 15:56:49,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:49,271 INFO L85 PathProgramCache]: Analyzing trace with hash -283702099, now seen corresponding path program 2 times [2024-06-14 15:56:49,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:49,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433452228] [2024-06-14 15:56:49,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:49,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:56:57,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:57,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433452228] [2024-06-14 15:56:57,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433452228] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:57,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:57,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:56:57,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051469114] [2024-06-14 15:56:57,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:57,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:56:57,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:57,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:56:57,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:56:58,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:56:58,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 133 transitions, 1276 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-14 15:56:58,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:58,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:56:58,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:59,242 INFO L124 PetriNetUnfolderBase]: 1692/2638 cut-off events. [2024-06-14 15:56:59,243 INFO L125 PetriNetUnfolderBase]: For 47854/47854 co-relation queries the response was YES. [2024-06-14 15:56:59,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15752 conditions, 2638 events. 1692/2638 cut-off events. For 47854/47854 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13526 event pairs, 446 based on Foata normal form. 4/2641 useless extension candidates. Maximal degree in co-relation 15697. Up to 2491 conditions per place. [2024-06-14 15:56:59,259 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 140 selfloop transitions, 19 changer transitions 0/164 dead transitions. [2024-06-14 15:56:59,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 164 transitions, 1720 flow [2024-06-14 15:56:59,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:56:59,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:56:59,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-14 15:56:59,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45535714285714285 [2024-06-14 15:56:59,262 INFO L175 Difference]: Start difference. First operand has 113 places, 133 transitions, 1276 flow. Second operand 8 states and 153 transitions. [2024-06-14 15:56:59,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 164 transitions, 1720 flow [2024-06-14 15:56:59,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 164 transitions, 1657 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-14 15:56:59,299 INFO L231 Difference]: Finished difference. Result has 115 places, 135 transitions, 1300 flow [2024-06-14 15:56:59,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1213, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1300, PETRI_PLACES=115, PETRI_TRANSITIONS=135} [2024-06-14 15:56:59,300 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 72 predicate places. [2024-06-14 15:56:59,300 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 135 transitions, 1300 flow [2024-06-14 15:56:59,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-14 15:56:59,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:59,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:59,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 15:56:59,301 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-14 15:56:59,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:59,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1779053449, now seen corresponding path program 1 times [2024-06-14 15:56:59,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:59,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938963104] [2024-06-14 15:56:59,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:59,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:57:08,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:57:08,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:57:08,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938963104] [2024-06-14 15:57:08,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938963104] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:57:08,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:57:08,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:57:08,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950232903] [2024-06-14 15:57:08,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:57:08,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:57:08,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:57:08,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:57:08,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:57:09,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:57:09,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 135 transitions, 1300 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:09,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:57:09,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:57:09,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:10,099 INFO L124 PetriNetUnfolderBase]: 1703/2651 cut-off events. [2024-06-14 15:57:10,099 INFO L125 PetriNetUnfolderBase]: For 52166/52166 co-relation queries the response was YES. [2024-06-14 15:57:10,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16100 conditions, 2651 events. 1703/2651 cut-off events. For 52166/52166 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 13581 event pairs, 440 based on Foata normal form. 2/2649 useless extension candidates. Maximal degree in co-relation 16044. Up to 2416 conditions per place. [2024-06-14 15:57:10,115 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 114 selfloop transitions, 38 changer transitions 0/157 dead transitions. [2024-06-14 15:57:10,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 157 transitions, 1718 flow [2024-06-14 15:57:10,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:57:10,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:57:10,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2024-06-14 15:57:10,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47278911564625853 [2024-06-14 15:57:10,118 INFO L175 Difference]: Start difference. First operand has 115 places, 135 transitions, 1300 flow. Second operand 7 states and 139 transitions. [2024-06-14 15:57:10,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 157 transitions, 1718 flow [2024-06-14 15:57:10,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 157 transitions, 1649 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-14 15:57:10,154 INFO L231 Difference]: Finished difference. Result has 116 places, 138 transitions, 1382 flow [2024-06-14 15:57:10,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1382, PETRI_PLACES=116, PETRI_TRANSITIONS=138} [2024-06-14 15:57:10,154 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 73 predicate places. [2024-06-14 15:57:10,155 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 138 transitions, 1382 flow [2024-06-14 15:57:10,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:10,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:10,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:57:10,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 15:57:10,155 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:57:10,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:10,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1551688167, now seen corresponding path program 3 times [2024-06-14 15:57:10,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:10,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226339651] [2024-06-14 15:57:10,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:10,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:57:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:57:18,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:57:18,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226339651] [2024-06-14 15:57:18,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226339651] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:57:18,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:57:18,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:57:18,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319053645] [2024-06-14 15:57:18,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:57:18,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:57:18,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:57:18,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:57:18,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:57:18,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:57:18,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 138 transitions, 1382 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-14 15:57:18,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:57:18,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:57:18,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:19,953 INFO L124 PetriNetUnfolderBase]: 1695/2652 cut-off events. [2024-06-14 15:57:19,954 INFO L125 PetriNetUnfolderBase]: For 55934/55934 co-relation queries the response was YES. [2024-06-14 15:57:19,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16436 conditions, 2652 events. 1695/2652 cut-off events. For 55934/55934 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 13648 event pairs, 426 based on Foata normal form. 4/2655 useless extension candidates. Maximal degree in co-relation 16379. Up to 2484 conditions per place. [2024-06-14 15:57:19,969 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 138 selfloop transitions, 24 changer transitions 0/167 dead transitions. [2024-06-14 15:57:19,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 167 transitions, 1835 flow [2024-06-14 15:57:19,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:57:19,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:57:19,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-14 15:57:19,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-14 15:57:19,972 INFO L175 Difference]: Start difference. First operand has 116 places, 138 transitions, 1382 flow. Second operand 8 states and 150 transitions. [2024-06-14 15:57:19,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 167 transitions, 1835 flow [2024-06-14 15:57:20,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 167 transitions, 1723 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-14 15:57:20,019 INFO L231 Difference]: Finished difference. Result has 120 places, 141 transitions, 1390 flow [2024-06-14 15:57:20,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1390, PETRI_PLACES=120, PETRI_TRANSITIONS=141} [2024-06-14 15:57:20,019 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 77 predicate places. [2024-06-14 15:57:20,019 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 141 transitions, 1390 flow [2024-06-14 15:57:20,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-14 15:57:20,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:20,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:57:20,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 15:57:20,020 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-14 15:57:20,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:20,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1799411379, now seen corresponding path program 2 times [2024-06-14 15:57:20,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:20,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554987896] [2024-06-14 15:57:20,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:20,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:57:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:57:29,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:57:29,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554987896] [2024-06-14 15:57:29,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554987896] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:57:29,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:57:29,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:57:29,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565277260] [2024-06-14 15:57:29,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:57:29,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:57:29,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:57:29,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:57:29,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:57:29,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:57:29,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 141 transitions, 1390 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:29,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:57:29,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:57:29,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:30,606 INFO L124 PetriNetUnfolderBase]: 1706/2665 cut-off events. [2024-06-14 15:57:30,606 INFO L125 PetriNetUnfolderBase]: For 60571/60571 co-relation queries the response was YES. [2024-06-14 15:57:30,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16750 conditions, 2665 events. 1706/2665 cut-off events. For 60571/60571 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13767 event pairs, 438 based on Foata normal form. 2/2663 useless extension candidates. Maximal degree in co-relation 16691. Up to 2342 conditions per place. [2024-06-14 15:57:30,623 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 107 selfloop transitions, 55 changer transitions 0/167 dead transitions. [2024-06-14 15:57:30,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 167 transitions, 1848 flow [2024-06-14 15:57:30,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:57:30,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:57:30,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-14 15:57:30,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-14 15:57:30,627 INFO L175 Difference]: Start difference. First operand has 120 places, 141 transitions, 1390 flow. Second operand 8 states and 156 transitions. [2024-06-14 15:57:30,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 167 transitions, 1848 flow [2024-06-14 15:57:30,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 167 transitions, 1758 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-14 15:57:30,674 INFO L231 Difference]: Finished difference. Result has 123 places, 144 transitions, 1488 flow [2024-06-14 15:57:30,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1488, PETRI_PLACES=123, PETRI_TRANSITIONS=144} [2024-06-14 15:57:30,675 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 80 predicate places. [2024-06-14 15:57:30,675 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 144 transitions, 1488 flow [2024-06-14 15:57:30,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:30,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:30,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:57:30,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 15:57:30,675 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:57:30,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:30,676 INFO L85 PathProgramCache]: Analyzing trace with hash -82804680, now seen corresponding path program 1 times [2024-06-14 15:57:30,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:30,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766518187] [2024-06-14 15:57:30,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:30,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:57:44,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:57:44,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:57:44,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766518187] [2024-06-14 15:57:44,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766518187] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:57:44,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:57:44,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:57:44,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317501210] [2024-06-14 15:57:44,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:57:44,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:57:44,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:57:44,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:57:44,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:57:44,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:57:44,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 144 transitions, 1488 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-14 15:57:44,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:57:44,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:57:44,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:46,097 INFO L124 PetriNetUnfolderBase]: 1726/2696 cut-off events. [2024-06-14 15:57:46,097 INFO L125 PetriNetUnfolderBase]: For 66372/66372 co-relation queries the response was YES. [2024-06-14 15:57:46,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17407 conditions, 2696 events. 1726/2696 cut-off events. For 66372/66372 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 13896 event pairs, 433 based on Foata normal form. 4/2699 useless extension candidates. Maximal degree in co-relation 17347. Up to 2485 conditions per place. [2024-06-14 15:57:46,116 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 135 selfloop transitions, 32 changer transitions 0/172 dead transitions. [2024-06-14 15:57:46,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 172 transitions, 2054 flow [2024-06-14 15:57:46,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:57:46,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:57:46,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-06-14 15:57:46,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46598639455782315 [2024-06-14 15:57:46,118 INFO L175 Difference]: Start difference. First operand has 123 places, 144 transitions, 1488 flow. Second operand 7 states and 137 transitions. [2024-06-14 15:57:46,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 172 transitions, 2054 flow [2024-06-14 15:57:46,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 172 transitions, 1890 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-06-14 15:57:46,164 INFO L231 Difference]: Finished difference. Result has 124 places, 150 transitions, 1488 flow [2024-06-14 15:57:46,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1324, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1488, PETRI_PLACES=124, PETRI_TRANSITIONS=150} [2024-06-14 15:57:46,164 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 81 predicate places. [2024-06-14 15:57:46,165 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 150 transitions, 1488 flow [2024-06-14 15:57:46,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-14 15:57:46,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:46,165 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:57:46,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 15:57:46,165 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-14 15:57:46,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:46,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1287676391, now seen corresponding path program 3 times [2024-06-14 15:57:46,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:46,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28498786] [2024-06-14 15:57:46,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:46,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:57:54,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:57:54,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:57:54,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28498786] [2024-06-14 15:57:54,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28498786] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:57:54,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:57:54,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:57:54,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817972359] [2024-06-14 15:57:54,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:57:54,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:57:54,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:57:54,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:57:54,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:57:54,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:57:54,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 150 transitions, 1488 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:54,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:57:54,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:57:54,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:55,769 INFO L124 PetriNetUnfolderBase]: 1737/2718 cut-off events. [2024-06-14 15:57:55,770 INFO L125 PetriNetUnfolderBase]: For 71223/71223 co-relation queries the response was YES. [2024-06-14 15:57:55,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17786 conditions, 2718 events. 1737/2718 cut-off events. For 71223/71223 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14077 event pairs, 440 based on Foata normal form. 2/2716 useless extension candidates. Maximal degree in co-relation 17725. Up to 2404 conditions per place. [2024-06-14 15:57:55,789 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 125 selfloop transitions, 46 changer transitions 0/176 dead transitions. [2024-06-14 15:57:55,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 176 transitions, 1972 flow [2024-06-14 15:57:55,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:57:55,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:57:55,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-14 15:57:55,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46130952380952384 [2024-06-14 15:57:55,792 INFO L175 Difference]: Start difference. First operand has 124 places, 150 transitions, 1488 flow. Second operand 8 states and 155 transitions. [2024-06-14 15:57:55,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 176 transitions, 1972 flow [2024-06-14 15:57:55,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 176 transitions, 1920 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-14 15:57:55,849 INFO L231 Difference]: Finished difference. Result has 129 places, 153 transitions, 1614 flow [2024-06-14 15:57:55,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1436, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1614, PETRI_PLACES=129, PETRI_TRANSITIONS=153} [2024-06-14 15:57:55,850 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 86 predicate places. [2024-06-14 15:57:55,850 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 153 transitions, 1614 flow [2024-06-14 15:57:55,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:55,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:55,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-14 15:57:55,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 15:57:55,851 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-14 15:57:55,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:55,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1572776261, now seen corresponding path program 4 times [2024-06-14 15:57:55,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:55,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935331042] [2024-06-14 15:57:55,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:55,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:58:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:58:05,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:58:05,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935331042] [2024-06-14 15:58:05,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935331042] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:58:05,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:58:05,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:58:05,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643017846] [2024-06-14 15:58:05,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:58:05,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:58:05,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:58:05,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:58:05,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:58:05,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:58:05,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 153 transitions, 1614 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:58:05,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:58:05,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:58:05,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:58:06,619 INFO L124 PetriNetUnfolderBase]: 1732/2711 cut-off events. [2024-06-14 15:58:06,619 INFO L125 PetriNetUnfolderBase]: For 77248/77248 co-relation queries the response was YES. [2024-06-14 15:58:06,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18207 conditions, 2711 events. 1732/2711 cut-off events. For 77248/77248 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14065 event pairs, 440 based on Foata normal form. 2/2709 useless extension candidates. Maximal degree in co-relation 18144. Up to 2334 conditions per place. [2024-06-14 15:58:06,639 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 115 selfloop transitions, 59 changer transitions 0/179 dead transitions. [2024-06-14 15:58:06,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 179 transitions, 2110 flow [2024-06-14 15:58:06,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:58:06,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:58:06,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-14 15:58:06,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-14 15:58:06,642 INFO L175 Difference]: Start difference. First operand has 129 places, 153 transitions, 1614 flow. Second operand 8 states and 154 transitions. [2024-06-14 15:58:06,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 179 transitions, 2110 flow [2024-06-14 15:58:06,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 179 transitions, 1956 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-14 15:58:06,694 INFO L231 Difference]: Finished difference. Result has 131 places, 156 transitions, 1670 flow [2024-06-14 15:58:06,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1460, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1670, PETRI_PLACES=131, PETRI_TRANSITIONS=156} [2024-06-14 15:58:06,695 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 88 predicate places. [2024-06-14 15:58:06,695 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 156 transitions, 1670 flow [2024-06-14 15:58:06,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:58:06,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:58:06,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:58:06,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 15:58:06,696 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-14 15:58:06,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:58:06,696 INFO L85 PathProgramCache]: Analyzing trace with hash 111692664, now seen corresponding path program 2 times [2024-06-14 15:58:06,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:58:06,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785668356] [2024-06-14 15:58:06,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:58:06,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:58:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:58:20,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:58:20,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:58:20,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785668356] [2024-06-14 15:58:20,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785668356] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:58:20,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:58:20,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:58:20,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963645528] [2024-06-14 15:58:20,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:58:20,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:58:20,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:58:20,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:58:20,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:58:20,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:58:20,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 156 transitions, 1670 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-14 15:58:20,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:58:20,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:58:20,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:58:21,689 INFO L124 PetriNetUnfolderBase]: 1720/2703 cut-off events. [2024-06-14 15:58:21,689 INFO L125 PetriNetUnfolderBase]: For 81552/81552 co-relation queries the response was YES. [2024-06-14 15:58:21,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18373 conditions, 2703 events. 1720/2703 cut-off events. For 81552/81552 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 14017 event pairs, 423 based on Foata normal form. 4/2706 useless extension candidates. Maximal degree in co-relation 18309. Up to 2512 conditions per place. [2024-06-14 15:58:21,708 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 143 selfloop transitions, 27 changer transitions 0/175 dead transitions. [2024-06-14 15:58:21,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 175 transitions, 2088 flow [2024-06-14 15:58:21,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:58:21,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:58:21,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2024-06-14 15:58:21,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4801587301587302 [2024-06-14 15:58:21,710 INFO L175 Difference]: Start difference. First operand has 131 places, 156 transitions, 1670 flow. Second operand 6 states and 121 transitions. [2024-06-14 15:58:21,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 175 transitions, 2088 flow [2024-06-14 15:58:21,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 175 transitions, 1884 flow, removed 45 selfloop flow, removed 6 redundant places. [2024-06-14 15:58:21,770 INFO L231 Difference]: Finished difference. Result has 131 places, 156 transitions, 1526 flow [2024-06-14 15:58:21,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1526, PETRI_PLACES=131, PETRI_TRANSITIONS=156} [2024-06-14 15:58:21,771 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 88 predicate places. [2024-06-14 15:58:21,771 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 156 transitions, 1526 flow [2024-06-14 15:58:21,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-14 15:58:21,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:58:21,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:58:21,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 15:58:21,772 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:58:21,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:58:21,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1729161314, now seen corresponding path program 1 times [2024-06-14 15:58:21,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:58:21,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820698021] [2024-06-14 15:58:21,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:58:21,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:58:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:58:32,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:58:32,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:58:32,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820698021] [2024-06-14 15:58:32,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820698021] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:58:32,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:58:32,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:58:32,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301569121] [2024-06-14 15:58:32,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:58:32,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:58:32,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:58:32,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:58:32,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:58:32,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:58:32,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 156 transitions, 1526 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-14 15:58:32,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:58:32,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:58:32,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:58:33,349 INFO L124 PetriNetUnfolderBase]: 1767/2761 cut-off events. [2024-06-14 15:58:33,350 INFO L125 PetriNetUnfolderBase]: For 85281/85281 co-relation queries the response was YES. [2024-06-14 15:58:33,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18716 conditions, 2761 events. 1767/2761 cut-off events. For 85281/85281 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 14271 event pairs, 427 based on Foata normal form. 3/2761 useless extension candidates. Maximal degree in co-relation 18651. Up to 2427 conditions per place. [2024-06-14 15:58:33,368 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 146 selfloop transitions, 45 changer transitions 0/196 dead transitions. [2024-06-14 15:58:33,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 196 transitions, 2328 flow [2024-06-14 15:58:33,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:58:33,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:58:33,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2024-06-14 15:58:33,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47278911564625853 [2024-06-14 15:58:33,369 INFO L175 Difference]: Start difference. First operand has 131 places, 156 transitions, 1526 flow. Second operand 7 states and 139 transitions. [2024-06-14 15:58:33,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 196 transitions, 2328 flow [2024-06-14 15:58:33,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 196 transitions, 2239 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-14 15:58:33,415 INFO L231 Difference]: Finished difference. Result has 135 places, 174 transitions, 1806 flow [2024-06-14 15:58:33,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1441, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1806, PETRI_PLACES=135, PETRI_TRANSITIONS=174} [2024-06-14 15:58:33,416 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 92 predicate places. [2024-06-14 15:58:33,416 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 174 transitions, 1806 flow [2024-06-14 15:58:33,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-14 15:58:33,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:58:33,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-14 15:58:33,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 15:58:33,417 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:58:33,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:58:33,417 INFO L85 PathProgramCache]: Analyzing trace with hash -63439840, now seen corresponding path program 2 times [2024-06-14 15:58:33,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:58:33,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100033669] [2024-06-14 15:58:33,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:58:33,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:58:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:58:43,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-14 15:58:43,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:58:43,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100033669] [2024-06-14 15:58:43,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100033669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:58:43,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:58:43,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:58:43,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061071791] [2024-06-14 15:58:43,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:58:43,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:58:43,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:58:43,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:58:43,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:58:43,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:58:43,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 174 transitions, 1806 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-14 15:58:43,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:58:43,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:58:43,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:58:45,300 INFO L124 PetriNetUnfolderBase]: 1935/3026 cut-off events. [2024-06-14 15:58:45,301 INFO L125 PetriNetUnfolderBase]: For 102888/102888 co-relation queries the response was YES. [2024-06-14 15:58:45,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21547 conditions, 3026 events. 1935/3026 cut-off events. For 102888/102888 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15983 event pairs, 434 based on Foata normal form. 9/3034 useless extension candidates. Maximal degree in co-relation 21479. Up to 2748 conditions per place. [2024-06-14 15:58:45,319 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 176 selfloop transitions, 36 changer transitions 0/217 dead transitions. [2024-06-14 15:58:45,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 217 transitions, 2670 flow [2024-06-14 15:58:45,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:58:45,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:58:45,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-14 15:58:45,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45535714285714285 [2024-06-14 15:58:45,320 INFO L175 Difference]: Start difference. First operand has 135 places, 174 transitions, 1806 flow. Second operand 8 states and 153 transitions. [2024-06-14 15:58:45,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 217 transitions, 2670 flow [2024-06-14 15:58:45,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 217 transitions, 2586 flow, removed 41 selfloop flow, removed 1 redundant places. [2024-06-14 15:58:45,396 INFO L231 Difference]: Finished difference. Result has 143 places, 194 transitions, 2129 flow [2024-06-14 15:58:45,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1742, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2129, PETRI_PLACES=143, PETRI_TRANSITIONS=194} [2024-06-14 15:58:45,397 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 100 predicate places. [2024-06-14 15:58:45,397 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 194 transitions, 2129 flow [2024-06-14 15:58:45,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-14 15:58:45,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:58:45,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:58:45,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 15:58:45,398 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:58:45,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:58:45,398 INFO L85 PathProgramCache]: Analyzing trace with hash -2131160252, now seen corresponding path program 3 times [2024-06-14 15:58:45,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:58:45,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410948746] [2024-06-14 15:58:45,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:58:45,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:58:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:58:56,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:58:56,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:58:56,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410948746] [2024-06-14 15:58:56,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410948746] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:58:56,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:58:56,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:58:56,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192615192] [2024-06-14 15:58:56,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:58:56,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:58:56,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:58:56,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:58:56,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:58:56,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:58:56,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 194 transitions, 2129 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-14 15:58:56,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:58:56,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:58:56,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:58:57,653 INFO L124 PetriNetUnfolderBase]: 2090/3258 cut-off events. [2024-06-14 15:58:57,653 INFO L125 PetriNetUnfolderBase]: For 116903/116903 co-relation queries the response was YES. [2024-06-14 15:58:57,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24188 conditions, 3258 events. 2090/3258 cut-off events. For 116903/116903 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 17401 event pairs, 477 based on Foata normal form. 9/3266 useless extension candidates. Maximal degree in co-relation 24116. Up to 2821 conditions per place. [2024-06-14 15:58:57,675 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 172 selfloop transitions, 65 changer transitions 0/242 dead transitions. [2024-06-14 15:58:57,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 242 transitions, 3081 flow [2024-06-14 15:58:57,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:58:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:58:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2024-06-14 15:58:57,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034013605442177 [2024-06-14 15:58:57,677 INFO L175 Difference]: Start difference. First operand has 143 places, 194 transitions, 2129 flow. Second operand 7 states and 148 transitions. [2024-06-14 15:58:57,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 242 transitions, 3081 flow [2024-06-14 15:58:57,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 242 transitions, 2953 flow, removed 51 selfloop flow, removed 3 redundant places. [2024-06-14 15:58:57,786 INFO L231 Difference]: Finished difference. Result has 149 places, 215 transitions, 2556 flow [2024-06-14 15:58:57,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2004, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2556, PETRI_PLACES=149, PETRI_TRANSITIONS=215} [2024-06-14 15:58:57,786 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 106 predicate places. [2024-06-14 15:58:57,787 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 215 transitions, 2556 flow [2024-06-14 15:58:57,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-14 15:58:57,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:58:57,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:58:57,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 15:58:57,787 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:58:57,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:58:57,788 INFO L85 PathProgramCache]: Analyzing trace with hash 555444086, now seen corresponding path program 1 times [2024-06-14 15:58:57,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:58:57,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724887863] [2024-06-14 15:58:57,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:58:57,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:58:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:10,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:59:10,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:10,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724887863] [2024-06-14 15:59:10,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724887863] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:10,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:10,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:59:10,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432474396] [2024-06-14 15:59:10,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:10,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:59:10,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:10,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:59:10,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:59:10,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:59:10,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 215 transitions, 2556 flow. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:10,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:10,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:59:10,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:12,017 INFO L124 PetriNetUnfolderBase]: 2085/3253 cut-off events. [2024-06-14 15:59:12,017 INFO L125 PetriNetUnfolderBase]: For 124258/124258 co-relation queries the response was YES. [2024-06-14 15:59:12,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25354 conditions, 3253 events. 2085/3253 cut-off events. For 124258/124258 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 17398 event pairs, 500 based on Foata normal form. 2/3254 useless extension candidates. Maximal degree in co-relation 25278. Up to 3093 conditions per place. [2024-06-14 15:59:12,042 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 208 selfloop transitions, 13 changer transitions 0/226 dead transitions. [2024-06-14 15:59:12,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 226 transitions, 3058 flow [2024-06-14 15:59:12,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:59:12,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:59:12,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2024-06-14 15:59:12,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-14 15:59:12,044 INFO L175 Difference]: Start difference. First operand has 149 places, 215 transitions, 2556 flow. Second operand 5 states and 95 transitions. [2024-06-14 15:59:12,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 226 transitions, 3058 flow [2024-06-14 15:59:12,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 226 transitions, 2948 flow, removed 50 selfloop flow, removed 2 redundant places. [2024-06-14 15:59:12,193 INFO L231 Difference]: Finished difference. Result has 152 places, 217 transitions, 2515 flow [2024-06-14 15:59:12,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2446, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2515, PETRI_PLACES=152, PETRI_TRANSITIONS=217} [2024-06-14 15:59:12,194 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 109 predicate places. [2024-06-14 15:59:12,194 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 217 transitions, 2515 flow [2024-06-14 15:59:12,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:12,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:12,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:12,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 15:59:12,194 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:59:12,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:12,195 INFO L85 PathProgramCache]: Analyzing trace with hash -467098506, now seen corresponding path program 1 times [2024-06-14 15:59:12,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:12,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470581161] [2024-06-14 15:59:12,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:12,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:21,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:59:21,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:21,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470581161] [2024-06-14 15:59:21,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470581161] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:21,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:21,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:59:21,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044035405] [2024-06-14 15:59:21,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:21,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:59:21,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:21,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:59:21,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:59:21,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:59:21,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 217 transitions, 2515 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:21,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:21,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:59:21,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:22,949 INFO L124 PetriNetUnfolderBase]: 2102/3268 cut-off events. [2024-06-14 15:59:22,950 INFO L125 PetriNetUnfolderBase]: For 129070/129070 co-relation queries the response was YES. [2024-06-14 15:59:22,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25566 conditions, 3268 events. 2102/3268 cut-off events. For 129070/129070 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 17420 event pairs, 349 based on Foata normal form. 4/3268 useless extension candidates. Maximal degree in co-relation 25488. Up to 3018 conditions per place. [2024-06-14 15:59:22,974 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 219 selfloop transitions, 17 changer transitions 0/241 dead transitions. [2024-06-14 15:59:22,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 241 transitions, 3101 flow [2024-06-14 15:59:22,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:59:22,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:59:22,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-14 15:59:22,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2024-06-14 15:59:22,977 INFO L175 Difference]: Start difference. First operand has 152 places, 217 transitions, 2515 flow. Second operand 7 states and 132 transitions. [2024-06-14 15:59:22,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 241 transitions, 3101 flow [2024-06-14 15:59:23,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 241 transitions, 3048 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-06-14 15:59:23,081 INFO L231 Difference]: Finished difference. Result has 156 places, 219 transitions, 2557 flow [2024-06-14 15:59:23,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2462, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2557, PETRI_PLACES=156, PETRI_TRANSITIONS=219} [2024-06-14 15:59:23,081 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 113 predicate places. [2024-06-14 15:59:23,081 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 219 transitions, 2557 flow [2024-06-14 15:59:23,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:23,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:23,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:23,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 15:59:23,082 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:59:23,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:23,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1548560548, now seen corresponding path program 2 times [2024-06-14 15:59:23,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:23,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538920530] [2024-06-14 15:59:23,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:23,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:59:32,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:32,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538920530] [2024-06-14 15:59:32,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538920530] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:32,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:32,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:59:32,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044016943] [2024-06-14 15:59:32,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:32,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:59:32,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:32,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:59:32,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:59:32,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:59:32,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 219 transitions, 2557 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:32,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:32,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:59:32,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:33,756 INFO L124 PetriNetUnfolderBase]: 2119/3299 cut-off events. [2024-06-14 15:59:33,756 INFO L125 PetriNetUnfolderBase]: For 136241/136241 co-relation queries the response was YES. [2024-06-14 15:59:33,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26083 conditions, 3299 events. 2119/3299 cut-off events. For 136241/136241 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 17653 event pairs, 462 based on Foata normal form. 4/3299 useless extension candidates. Maximal degree in co-relation 26004. Up to 2808 conditions per place. [2024-06-14 15:59:33,782 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 199 selfloop transitions, 44 changer transitions 0/248 dead transitions. [2024-06-14 15:59:33,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 248 transitions, 3370 flow [2024-06-14 15:59:33,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:59:33,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:59:33,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2024-06-14 15:59:33,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2024-06-14 15:59:33,785 INFO L175 Difference]: Start difference. First operand has 156 places, 219 transitions, 2557 flow. Second operand 7 states and 138 transitions. [2024-06-14 15:59:33,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 248 transitions, 3370 flow [2024-06-14 15:59:33,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 248 transitions, 3293 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-14 15:59:33,896 INFO L231 Difference]: Finished difference. Result has 159 places, 225 transitions, 2741 flow [2024-06-14 15:59:33,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2480, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2741, PETRI_PLACES=159, PETRI_TRANSITIONS=225} [2024-06-14 15:59:33,897 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 116 predicate places. [2024-06-14 15:59:33,897 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 225 transitions, 2741 flow [2024-06-14 15:59:33,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:33,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:33,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:33,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 15:59:33,897 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:59:33,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:33,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1548708418, now seen corresponding path program 3 times [2024-06-14 15:59:33,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:33,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301486098] [2024-06-14 15:59:33,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:33,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:43,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:59:43,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:43,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301486098] [2024-06-14 15:59:43,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301486098] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:43,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:43,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:59:43,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354787246] [2024-06-14 15:59:43,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:43,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:59:43,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:43,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:59:43,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:59:44,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:59:44,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 225 transitions, 2741 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:44,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:44,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:59:44,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:45,629 INFO L124 PetriNetUnfolderBase]: 2169/3400 cut-off events. [2024-06-14 15:59:45,630 INFO L125 PetriNetUnfolderBase]: For 152578/152578 co-relation queries the response was YES. [2024-06-14 15:59:45,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27114 conditions, 3400 events. 2169/3400 cut-off events. For 152578/152578 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 18498 event pairs, 431 based on Foata normal form. 20/3416 useless extension candidates. Maximal degree in co-relation 27033. Up to 2915 conditions per place. [2024-06-14 15:59:45,659 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 198 selfloop transitions, 47 changer transitions 0/250 dead transitions. [2024-06-14 15:59:45,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 250 transitions, 3404 flow [2024-06-14 15:59:45,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:59:45,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:59:45,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2024-06-14 15:59:45,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2024-06-14 15:59:45,662 INFO L175 Difference]: Start difference. First operand has 159 places, 225 transitions, 2741 flow. Second operand 7 states and 144 transitions. [2024-06-14 15:59:45,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 250 transitions, 3404 flow [2024-06-14 15:59:45,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 250 transitions, 3236 flow, removed 65 selfloop flow, removed 3 redundant places. [2024-06-14 15:59:45,818 INFO L231 Difference]: Finished difference. Result has 163 places, 226 transitions, 2736 flow [2024-06-14 15:59:45,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2585, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2736, PETRI_PLACES=163, PETRI_TRANSITIONS=226} [2024-06-14 15:59:45,819 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 120 predicate places. [2024-06-14 15:59:45,819 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 226 transitions, 2736 flow [2024-06-14 15:59:45,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:45,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:45,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:45,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 15:59:45,819 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:59:45,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:45,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1350685152, now seen corresponding path program 1 times [2024-06-14 15:59:45,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:45,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252886629] [2024-06-14 15:59:45,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:45,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:59:55,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:55,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252886629] [2024-06-14 15:59:55,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252886629] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:55,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:55,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:59:55,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773557099] [2024-06-14 15:59:55,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:55,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:59:55,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:55,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:59:55,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:59:55,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 15:59:55,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 226 transitions, 2736 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:55,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:55,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 15:59:55,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:57,391 INFO L124 PetriNetUnfolderBase]: 2296/3628 cut-off events. [2024-06-14 15:59:57,391 INFO L125 PetriNetUnfolderBase]: For 168628/168628 co-relation queries the response was YES. [2024-06-14 15:59:57,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29356 conditions, 3628 events. 2296/3628 cut-off events. For 168628/168628 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 20190 event pairs, 467 based on Foata normal form. 12/3637 useless extension candidates. Maximal degree in co-relation 29273. Up to 2919 conditions per place. [2024-06-14 15:59:57,419 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 209 selfloop transitions, 51 changer transitions 0/265 dead transitions. [2024-06-14 15:59:57,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 265 transitions, 3657 flow [2024-06-14 15:59:57,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:59:57,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:59:57,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions. [2024-06-14 15:59:57,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-14 15:59:57,422 INFO L175 Difference]: Start difference. First operand has 163 places, 226 transitions, 2736 flow. Second operand 9 states and 180 transitions. [2024-06-14 15:59:57,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 265 transitions, 3657 flow [2024-06-14 15:59:57,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 265 transitions, 3579 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-14 15:59:57,564 INFO L231 Difference]: Finished difference. Result has 168 places, 228 transitions, 2856 flow [2024-06-14 15:59:57,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2658, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2856, PETRI_PLACES=168, PETRI_TRANSITIONS=228} [2024-06-14 15:59:57,565 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 125 predicate places. [2024-06-14 15:59:57,565 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 228 transitions, 2856 flow [2024-06-14 15:59:57,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:59:57,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:57,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:57,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 15:59:57,566 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-14 15:59:57,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:57,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1350418242, now seen corresponding path program 2 times [2024-06-14 15:59:57,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:57,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071893987] [2024-06-14 15:59:57,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:57,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:00:07,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:00:07,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:00:07,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071893987] [2024-06-14 16:00:07,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071893987] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:00:07,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:00:07,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:00:07,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776880569] [2024-06-14 16:00:07,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:00:07,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:00:07,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:00:07,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:00:07,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:00:08,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:00:08,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 228 transitions, 2856 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:00:08,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:00:08,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:00:08,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:00:09,770 INFO L124 PetriNetUnfolderBase]: 2296/3617 cut-off events. [2024-06-14 16:00:09,770 INFO L125 PetriNetUnfolderBase]: For 170185/170185 co-relation queries the response was YES. [2024-06-14 16:00:09,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28949 conditions, 3617 events. 2296/3617 cut-off events. For 170185/170185 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 20093 event pairs, 501 based on Foata normal form. 16/3630 useless extension candidates. Maximal degree in co-relation 28865. Up to 3152 conditions per place. [2024-06-14 16:00:09,798 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 211 selfloop transitions, 52 changer transitions 0/268 dead transitions. [2024-06-14 16:00:09,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 268 transitions, 3606 flow [2024-06-14 16:00:09,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 16:00:09,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 16:00:09,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-06-14 16:00:09,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-06-14 16:00:09,801 INFO L175 Difference]: Start difference. First operand has 168 places, 228 transitions, 2856 flow. Second operand 10 states and 192 transitions. [2024-06-14 16:00:09,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 268 transitions, 3606 flow [2024-06-14 16:00:09,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 268 transitions, 3508 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-14 16:00:09,976 INFO L231 Difference]: Finished difference. Result has 173 places, 233 transitions, 2950 flow [2024-06-14 16:00:09,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2762, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2950, PETRI_PLACES=173, PETRI_TRANSITIONS=233} [2024-06-14 16:00:09,977 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 130 predicate places. [2024-06-14 16:00:09,977 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 233 transitions, 2950 flow [2024-06-14 16:00:09,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:00:09,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:00:09,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:00:09,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 16:00:09,978 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:00:09,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:00:09,978 INFO L85 PathProgramCache]: Analyzing trace with hash 2001921098, now seen corresponding path program 1 times [2024-06-14 16:00:09,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:00:09,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775251372] [2024-06-14 16:00:09,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:00:09,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:00:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:00:20,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:00:20,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:00:20,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775251372] [2024-06-14 16:00:20,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775251372] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:00:20,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:00:20,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:00:20,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709926554] [2024-06-14 16:00:20,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:00:20,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:00:20,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:00:20,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:00:20,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:00:20,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:00:20,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 233 transitions, 2950 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-14 16:00:20,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:00:20,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:00:20,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:00:22,212 INFO L124 PetriNetUnfolderBase]: 2338/3687 cut-off events. [2024-06-14 16:00:22,213 INFO L125 PetriNetUnfolderBase]: For 170562/170562 co-relation queries the response was YES. [2024-06-14 16:00:22,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29810 conditions, 3687 events. 2338/3687 cut-off events. For 170562/170562 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 20573 event pairs, 496 based on Foata normal form. 2/3688 useless extension candidates. Maximal degree in co-relation 29724. Up to 3421 conditions per place. [2024-06-14 16:00:22,254 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 222 selfloop transitions, 36 changer transitions 0/263 dead transitions. [2024-06-14 16:00:22,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 263 transitions, 3813 flow [2024-06-14 16:00:22,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:00:22,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:00:22,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-14 16:00:22,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45918367346938777 [2024-06-14 16:00:22,256 INFO L175 Difference]: Start difference. First operand has 173 places, 233 transitions, 2950 flow. Second operand 7 states and 135 transitions. [2024-06-14 16:00:22,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 263 transitions, 3813 flow [2024-06-14 16:00:22,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 263 transitions, 3695 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-14 16:00:22,419 INFO L231 Difference]: Finished difference. Result has 173 places, 242 transitions, 3128 flow [2024-06-14 16:00:22,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2832, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3128, PETRI_PLACES=173, PETRI_TRANSITIONS=242} [2024-06-14 16:00:22,420 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 130 predicate places. [2024-06-14 16:00:22,420 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 242 transitions, 3128 flow [2024-06-14 16:00:22,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-14 16:00:22,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:00:22,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:00:22,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 16:00:22,421 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:00:22,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:00:22,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1176696338, now seen corresponding path program 2 times [2024-06-14 16:00:22,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:00:22,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509093618] [2024-06-14 16:00:22,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:00:22,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:00:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:00:33,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:00:33,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:00:33,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509093618] [2024-06-14 16:00:33,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509093618] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:00:33,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:00:33,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:00:33,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432948794] [2024-06-14 16:00:33,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:00:33,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:00:33,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:00:33,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:00:33,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:00:33,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:00:33,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 242 transitions, 3128 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-14 16:00:33,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:00:33,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:00:33,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:00:35,051 INFO L124 PetriNetUnfolderBase]: 2332/3684 cut-off events. [2024-06-14 16:00:35,051 INFO L125 PetriNetUnfolderBase]: For 175145/175145 co-relation queries the response was YES. [2024-06-14 16:00:35,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29799 conditions, 3684 events. 2332/3684 cut-off events. For 175145/175145 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 20630 event pairs, 495 based on Foata normal form. 2/3685 useless extension candidates. Maximal degree in co-relation 29711. Up to 3473 conditions per place. [2024-06-14 16:00:35,083 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 231 selfloop transitions, 22 changer transitions 0/258 dead transitions. [2024-06-14 16:00:35,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 258 transitions, 3694 flow [2024-06-14 16:00:35,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:00:35,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:00:35,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-14 16:00:35,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4387755102040816 [2024-06-14 16:00:35,085 INFO L175 Difference]: Start difference. First operand has 173 places, 242 transitions, 3128 flow. Second operand 7 states and 129 transitions. [2024-06-14 16:00:35,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 258 transitions, 3694 flow [2024-06-14 16:00:35,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 258 transitions, 3622 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-06-14 16:00:35,297 INFO L231 Difference]: Finished difference. Result has 177 places, 242 transitions, 3106 flow [2024-06-14 16:00:35,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3056, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3106, PETRI_PLACES=177, PETRI_TRANSITIONS=242} [2024-06-14 16:00:35,298 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 134 predicate places. [2024-06-14 16:00:35,298 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 242 transitions, 3106 flow [2024-06-14 16:00:35,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-14 16:00:35,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:00:35,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:00:35,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 16:00:35,299 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:00:35,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:00:35,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1511692192, now seen corresponding path program 3 times [2024-06-14 16:00:35,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:00:35,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845937076] [2024-06-14 16:00:35,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:00:35,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:00:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:00:45,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:00:45,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:00:45,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845937076] [2024-06-14 16:00:45,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845937076] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:00:45,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:00:45,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:00:45,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477587716] [2024-06-14 16:00:45,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:00:45,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:00:45,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:00:45,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:00:45,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:00:45,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-06-14 16:00:45,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 242 transitions, 3106 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:00:45,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:00:45,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-06-14 16:00:45,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:00:47,159 INFO L124 PetriNetUnfolderBase]: 2459/3899 cut-off events. [2024-06-14 16:00:47,160 INFO L125 PetriNetUnfolderBase]: For 205002/205002 co-relation queries the response was YES. [2024-06-14 16:00:47,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32297 conditions, 3899 events. 2459/3899 cut-off events. For 205002/205002 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 22274 event pairs, 532 based on Foata normal form. 12/3907 useless extension candidates. Maximal degree in co-relation 32208. Up to 3217 conditions per place. [2024-06-14 16:00:47,193 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 210 selfloop transitions, 65 changer transitions 0/280 dead transitions. [2024-06-14 16:00:47,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 280 transitions, 4068 flow [2024-06-14 16:00:47,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:00:47,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:00:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-14 16:00:47,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4470899470899471 [2024-06-14 16:00:47,196 INFO L175 Difference]: Start difference. First operand has 177 places, 242 transitions, 3106 flow. Second operand 9 states and 169 transitions. [2024-06-14 16:00:47,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 280 transitions, 4068 flow [2024-06-14 16:00:47,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 280 transitions, 3986 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-06-14 16:00:47,422 INFO L231 Difference]: Finished difference. Result has 182 places, 244 transitions, 3254 flow [2024-06-14 16:00:47,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3024, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3254, PETRI_PLACES=182, PETRI_TRANSITIONS=244} [2024-06-14 16:00:47,422 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 139 predicate places. [2024-06-14 16:00:47,422 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 244 transitions, 3254 flow [2024-06-14 16:00:47,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:00:47,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:00:47,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:00:47,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 16:00:47,423 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:00:47,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:00:47,423 INFO L85 PathProgramCache]: Analyzing trace with hash -496007852, now seen corresponding path program 4 times [2024-06-14 16:00:47,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:00:47,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784881802] [2024-06-14 16:00:47,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:00:47,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:00:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:01:00,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:01:00,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:01:00,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784881802] [2024-06-14 16:01:00,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784881802] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:01:00,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:01:00,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:01:00,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902132456] [2024-06-14 16:01:00,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:01:00,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:01:00,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:01:00,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:01:00,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:01:00,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:01:00,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 244 transitions, 3254 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:01:00,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:01:00,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:01:00,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:01:02,384 INFO L124 PetriNetUnfolderBase]: 2489/3958 cut-off events. [2024-06-14 16:01:02,385 INFO L125 PetriNetUnfolderBase]: For 221378/221378 co-relation queries the response was YES. [2024-06-14 16:01:02,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32592 conditions, 3958 events. 2489/3958 cut-off events. For 221378/221378 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 22778 event pairs, 529 based on Foata normal form. 32/3987 useless extension candidates. Maximal degree in co-relation 32502. Up to 3314 conditions per place. [2024-06-14 16:01:02,418 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 216 selfloop transitions, 64 changer transitions 0/285 dead transitions. [2024-06-14 16:01:02,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 285 transitions, 4031 flow [2024-06-14 16:01:02,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 16:01:02,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 16:01:02,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 211 transitions. [2024-06-14 16:01:02,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45670995670995673 [2024-06-14 16:01:02,423 INFO L175 Difference]: Start difference. First operand has 182 places, 244 transitions, 3254 flow. Second operand 11 states and 211 transitions. [2024-06-14 16:01:02,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 285 transitions, 4031 flow [2024-06-14 16:01:02,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 285 transitions, 3910 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-14 16:01:02,682 INFO L231 Difference]: Finished difference. Result has 188 places, 246 transitions, 3334 flow [2024-06-14 16:01:02,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3133, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3334, PETRI_PLACES=188, PETRI_TRANSITIONS=246} [2024-06-14 16:01:02,682 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 145 predicate places. [2024-06-14 16:01:02,683 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 246 transitions, 3334 flow [2024-06-14 16:01:02,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:01:02,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:01:02,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:01:02,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 16:01:02,683 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:01:02,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:01:02,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1263530814, now seen corresponding path program 5 times [2024-06-14 16:01:02,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:01:02,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804778041] [2024-06-14 16:01:02,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:01:02,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:01:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:01:11,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:01:11,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:01:11,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804778041] [2024-06-14 16:01:11,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804778041] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:01:11,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:01:11,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:01:11,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211231599] [2024-06-14 16:01:11,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:01:11,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:01:11,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:01:11,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:01:11,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:01:12,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:01:12,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 246 transitions, 3334 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:01:12,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:01:12,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:01:12,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:01:13,577 INFO L124 PetriNetUnfolderBase]: 2571/4110 cut-off events. [2024-06-14 16:01:13,578 INFO L125 PetriNetUnfolderBase]: For 217888/217888 co-relation queries the response was YES. [2024-06-14 16:01:13,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33794 conditions, 4110 events. 2571/4110 cut-off events. For 217888/217888 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 23908 event pairs, 544 based on Foata normal form. 12/4119 useless extension candidates. Maximal degree in co-relation 33702. Up to 3464 conditions per place. [2024-06-14 16:01:13,613 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 230 selfloop transitions, 47 changer transitions 0/282 dead transitions. [2024-06-14 16:01:13,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 282 transitions, 4136 flow [2024-06-14 16:01:13,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:01:13,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:01:13,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-14 16:01:13,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-14 16:01:13,616 INFO L175 Difference]: Start difference. First operand has 188 places, 246 transitions, 3334 flow. Second operand 9 states and 175 transitions. [2024-06-14 16:01:13,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 282 transitions, 4136 flow [2024-06-14 16:01:13,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 282 transitions, 3968 flow, removed 15 selfloop flow, removed 10 redundant places. [2024-06-14 16:01:13,844 INFO L231 Difference]: Finished difference. Result has 188 places, 248 transitions, 3351 flow [2024-06-14 16:01:13,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3166, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3351, PETRI_PLACES=188, PETRI_TRANSITIONS=248} [2024-06-14 16:01:13,845 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 145 predicate places. [2024-06-14 16:01:13,845 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 248 transitions, 3351 flow [2024-06-14 16:01:13,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:01:13,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:01:13,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:01:13,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 16:01:13,846 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-14 16:01:13,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:01:13,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1825391422, now seen corresponding path program 6 times [2024-06-14 16:01:13,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:01:13,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068355024] [2024-06-14 16:01:13,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:01:13,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:01:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:01:22,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:01:22,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:01:22,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068355024] [2024-06-14 16:01:22,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068355024] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:01:22,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:01:22,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:01:22,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559094942] [2024-06-14 16:01:22,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:01:22,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:01:22,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:01:22,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:01:22,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:01:22,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:01:22,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 248 transitions, 3351 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:01:22,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:01:22,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:01:22,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:01:24,500 INFO L124 PetriNetUnfolderBase]: 2628/4213 cut-off events. [2024-06-14 16:01:24,500 INFO L125 PetriNetUnfolderBase]: For 222915/222915 co-relation queries the response was YES. [2024-06-14 16:01:24,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34099 conditions, 4213 events. 2628/4213 cut-off events. For 222915/222915 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 24655 event pairs, 532 based on Foata normal form. 12/4222 useless extension candidates. Maximal degree in co-relation 34007. Up to 2948 conditions per place. [2024-06-14 16:01:24,537 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 214 selfloop transitions, 66 changer transitions 0/285 dead transitions. [2024-06-14 16:01:24,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 285 transitions, 4157 flow [2024-06-14 16:01:24,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:01:24,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:01:24,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-14 16:01:24,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-14 16:01:24,540 INFO L175 Difference]: Start difference. First operand has 188 places, 248 transitions, 3351 flow. Second operand 9 states and 175 transitions. [2024-06-14 16:01:24,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 285 transitions, 4157 flow [2024-06-14 16:01:24,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 285 transitions, 4038 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-14 16:01:24,883 INFO L231 Difference]: Finished difference. Result has 192 places, 250 transitions, 3467 flow [2024-06-14 16:01:24,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3232, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3467, PETRI_PLACES=192, PETRI_TRANSITIONS=250} [2024-06-14 16:01:24,883 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 149 predicate places. [2024-06-14 16:01:24,883 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 250 transitions, 3467 flow [2024-06-14 16:01:24,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:01:24,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:01:24,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:01:24,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 16:01:24,884 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:01:24,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:01:24,885 INFO L85 PathProgramCache]: Analyzing trace with hash 2055724520, now seen corresponding path program 3 times [2024-06-14 16:01:24,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:01:24,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246480080] [2024-06-14 16:01:24,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:01:24,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:01:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:01:35,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:01:35,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:01:35,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246480080] [2024-06-14 16:01:35,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246480080] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:01:35,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:01:35,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:01:35,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639153621] [2024-06-14 16:01:35,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:01:35,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:01:35,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:01:35,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:01:35,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:01:35,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:01:35,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 250 transitions, 3467 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-14 16:01:35,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:01:35,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:01:35,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:01:37,139 INFO L124 PetriNetUnfolderBase]: 2632/4237 cut-off events. [2024-06-14 16:01:37,140 INFO L125 PetriNetUnfolderBase]: For 223101/223101 co-relation queries the response was YES. [2024-06-14 16:01:37,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34394 conditions, 4237 events. 2632/4237 cut-off events. For 223101/223101 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 25079 event pairs, 580 based on Foata normal form. 4/4238 useless extension candidates. Maximal degree in co-relation 34300. Up to 3700 conditions per place. [2024-06-14 16:01:37,175 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 202 selfloop transitions, 71 changer transitions 0/278 dead transitions. [2024-06-14 16:01:37,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 278 transitions, 4380 flow [2024-06-14 16:01:37,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:01:37,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:01:37,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2024-06-14 16:01:37,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47278911564625853 [2024-06-14 16:01:37,176 INFO L175 Difference]: Start difference. First operand has 192 places, 250 transitions, 3467 flow. Second operand 7 states and 139 transitions. [2024-06-14 16:01:37,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 278 transitions, 4380 flow [2024-06-14 16:01:37,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 278 transitions, 4237 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-14 16:01:37,474 INFO L231 Difference]: Finished difference. Result has 194 places, 257 transitions, 3614 flow [2024-06-14 16:01:37,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3324, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3614, PETRI_PLACES=194, PETRI_TRANSITIONS=257} [2024-06-14 16:01:37,475 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 151 predicate places. [2024-06-14 16:01:37,475 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 257 transitions, 3614 flow [2024-06-14 16:01:37,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-14 16:01:37,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:01:37,476 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:01:37,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 16:01:37,476 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:01:37,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:01:37,477 INFO L85 PathProgramCache]: Analyzing trace with hash 2068104680, now seen corresponding path program 4 times [2024-06-14 16:01:37,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:01:37,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230929119] [2024-06-14 16:01:37,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:01:37,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:01:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:01:48,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:01:48,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:01:48,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230929119] [2024-06-14 16:01:48,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230929119] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:01:48,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:01:48,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:01:48,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797447509] [2024-06-14 16:01:48,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:01:48,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:01:48,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:01:48,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:01:48,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:01:48,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:01:48,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 257 transitions, 3614 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-14 16:01:48,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:01:48,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:01:48,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:01:49,736 INFO L124 PetriNetUnfolderBase]: 2584/4164 cut-off events. [2024-06-14 16:01:49,736 INFO L125 PetriNetUnfolderBase]: For 224229/224229 co-relation queries the response was YES. [2024-06-14 16:01:49,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33535 conditions, 4164 events. 2584/4164 cut-off events. For 224229/224229 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 24597 event pairs, 547 based on Foata normal form. 12/4175 useless extension candidates. Maximal degree in co-relation 33439. Up to 3840 conditions per place. [2024-06-14 16:01:49,770 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 232 selfloop transitions, 40 changer transitions 0/277 dead transitions. [2024-06-14 16:01:49,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 277 transitions, 4254 flow [2024-06-14 16:01:49,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:01:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:01:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-14 16:01:49,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-14 16:01:49,771 INFO L175 Difference]: Start difference. First operand has 194 places, 257 transitions, 3614 flow. Second operand 8 states and 152 transitions. [2024-06-14 16:01:49,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 277 transitions, 4254 flow [2024-06-14 16:01:50,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 277 transitions, 4046 flow, removed 71 selfloop flow, removed 3 redundant places. [2024-06-14 16:01:50,033 INFO L231 Difference]: Finished difference. Result has 199 places, 257 transitions, 3500 flow [2024-06-14 16:01:50,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3406, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3500, PETRI_PLACES=199, PETRI_TRANSITIONS=257} [2024-06-14 16:01:50,034 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 156 predicate places. [2024-06-14 16:01:50,034 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 257 transitions, 3500 flow [2024-06-14 16:01:50,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-14 16:01:50,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:01:50,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:01:50,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 16:01:50,035 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-14 16:01:50,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:01:50,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1641465944, now seen corresponding path program 5 times [2024-06-14 16:01:50,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:01:50,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312533332] [2024-06-14 16:01:50,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:01:50,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:01:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:02:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:02:00,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:02:00,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312533332] [2024-06-14 16:02:00,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312533332] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:02:00,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:02:00,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:02:00,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088489] [2024-06-14 16:02:00,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:02:00,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:02:00,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:02:00,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:02:00,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:02:00,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:02:00,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 257 transitions, 3500 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-14 16:02:00,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:02:00,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:02:00,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:02:02,078 INFO L124 PetriNetUnfolderBase]: 2580/4168 cut-off events. [2024-06-14 16:02:02,078 INFO L125 PetriNetUnfolderBase]: For 222210/222210 co-relation queries the response was YES. [2024-06-14 16:02:02,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32928 conditions, 4168 events. 2580/4168 cut-off events. For 222210/222210 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 24696 event pairs, 553 based on Foata normal form. 12/4179 useless extension candidates. Maximal degree in co-relation 32831. Up to 3643 conditions per place. [2024-06-14 16:02:02,112 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 213 selfloop transitions, 69 changer transitions 0/287 dead transitions. [2024-06-14 16:02:02,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 287 transitions, 4339 flow [2024-06-14 16:02:02,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 16:02:02,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 16:02:02,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2024-06-14 16:02:02,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034013605442177 [2024-06-14 16:02:02,114 INFO L175 Difference]: Start difference. First operand has 199 places, 257 transitions, 3500 flow. Second operand 7 states and 148 transitions. [2024-06-14 16:02:02,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 287 transitions, 4339 flow [2024-06-14 16:02:02,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 287 transitions, 4257 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-14 16:02:02,353 INFO L231 Difference]: Finished difference. Result has 200 places, 261 transitions, 3700 flow [2024-06-14 16:02:02,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3420, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3700, PETRI_PLACES=200, PETRI_TRANSITIONS=261} [2024-06-14 16:02:02,353 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 157 predicate places. [2024-06-14 16:02:02,353 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 261 transitions, 3700 flow [2024-06-14 16:02:02,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-14 16:02:02,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:02:02,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:02:02,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 16:02:02,354 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:02:02,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:02:02,354 INFO L85 PathProgramCache]: Analyzing trace with hash 80000746, now seen corresponding path program 6 times [2024-06-14 16:02:02,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:02:02,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299689351] [2024-06-14 16:02:02,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:02:02,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:02:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:02:12,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:02:12,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:02:12,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299689351] [2024-06-14 16:02:12,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299689351] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:02:12,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:02:12,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 16:02:12,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313102222] [2024-06-14 16:02:12,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:02:12,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 16:02:12,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:02:12,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 16:02:12,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 16:02:12,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:02:12,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 261 transitions, 3700 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-14 16:02:12,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:02:12,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:02:12,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:02:14,126 INFO L124 PetriNetUnfolderBase]: 2550/4124 cut-off events. [2024-06-14 16:02:14,127 INFO L125 PetriNetUnfolderBase]: For 219034/219034 co-relation queries the response was YES. [2024-06-14 16:02:14,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32819 conditions, 4124 events. 2550/4124 cut-off events. For 219034/219034 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 24433 event pairs, 549 based on Foata normal form. 6/4129 useless extension candidates. Maximal degree in co-relation 32720. Up to 3828 conditions per place. [2024-06-14 16:02:14,161 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 238 selfloop transitions, 37 changer transitions 0/280 dead transitions. [2024-06-14 16:02:14,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 280 transitions, 4324 flow [2024-06-14 16:02:14,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 16:02:14,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 16:02:14,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2024-06-14 16:02:14,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2024-06-14 16:02:14,162 INFO L175 Difference]: Start difference. First operand has 200 places, 261 transitions, 3700 flow. Second operand 6 states and 123 transitions. [2024-06-14 16:02:14,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 280 transitions, 4324 flow [2024-06-14 16:02:14,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 280 transitions, 4113 flow, removed 69 selfloop flow, removed 4 redundant places. [2024-06-14 16:02:14,493 INFO L231 Difference]: Finished difference. Result has 202 places, 261 transitions, 3585 flow [2024-06-14 16:02:14,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3489, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3585, PETRI_PLACES=202, PETRI_TRANSITIONS=261} [2024-06-14 16:02:14,493 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 159 predicate places. [2024-06-14 16:02:14,493 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 261 transitions, 3585 flow [2024-06-14 16:02:14,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-14 16:02:14,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:02:14,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:02:14,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 16:02:14,494 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:02:14,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:02:14,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2064304328, now seen corresponding path program 1 times [2024-06-14 16:02:14,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:02:14,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916305791] [2024-06-14 16:02:14,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:02:14,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:02:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:02:26,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:02:26,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:02:26,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916305791] [2024-06-14 16:02:26,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916305791] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:02:26,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:02:26,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:02:26,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362447316] [2024-06-14 16:02:26,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:02:26,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:02:26,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:02:26,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:02:26,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:02:26,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:02:26,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 261 transitions, 3585 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:02:26,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:02:26,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:02:26,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:02:28,144 INFO L124 PetriNetUnfolderBase]: 2581/4162 cut-off events. [2024-06-14 16:02:28,144 INFO L125 PetriNetUnfolderBase]: For 223463/223463 co-relation queries the response was YES. [2024-06-14 16:02:28,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32999 conditions, 4162 events. 2581/4162 cut-off events. For 223463/223463 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 24587 event pairs, 551 based on Foata normal form. 3/4162 useless extension candidates. Maximal degree in co-relation 32899. Up to 3583 conditions per place. [2024-06-14 16:02:28,179 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 197 selfloop transitions, 96 changer transitions 0/298 dead transitions. [2024-06-14 16:02:28,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 298 transitions, 4763 flow [2024-06-14 16:02:28,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:02:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:02:28,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-06-14 16:02:28,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4656084656084656 [2024-06-14 16:02:28,180 INFO L175 Difference]: Start difference. First operand has 202 places, 261 transitions, 3585 flow. Second operand 9 states and 176 transitions. [2024-06-14 16:02:28,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 298 transitions, 4763 flow [2024-06-14 16:02:28,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 298 transitions, 4699 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-14 16:02:28,482 INFO L231 Difference]: Finished difference. Result has 208 places, 271 transitions, 3941 flow [2024-06-14 16:02:28,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3521, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3941, PETRI_PLACES=208, PETRI_TRANSITIONS=271} [2024-06-14 16:02:28,482 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 165 predicate places. [2024-06-14 16:02:28,483 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 271 transitions, 3941 flow [2024-06-14 16:02:28,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:02:28,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:02:28,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:02:28,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 16:02:28,483 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:02:28,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:02:28,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1970352599, now seen corresponding path program 1 times [2024-06-14 16:02:28,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:02:28,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263593773] [2024-06-14 16:02:28,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:02:28,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:02:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:02:39,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:02:39,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:02:39,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263593773] [2024-06-14 16:02:39,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263593773] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:02:39,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:02:39,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:02:39,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178787039] [2024-06-14 16:02:39,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:02:39,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:02:39,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:02:39,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:02:39,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:02:40,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:02:40,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 271 transitions, 3941 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:02:40,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:02:40,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:02:40,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:02:41,646 INFO L124 PetriNetUnfolderBase]: 2699/4321 cut-off events. [2024-06-14 16:02:41,646 INFO L125 PetriNetUnfolderBase]: For 257439/257439 co-relation queries the response was YES. [2024-06-14 16:02:41,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36239 conditions, 4321 events. 2699/4321 cut-off events. For 257439/257439 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 25487 event pairs, 534 based on Foata normal form. 6/4324 useless extension candidates. Maximal degree in co-relation 36137. Up to 3462 conditions per place. [2024-06-14 16:02:41,685 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 198 selfloop transitions, 110 changer transitions 0/313 dead transitions. [2024-06-14 16:02:41,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 313 transitions, 5207 flow [2024-06-14 16:02:41,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:02:41,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:02:41,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2024-06-14 16:02:41,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2024-06-14 16:02:41,686 INFO L175 Difference]: Start difference. First operand has 208 places, 271 transitions, 3941 flow. Second operand 8 states and 161 transitions. [2024-06-14 16:02:41,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 313 transitions, 5207 flow [2024-06-14 16:02:42,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 313 transitions, 4993 flow, removed 53 selfloop flow, removed 5 redundant places. [2024-06-14 16:02:42,069 INFO L231 Difference]: Finished difference. Result has 213 places, 287 transitions, 4364 flow [2024-06-14 16:02:42,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3727, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4364, PETRI_PLACES=213, PETRI_TRANSITIONS=287} [2024-06-14 16:02:42,069 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 170 predicate places. [2024-06-14 16:02:42,069 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 287 transitions, 4364 flow [2024-06-14 16:02:42,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:02:42,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:02:42,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:02:42,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 16:02:42,070 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:02:42,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:02:42,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1966633529, now seen corresponding path program 2 times [2024-06-14 16:02:42,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:02:42,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016119010] [2024-06-14 16:02:42,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:02:42,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:02:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:02:53,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:02:53,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:02:53,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016119010] [2024-06-14 16:02:53,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016119010] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:02:53,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:02:53,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:02:53,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115654105] [2024-06-14 16:02:53,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:02:53,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:02:53,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:02:53,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:02:53,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:02:53,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:02:53,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 287 transitions, 4364 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:02:53,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:02:53,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:02:53,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:02:54,887 INFO L124 PetriNetUnfolderBase]: 2825/4504 cut-off events. [2024-06-14 16:02:54,888 INFO L125 PetriNetUnfolderBase]: For 293249/293249 co-relation queries the response was YES. [2024-06-14 16:02:54,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40105 conditions, 4504 events. 2825/4504 cut-off events. For 293249/293249 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 26727 event pairs, 543 based on Foata normal form. 6/4509 useless extension candidates. Maximal degree in co-relation 39999. Up to 4068 conditions per place. [2024-06-14 16:02:54,930 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 267 selfloop transitions, 51 changer transitions 0/323 dead transitions. [2024-06-14 16:02:54,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 323 transitions, 5619 flow [2024-06-14 16:02:54,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:02:54,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:02:54,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-14 16:02:54,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-14 16:02:54,932 INFO L175 Difference]: Start difference. First operand has 213 places, 287 transitions, 4364 flow. Second operand 9 states and 171 transitions. [2024-06-14 16:02:54,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 323 transitions, 5619 flow [2024-06-14 16:02:55,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 323 transitions, 5476 flow, removed 67 selfloop flow, removed 2 redundant places. [2024-06-14 16:02:55,278 INFO L231 Difference]: Finished difference. Result has 221 places, 298 transitions, 4629 flow [2024-06-14 16:02:55,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4239, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4629, PETRI_PLACES=221, PETRI_TRANSITIONS=298} [2024-06-14 16:02:55,279 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 178 predicate places. [2024-06-14 16:02:55,279 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 298 transitions, 4629 flow [2024-06-14 16:02:55,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:02:55,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:02:55,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:02:55,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 16:02:55,280 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-14 16:02:55,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:02:55,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1966633684, now seen corresponding path program 2 times [2024-06-14 16:02:55,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:02:55,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420479163] [2024-06-14 16:02:55,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:02:55,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:02:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:03:06,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:03:06,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:03:06,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420479163] [2024-06-14 16:03:06,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420479163] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:03:06,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:03:06,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:03:06,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718256860] [2024-06-14 16:03:06,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:03:06,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:03:06,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:03:06,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:03:06,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:03:06,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:03:06,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 298 transitions, 4629 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:03:06,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:03:06,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:03:06,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:03:08,303 INFO L124 PetriNetUnfolderBase]: 2855/4560 cut-off events. [2024-06-14 16:03:08,303 INFO L125 PetriNetUnfolderBase]: For 291959/291959 co-relation queries the response was YES. [2024-06-14 16:03:08,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39896 conditions, 4560 events. 2855/4560 cut-off events. For 291959/291959 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 27125 event pairs, 558 based on Foata normal form. 6/4565 useless extension candidates. Maximal degree in co-relation 39786. Up to 4233 conditions per place. [2024-06-14 16:03:08,344 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 286 selfloop transitions, 47 changer transitions 0/338 dead transitions. [2024-06-14 16:03:08,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 338 transitions, 5697 flow [2024-06-14 16:03:08,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:03:08,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:03:08,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-14 16:03:08,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4417989417989418 [2024-06-14 16:03:08,346 INFO L175 Difference]: Start difference. First operand has 221 places, 298 transitions, 4629 flow. Second operand 9 states and 167 transitions. [2024-06-14 16:03:08,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 338 transitions, 5697 flow [2024-06-14 16:03:08,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 338 transitions, 5571 flow, removed 48 selfloop flow, removed 4 redundant places. [2024-06-14 16:03:08,790 INFO L231 Difference]: Finished difference. Result has 228 places, 318 transitions, 4987 flow [2024-06-14 16:03:08,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4503, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4987, PETRI_PLACES=228, PETRI_TRANSITIONS=318} [2024-06-14 16:03:08,790 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 185 predicate places. [2024-06-14 16:03:08,790 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 318 transitions, 4987 flow [2024-06-14 16:03:08,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:03:08,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:03:08,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:03:08,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 16:03:08,791 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-14 16:03:08,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:03:08,791 INFO L85 PathProgramCache]: Analyzing trace with hash 38889166, now seen corresponding path program 1 times [2024-06-14 16:03:08,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:03:08,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494424245] [2024-06-14 16:03:08,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:03:08,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:03:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:03:19,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:03:19,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:03:19,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494424245] [2024-06-14 16:03:19,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494424245] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:03:19,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:03:19,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:03:19,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772823458] [2024-06-14 16:03:19,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:03:19,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:03:19,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:03:19,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:03:19,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:03:19,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:03:19,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 318 transitions, 4987 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:03:19,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:03:19,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:03:19,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:03:20,870 INFO L124 PetriNetUnfolderBase]: 2852/4556 cut-off events. [2024-06-14 16:03:20,870 INFO L125 PetriNetUnfolderBase]: For 295528/295528 co-relation queries the response was YES. [2024-06-14 16:03:20,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40414 conditions, 4556 events. 2852/4556 cut-off events. For 295528/295528 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 27084 event pairs, 562 based on Foata normal form. 1/4556 useless extension candidates. Maximal degree in co-relation 40300. Up to 4289 conditions per place. [2024-06-14 16:03:20,916 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 299 selfloop transitions, 29 changer transitions 0/333 dead transitions. [2024-06-14 16:03:20,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 333 transitions, 5741 flow [2024-06-14 16:03:20,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 16:03:20,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 16:03:20,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-06-14 16:03:20,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2024-06-14 16:03:20,917 INFO L175 Difference]: Start difference. First operand has 228 places, 318 transitions, 4987 flow. Second operand 5 states and 101 transitions. [2024-06-14 16:03:20,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 333 transitions, 5741 flow [2024-06-14 16:03:21,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 333 transitions, 5573 flow, removed 69 selfloop flow, removed 4 redundant places. [2024-06-14 16:03:21,440 INFO L231 Difference]: Finished difference. Result has 229 places, 321 transitions, 4963 flow [2024-06-14 16:03:21,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4819, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4963, PETRI_PLACES=229, PETRI_TRANSITIONS=321} [2024-06-14 16:03:21,441 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 186 predicate places. [2024-06-14 16:03:21,441 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 321 transitions, 4963 flow [2024-06-14 16:03:21,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:03:21,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:03:21,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:03:21,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 16:03:21,441 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-14 16:03:21,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:03:21,442 INFO L85 PathProgramCache]: Analyzing trace with hash 31270389, now seen corresponding path program 3 times [2024-06-14 16:03:21,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:03:21,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123805154] [2024-06-14 16:03:21,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:03:21,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:03:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:03:31,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:03:31,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:03:31,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123805154] [2024-06-14 16:03:31,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123805154] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:03:31,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:03:31,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:03:31,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327339833] [2024-06-14 16:03:31,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:03:31,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:03:31,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:03:31,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:03:31,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:03:32,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:03:32,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 321 transitions, 4963 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:03:32,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:03:32,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:03:32,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:03:33,794 INFO L124 PetriNetUnfolderBase]: 2954/4716 cut-off events. [2024-06-14 16:03:33,795 INFO L125 PetriNetUnfolderBase]: For 322513/322513 co-relation queries the response was YES. [2024-06-14 16:03:33,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42453 conditions, 4716 events. 2954/4716 cut-off events. For 322513/322513 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 28209 event pairs, 566 based on Foata normal form. 6/4721 useless extension candidates. Maximal degree in co-relation 42337. Up to 4293 conditions per place. [2024-06-14 16:03:33,844 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 300 selfloop transitions, 47 changer transitions 0/352 dead transitions. [2024-06-14 16:03:33,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 352 transitions, 6102 flow [2024-06-14 16:03:33,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:03:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:03:33,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-14 16:03:33,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-14 16:03:33,846 INFO L175 Difference]: Start difference. First operand has 229 places, 321 transitions, 4963 flow. Second operand 8 states and 150 transitions. [2024-06-14 16:03:33,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 352 transitions, 6102 flow [2024-06-14 16:03:34,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 352 transitions, 6024 flow, removed 21 selfloop flow, removed 3 redundant places. [2024-06-14 16:03:34,463 INFO L231 Difference]: Finished difference. Result has 235 places, 329 transitions, 5226 flow [2024-06-14 16:03:34,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4885, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5226, PETRI_PLACES=235, PETRI_TRANSITIONS=329} [2024-06-14 16:03:34,463 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 192 predicate places. [2024-06-14 16:03:34,463 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 329 transitions, 5226 flow [2024-06-14 16:03:34,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:03:34,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:03:34,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:03:34,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 16:03:34,464 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-14 16:03:34,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:03:34,464 INFO L85 PathProgramCache]: Analyzing trace with hash 31264654, now seen corresponding path program 3 times [2024-06-14 16:03:34,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:03:34,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882106994] [2024-06-14 16:03:34,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:03:34,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:03:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:03:45,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:03:45,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:03:45,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882106994] [2024-06-14 16:03:45,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882106994] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:03:45,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:03:45,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:03:45,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112403285] [2024-06-14 16:03:45,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:03:45,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:03:45,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:03:45,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:03:45,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:03:45,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:03:45,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 329 transitions, 5226 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:03:45,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:03:45,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:03:45,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:03:47,766 INFO L124 PetriNetUnfolderBase]: 2991/4770 cut-off events. [2024-06-14 16:03:47,766 INFO L125 PetriNetUnfolderBase]: For 338091/338091 co-relation queries the response was YES. [2024-06-14 16:03:47,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43414 conditions, 4770 events. 2991/4770 cut-off events. For 338091/338091 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 28551 event pairs, 602 based on Foata normal form. 9/4778 useless extension candidates. Maximal degree in co-relation 43296. Up to 4170 conditions per place. [2024-06-14 16:03:47,813 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 271 selfloop transitions, 92 changer transitions 0/368 dead transitions. [2024-06-14 16:03:47,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 368 transitions, 6296 flow [2024-06-14 16:03:47,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:03:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:03:47,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2024-06-14 16:03:47,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5029761904761905 [2024-06-14 16:03:47,814 INFO L175 Difference]: Start difference. First operand has 235 places, 329 transitions, 5226 flow. Second operand 8 states and 169 transitions. [2024-06-14 16:03:47,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 368 transitions, 6296 flow [2024-06-14 16:03:48,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 368 transitions, 6043 flow, removed 61 selfloop flow, removed 6 redundant places. [2024-06-14 16:03:48,347 INFO L231 Difference]: Finished difference. Result has 237 places, 338 transitions, 5395 flow [2024-06-14 16:03:48,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4973, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5395, PETRI_PLACES=237, PETRI_TRANSITIONS=338} [2024-06-14 16:03:48,347 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 194 predicate places. [2024-06-14 16:03:48,348 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 338 transitions, 5395 flow [2024-06-14 16:03:48,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:03:48,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:03:48,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:03:48,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 16:03:48,348 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-14 16:03:48,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:03:48,349 INFO L85 PathProgramCache]: Analyzing trace with hash 31264809, now seen corresponding path program 4 times [2024-06-14 16:03:48,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:03:48,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125662641] [2024-06-14 16:03:48,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:03:48,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:03:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:03:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:03:58,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:03:58,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125662641] [2024-06-14 16:03:58,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125662641] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:03:58,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:03:58,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:03:58,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078721173] [2024-06-14 16:03:58,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:03:58,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:03:58,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:03:58,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:03:58,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:03:59,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:03:59,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 338 transitions, 5395 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:03:59,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:03:59,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:03:59,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:04:00,914 INFO L124 PetriNetUnfolderBase]: 3101/4928 cut-off events. [2024-06-14 16:04:00,914 INFO L125 PetriNetUnfolderBase]: For 365078/365078 co-relation queries the response was YES. [2024-06-14 16:04:00,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46079 conditions, 4928 events. 3101/4928 cut-off events. For 365078/365078 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 29616 event pairs, 601 based on Foata normal form. 6/4933 useless extension candidates. Maximal degree in co-relation 45963. Up to 4182 conditions per place. [2024-06-14 16:04:00,960 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 280 selfloop transitions, 95 changer transitions 0/380 dead transitions. [2024-06-14 16:04:00,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 380 transitions, 6823 flow [2024-06-14 16:04:00,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:04:00,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:04:00,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 166 transitions. [2024-06-14 16:04:00,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49404761904761907 [2024-06-14 16:04:00,961 INFO L175 Difference]: Start difference. First operand has 237 places, 338 transitions, 5395 flow. Second operand 8 states and 166 transitions. [2024-06-14 16:04:00,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 380 transitions, 6823 flow [2024-06-14 16:04:01,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 380 transitions, 6517 flow, removed 72 selfloop flow, removed 6 redundant places. [2024-06-14 16:04:01,512 INFO L231 Difference]: Finished difference. Result has 241 places, 350 transitions, 5664 flow [2024-06-14 16:04:01,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5089, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5664, PETRI_PLACES=241, PETRI_TRANSITIONS=350} [2024-06-14 16:04:01,512 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 198 predicate places. [2024-06-14 16:04:01,512 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 350 transitions, 5664 flow [2024-06-14 16:04:01,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:04:01,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:04:01,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:04:01,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 16:04:01,513 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:04:01,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:04:01,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1036884468, now seen corresponding path program 1 times [2024-06-14 16:04:01,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:04:01,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879454015] [2024-06-14 16:04:01,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:04:01,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:04:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:04:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:04:11,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:04:11,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879454015] [2024-06-14 16:04:11,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879454015] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:04:11,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:04:11,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:04:11,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253446588] [2024-06-14 16:04:11,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:04:11,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:04:11,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:04:11,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:04:11,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:04:11,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:04:11,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 350 transitions, 5664 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:04:11,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:04:11,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:04:11,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:04:13,881 INFO L124 PetriNetUnfolderBase]: 3142/4997 cut-off events. [2024-06-14 16:04:13,881 INFO L125 PetriNetUnfolderBase]: For 381441/381441 co-relation queries the response was YES. [2024-06-14 16:04:13,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47060 conditions, 4997 events. 3142/4997 cut-off events. For 381441/381441 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 30113 event pairs, 523 based on Foata normal form. 12/5005 useless extension candidates. Maximal degree in co-relation 46941. Up to 4565 conditions per place. [2024-06-14 16:04:13,932 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 357 selfloop transitions, 18 changer transitions 0/380 dead transitions. [2024-06-14 16:04:13,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 380 transitions, 6572 flow [2024-06-14 16:04:13,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:04:13,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:04:13,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-14 16:04:13,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-14 16:04:13,934 INFO L175 Difference]: Start difference. First operand has 241 places, 350 transitions, 5664 flow. Second operand 8 states and 150 transitions. [2024-06-14 16:04:13,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 380 transitions, 6572 flow [2024-06-14 16:04:14,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 380 transitions, 6430 flow, removed 66 selfloop flow, removed 2 redundant places. [2024-06-14 16:04:14,490 INFO L231 Difference]: Finished difference. Result has 247 places, 351 transitions, 5620 flow [2024-06-14 16:04:14,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5522, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5620, PETRI_PLACES=247, PETRI_TRANSITIONS=351} [2024-06-14 16:04:14,490 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 204 predicate places. [2024-06-14 16:04:14,490 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 351 transitions, 5620 flow [2024-06-14 16:04:14,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:04:14,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:04:14,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:04:14,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 16:04:14,491 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:04:14,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:04:14,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1763517010, now seen corresponding path program 2 times [2024-06-14 16:04:14,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:04:14,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827237886] [2024-06-14 16:04:14,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:04:14,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:04:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:04:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:04:25,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:04:25,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827237886] [2024-06-14 16:04:25,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827237886] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:04:25,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:04:25,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:04:25,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133125244] [2024-06-14 16:04:25,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:04:25,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:04:25,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:04:25,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:04:25,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:04:25,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:04:25,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 351 transitions, 5620 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:04:25,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:04:25,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:04:25,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:04:27,692 INFO L124 PetriNetUnfolderBase]: 3200/5095 cut-off events. [2024-06-14 16:04:27,692 INFO L125 PetriNetUnfolderBase]: For 392636/392636 co-relation queries the response was YES. [2024-06-14 16:04:27,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47567 conditions, 5095 events. 3200/5095 cut-off events. For 392636/392636 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 30925 event pairs, 672 based on Foata normal form. 12/5103 useless extension candidates. Maximal degree in co-relation 47446. Up to 4589 conditions per place. [2024-06-14 16:04:27,744 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 345 selfloop transitions, 33 changer transitions 0/383 dead transitions. [2024-06-14 16:04:27,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 383 transitions, 6553 flow [2024-06-14 16:04:27,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:04:27,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:04:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-14 16:04:27,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-14 16:04:27,747 INFO L175 Difference]: Start difference. First operand has 247 places, 351 transitions, 5620 flow. Second operand 8 states and 154 transitions. [2024-06-14 16:04:27,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 383 transitions, 6553 flow [2024-06-14 16:04:28,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 383 transitions, 6481 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-14 16:04:28,308 INFO L231 Difference]: Finished difference. Result has 251 places, 355 transitions, 5712 flow [2024-06-14 16:04:28,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5548, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5712, PETRI_PLACES=251, PETRI_TRANSITIONS=355} [2024-06-14 16:04:28,308 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 208 predicate places. [2024-06-14 16:04:28,308 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 355 transitions, 5712 flow [2024-06-14 16:04:28,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:04:28,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:04:28,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:04:28,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 16:04:28,309 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-14 16:04:28,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:04:28,311 INFO L85 PathProgramCache]: Analyzing trace with hash 818721126, now seen corresponding path program 3 times [2024-06-14 16:04:28,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:04:28,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518881210] [2024-06-14 16:04:28,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:04:28,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:04:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:04:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:04:37,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:04:37,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518881210] [2024-06-14 16:04:37,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518881210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:04:37,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:04:37,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 16:04:37,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560747842] [2024-06-14 16:04:37,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:04:37,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 16:04:37,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:04:37,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 16:04:37,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 16:04:37,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:04:37,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 355 transitions, 5712 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:04:37,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:04:37,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:04:37,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:04:39,656 INFO L124 PetriNetUnfolderBase]: 3180/5063 cut-off events. [2024-06-14 16:04:39,656 INFO L125 PetriNetUnfolderBase]: For 391994/391994 co-relation queries the response was YES. [2024-06-14 16:04:39,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46872 conditions, 5063 events. 3180/5063 cut-off events. For 391994/391994 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 30676 event pairs, 653 based on Foata normal form. 12/5071 useless extension candidates. Maximal degree in co-relation 46748. Up to 4424 conditions per place. [2024-06-14 16:04:39,712 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 330 selfloop transitions, 51 changer transitions 0/386 dead transitions. [2024-06-14 16:04:39,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 386 transitions, 6514 flow [2024-06-14 16:04:39,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 16:04:39,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 16:04:39,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-14 16:04:39,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-14 16:04:39,715 INFO L175 Difference]: Start difference. First operand has 251 places, 355 transitions, 5712 flow. Second operand 9 states and 171 transitions. [2024-06-14 16:04:39,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 386 transitions, 6514 flow [2024-06-14 16:04:40,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 386 transitions, 6384 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-14 16:04:40,543 INFO L231 Difference]: Finished difference. Result has 253 places, 354 transitions, 5614 flow [2024-06-14 16:04:40,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5508, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5614, PETRI_PLACES=253, PETRI_TRANSITIONS=354} [2024-06-14 16:04:40,544 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 210 predicate places. [2024-06-14 16:04:40,544 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 354 transitions, 5614 flow [2024-06-14 16:04:40,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:04:40,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:04:40,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:04:40,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 16:04:40,545 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-14 16:04:40,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:04:40,545 INFO L85 PathProgramCache]: Analyzing trace with hash -661838379, now seen corresponding path program 1 times [2024-06-14 16:04:40,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:04:40,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421415939] [2024-06-14 16:04:40,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:04:40,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:04:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:04:51,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:04:51,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:04:51,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421415939] [2024-06-14 16:04:51,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421415939] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:04:51,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:04:51,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:04:51,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596330987] [2024-06-14 16:04:51,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:04:51,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:04:51,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:04:51,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:04:51,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:04:51,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:04:51,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 354 transitions, 5614 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:04:51,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:04:51,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:04:51,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:04:53,397 INFO L124 PetriNetUnfolderBase]: 3190/5085 cut-off events. [2024-06-14 16:04:53,397 INFO L125 PetriNetUnfolderBase]: For 359046/359046 co-relation queries the response was YES. [2024-06-14 16:04:53,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46403 conditions, 5085 events. 3190/5085 cut-off events. For 359046/359046 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 30782 event pairs, 662 based on Foata normal form. 2/5086 useless extension candidates. Maximal degree in co-relation 46280. Up to 4732 conditions per place. [2024-06-14 16:04:53,454 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 335 selfloop transitions, 39 changer transitions 0/379 dead transitions. [2024-06-14 16:04:53,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 379 transitions, 6560 flow [2024-06-14 16:04:53,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:04:53,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:04:53,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-14 16:04:53,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-14 16:04:53,455 INFO L175 Difference]: Start difference. First operand has 253 places, 354 transitions, 5614 flow. Second operand 8 states and 148 transitions. [2024-06-14 16:04:53,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 379 transitions, 6560 flow [2024-06-14 16:04:54,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 379 transitions, 6314 flow, removed 27 selfloop flow, removed 11 redundant places. [2024-06-14 16:04:54,100 INFO L231 Difference]: Finished difference. Result has 250 places, 357 transitions, 5522 flow [2024-06-14 16:04:54,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5368, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5522, PETRI_PLACES=250, PETRI_TRANSITIONS=357} [2024-06-14 16:04:54,100 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 207 predicate places. [2024-06-14 16:04:54,101 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 357 transitions, 5522 flow [2024-06-14 16:04:54,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:04:54,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:04:54,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:04:54,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 16:04:54,101 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-14 16:04:54,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:04:54,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2074920071, now seen corresponding path program 1 times [2024-06-14 16:04:54,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:04:54,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745650915] [2024-06-14 16:04:54,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:04:54,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:04:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:05:05,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:05:05,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:05:05,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745650915] [2024-06-14 16:05:05,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745650915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:05:05,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:05:05,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:05:05,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394804026] [2024-06-14 16:05:05,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:05:05,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:05:05,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:05:05,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:05:05,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:05:05,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:05:05,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 357 transitions, 5522 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:05:05,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:05:05,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:05:05,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:05:07,023 INFO L124 PetriNetUnfolderBase]: 3274/5197 cut-off events. [2024-06-14 16:05:07,023 INFO L125 PetriNetUnfolderBase]: For 386546/386546 co-relation queries the response was YES. [2024-06-14 16:05:07,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47602 conditions, 5197 events. 3274/5197 cut-off events. For 386546/386546 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 31461 event pairs, 671 based on Foata normal form. 4/5200 useless extension candidates. Maximal degree in co-relation 47483. Up to 4762 conditions per place. [2024-06-14 16:05:07,081 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 331 selfloop transitions, 55 changer transitions 0/391 dead transitions. [2024-06-14 16:05:07,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 391 transitions, 6828 flow [2024-06-14 16:05:07,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:05:07,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:05:07,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-14 16:05:07,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-14 16:05:07,083 INFO L175 Difference]: Start difference. First operand has 250 places, 357 transitions, 5522 flow. Second operand 8 states and 154 transitions. [2024-06-14 16:05:07,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 391 transitions, 6828 flow [2024-06-14 16:05:07,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 391 transitions, 6718 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-14 16:05:07,723 INFO L231 Difference]: Finished difference. Result has 253 places, 366 transitions, 5838 flow [2024-06-14 16:05:07,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5412, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5838, PETRI_PLACES=253, PETRI_TRANSITIONS=366} [2024-06-14 16:05:07,723 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 210 predicate places. [2024-06-14 16:05:07,723 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 366 transitions, 5838 flow [2024-06-14 16:05:07,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:05:07,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:05:07,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:05:07,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 16:05:07,724 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-14 16:05:07,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:05:07,724 INFO L85 PathProgramCache]: Analyzing trace with hash -2068253831, now seen corresponding path program 2 times [2024-06-14 16:05:07,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:05:07,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764445005] [2024-06-14 16:05:07,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:05:07,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:05:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:05:17,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-14 16:05:17,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:05:17,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764445005] [2024-06-14 16:05:17,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764445005] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:05:17,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:05:17,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:05:17,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592541212] [2024-06-14 16:05:17,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:05:17,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:05:17,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:05:17,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:05:17,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:05:18,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:05:18,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 366 transitions, 5838 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:05:18,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:05:18,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:05:18,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:05:20,110 INFO L124 PetriNetUnfolderBase]: 3294/5237 cut-off events. [2024-06-14 16:05:20,110 INFO L125 PetriNetUnfolderBase]: For 400351/400351 co-relation queries the response was YES. [2024-06-14 16:05:20,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48421 conditions, 5237 events. 3294/5237 cut-off events. For 400351/400351 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 31850 event pairs, 684 based on Foata normal form. 4/5240 useless extension candidates. Maximal degree in co-relation 48300. Up to 4918 conditions per place. [2024-06-14 16:05:20,161 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 350 selfloop transitions, 32 changer transitions 0/387 dead transitions. [2024-06-14 16:05:20,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 387 transitions, 6782 flow [2024-06-14 16:05:20,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:05:20,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:05:20,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-14 16:05:20,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43154761904761907 [2024-06-14 16:05:20,163 INFO L175 Difference]: Start difference. First operand has 253 places, 366 transitions, 5838 flow. Second operand 8 states and 145 transitions. [2024-06-14 16:05:20,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 387 transitions, 6782 flow [2024-06-14 16:05:20,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 387 transitions, 6621 flow, removed 61 selfloop flow, removed 4 redundant places. [2024-06-14 16:05:20,799 INFO L231 Difference]: Finished difference. Result has 257 places, 369 transitions, 5853 flow [2024-06-14 16:05:20,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5695, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5853, PETRI_PLACES=257, PETRI_TRANSITIONS=369} [2024-06-14 16:05:20,800 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 214 predicate places. [2024-06-14 16:05:20,800 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 369 transitions, 5853 flow [2024-06-14 16:05:20,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:05:20,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:05:20,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:05:20,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 16:05:20,801 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-14 16:05:20,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:05:20,802 INFO L85 PathProgramCache]: Analyzing trace with hash -2068491167, now seen corresponding path program 2 times [2024-06-14 16:05:20,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:05:20,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862108996] [2024-06-14 16:05:20,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:05:20,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:05:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:05:31,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:05:31,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:05:31,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862108996] [2024-06-14 16:05:31,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862108996] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:05:31,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:05:31,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:05:31,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695565759] [2024-06-14 16:05:31,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:05:31,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:05:31,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:05:31,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:05:31,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:05:31,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:05:31,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 369 transitions, 5853 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:05:31,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:05:31,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:05:31,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:05:33,388 INFO L124 PetriNetUnfolderBase]: 3304/5255 cut-off events. [2024-06-14 16:05:33,388 INFO L125 PetriNetUnfolderBase]: For 405204/405204 co-relation queries the response was YES. [2024-06-14 16:05:33,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48534 conditions, 5255 events. 3304/5255 cut-off events. For 405204/405204 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 31999 event pairs, 678 based on Foata normal form. 2/5256 useless extension candidates. Maximal degree in co-relation 48412. Up to 4944 conditions per place. [2024-06-14 16:05:33,438 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 360 selfloop transitions, 25 changer transitions 0/390 dead transitions. [2024-06-14 16:05:33,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 390 transitions, 6791 flow [2024-06-14 16:05:33,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:05:33,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:05:33,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-14 16:05:33,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4255952380952381 [2024-06-14 16:05:33,439 INFO L175 Difference]: Start difference. First operand has 257 places, 369 transitions, 5853 flow. Second operand 8 states and 143 transitions. [2024-06-14 16:05:33,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 390 transitions, 6791 flow [2024-06-14 16:05:34,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 390 transitions, 6626 flow, removed 36 selfloop flow, removed 7 redundant places. [2024-06-14 16:05:34,061 INFO L231 Difference]: Finished difference. Result has 258 places, 372 transitions, 5820 flow [2024-06-14 16:05:34,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5688, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5820, PETRI_PLACES=258, PETRI_TRANSITIONS=372} [2024-06-14 16:05:34,061 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 215 predicate places. [2024-06-14 16:05:34,062 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 372 transitions, 5820 flow [2024-06-14 16:05:34,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:05:34,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:05:34,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:05:34,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 16:05:34,062 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:05:34,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:05:34,063 INFO L85 PathProgramCache]: Analyzing trace with hash -586963313, now seen corresponding path program 3 times [2024-06-14 16:05:34,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:05:34,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753209704] [2024-06-14 16:05:34,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:05:34,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:05:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:05:45,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:05:45,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:05:45,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753209704] [2024-06-14 16:05:45,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753209704] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:05:45,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:05:45,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:05:45,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073822183] [2024-06-14 16:05:45,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:05:45,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:05:45,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:05:45,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:05:45,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:05:45,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:05:45,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 372 transitions, 5820 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:05:45,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:05:45,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:05:45,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:05:47,219 INFO L124 PetriNetUnfolderBase]: 3292/5231 cut-off events. [2024-06-14 16:05:47,219 INFO L125 PetriNetUnfolderBase]: For 412057/412057 co-relation queries the response was YES. [2024-06-14 16:05:47,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48088 conditions, 5231 events. 3292/5231 cut-off events. For 412057/412057 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 31800 event pairs, 675 based on Foata normal form. 4/5234 useless extension candidates. Maximal degree in co-relation 47966. Up to 4894 conditions per place. [2024-06-14 16:05:47,269 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 350 selfloop transitions, 37 changer transitions 0/392 dead transitions. [2024-06-14 16:05:47,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 392 transitions, 6708 flow [2024-06-14 16:05:47,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:05:47,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:05:47,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-14 16:05:47,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44345238095238093 [2024-06-14 16:05:47,271 INFO L175 Difference]: Start difference. First operand has 258 places, 372 transitions, 5820 flow. Second operand 8 states and 149 transitions. [2024-06-14 16:05:47,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 392 transitions, 6708 flow [2024-06-14 16:05:48,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 392 transitions, 6620 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-14 16:05:48,040 INFO L231 Difference]: Finished difference. Result has 260 places, 372 transitions, 5812 flow [2024-06-14 16:05:48,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5732, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5812, PETRI_PLACES=260, PETRI_TRANSITIONS=372} [2024-06-14 16:05:48,041 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 217 predicate places. [2024-06-14 16:05:48,041 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 372 transitions, 5812 flow [2024-06-14 16:05:48,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:05:48,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:05:48,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:05:48,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 16:05:48,042 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:05:48,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:05:48,042 INFO L85 PathProgramCache]: Analyzing trace with hash 747325911, now seen corresponding path program 1 times [2024-06-14 16:05:48,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:05:48,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227156808] [2024-06-14 16:05:48,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:05:48,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:05:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:06:01,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:01,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227156808] [2024-06-14 16:06:01,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227156808] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:01,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:01,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:06:01,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304708482] [2024-06-14 16:06:01,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:01,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:06:01,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:01,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:06:01,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:06:02,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:06:02,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 372 transitions, 5812 flow. Second operand has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:06:02,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:02,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:06:02,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:04,541 INFO L124 PetriNetUnfolderBase]: 3336/5305 cut-off events. [2024-06-14 16:06:04,541 INFO L125 PetriNetUnfolderBase]: For 436949/436949 co-relation queries the response was YES. [2024-06-14 16:06:04,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48768 conditions, 5305 events. 3336/5305 cut-off events. For 436949/436949 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 32334 event pairs, 688 based on Foata normal form. 12/5316 useless extension candidates. Maximal degree in co-relation 48645. Up to 4875 conditions per place. [2024-06-14 16:06:04,598 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 356 selfloop transitions, 39 changer transitions 0/400 dead transitions. [2024-06-14 16:06:04,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 400 transitions, 6830 flow [2024-06-14 16:06:04,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:06:04,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:06:04,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-14 16:06:04,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45535714285714285 [2024-06-14 16:06:04,600 INFO L175 Difference]: Start difference. First operand has 260 places, 372 transitions, 5812 flow. Second operand 8 states and 153 transitions. [2024-06-14 16:06:04,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 400 transitions, 6830 flow [2024-06-14 16:06:05,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 400 transitions, 6698 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-06-14 16:06:05,519 INFO L231 Difference]: Finished difference. Result has 262 places, 373 transitions, 5783 flow [2024-06-14 16:06:05,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5680, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5783, PETRI_PLACES=262, PETRI_TRANSITIONS=373} [2024-06-14 16:06:05,520 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 219 predicate places. [2024-06-14 16:06:05,520 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 373 transitions, 5783 flow [2024-06-14 16:06:05,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:06:05,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:05,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:05,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 16:06:05,520 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:06:05,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:05,521 INFO L85 PathProgramCache]: Analyzing trace with hash -697047995, now seen corresponding path program 3 times [2024-06-14 16:06:05,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:05,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357009835] [2024-06-14 16:06:05,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:05,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:17,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:06:17,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:17,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357009835] [2024-06-14 16:06:17,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357009835] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:17,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:17,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:06:17,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095972956] [2024-06-14 16:06:17,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:17,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:06:17,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:17,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:06:17,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:06:17,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:06:17,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 373 transitions, 5783 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:06:17,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:17,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:06:17,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:19,559 INFO L124 PetriNetUnfolderBase]: 3330/5300 cut-off events. [2024-06-14 16:06:19,559 INFO L125 PetriNetUnfolderBase]: For 426503/426503 co-relation queries the response was YES. [2024-06-14 16:06:19,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48681 conditions, 5300 events. 3330/5300 cut-off events. For 426503/426503 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 32367 event pairs, 689 based on Foata normal form. 2/5299 useless extension candidates. Maximal degree in co-relation 48557. Up to 4723 conditions per place. [2024-06-14 16:06:19,614 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 310 selfloop transitions, 82 changer transitions 0/397 dead transitions. [2024-06-14 16:06:19,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 397 transitions, 6865 flow [2024-06-14 16:06:19,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:06:19,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:06:19,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-14 16:06:19,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-14 16:06:19,615 INFO L175 Difference]: Start difference. First operand has 262 places, 373 transitions, 5783 flow. Second operand 8 states and 152 transitions. [2024-06-14 16:06:19,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 397 transitions, 6865 flow [2024-06-14 16:06:20,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 397 transitions, 6770 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-14 16:06:20,396 INFO L231 Difference]: Finished difference. Result has 264 places, 373 transitions, 5858 flow [2024-06-14 16:06:20,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5688, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5858, PETRI_PLACES=264, PETRI_TRANSITIONS=373} [2024-06-14 16:06:20,397 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 221 predicate places. [2024-06-14 16:06:20,397 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 373 transitions, 5858 flow [2024-06-14 16:06:20,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:06:20,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:20,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:20,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-14 16:06:20,397 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-14 16:06:20,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:20,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1220162277, now seen corresponding path program 4 times [2024-06-14 16:06:20,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:20,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380340938] [2024-06-14 16:06:20,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:20,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 16:06:32,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 16:06:32,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 16:06:32,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380340938] [2024-06-14 16:06:32,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380340938] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 16:06:32,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 16:06:32,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 16:06:32,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137854462] [2024-06-14 16:06:32,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 16:06:32,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 16:06:32,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 16:06:32,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 16:06:32,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 16:06:32,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-14 16:06:32,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 373 transitions, 5858 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:06:32,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 16:06:32,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-14 16:06:32,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 16:06:34,257 INFO L124 PetriNetUnfolderBase]: 3338/5318 cut-off events. [2024-06-14 16:06:34,257 INFO L125 PetriNetUnfolderBase]: For 447051/447051 co-relation queries the response was YES. [2024-06-14 16:06:34,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48893 conditions, 5318 events. 3338/5318 cut-off events. For 447051/447051 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 32526 event pairs, 629 based on Foata normal form. 8/5323 useless extension candidates. Maximal degree in co-relation 48768. Up to 4035 conditions per place. [2024-06-14 16:06:34,324 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 242 selfloop transitions, 155 changer transitions 0/402 dead transitions. [2024-06-14 16:06:34,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 402 transitions, 7177 flow [2024-06-14 16:06:34,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 16:06:34,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 16:06:34,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2024-06-14 16:06:34,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-14 16:06:34,325 INFO L175 Difference]: Start difference. First operand has 264 places, 373 transitions, 5858 flow. Second operand 8 states and 160 transitions. [2024-06-14 16:06:34,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 402 transitions, 7177 flow [2024-06-14 16:06:35,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 402 transitions, 6981 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-14 16:06:35,185 INFO L231 Difference]: Finished difference. Result has 266 places, 376 transitions, 6070 flow [2024-06-14 16:06:35,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5662, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6070, PETRI_PLACES=266, PETRI_TRANSITIONS=376} [2024-06-14 16:06:35,186 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 223 predicate places. [2024-06-14 16:06:35,186 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 376 transitions, 6070 flow [2024-06-14 16:06:35,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 16:06:35,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 16:06:35,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 16:06:35,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-14 16:06:35,186 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 16:06:35,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 16:06:35,186 INFO L85 PathProgramCache]: Analyzing trace with hash -428287295, now seen corresponding path program 4 times [2024-06-14 16:06:35,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 16:06:35,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952827486] [2024-06-14 16:06:35,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 16:06:35,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 16:06:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15