./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe032_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/safe032_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 76401ed0
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe032_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-76401ed-m
[2024-06-20 20:00:33,568 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-20 20:00:33,604 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-20 20:00:33,607 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-20 20:00:33,608 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-20 20:00:33,656 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-20 20:00:33,656 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-20 20:00:33,657 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-20 20:00:33,657 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-20 20:00:33,661 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-20 20:00:33,661 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-20 20:00:33,661 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-20 20:00:33,662 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-20 20:00:33,663 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-20 20:00:33,663 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-20 20:00:33,663 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-20 20:00:33,663 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-20 20:00:33,663 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-20 20:00:33,663 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-20 20:00:33,663 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-20 20:00:33,664 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-20 20:00:33,664 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-20 20:00:33,664 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-20 20:00:33,664 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-20 20:00:33,664 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-20 20:00:33,665 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-20 20:00:33,665 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-20 20:00:33,665 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-20 20:00:33,665 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-20 20:00:33,666 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-20 20:00:33,666 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-20 20:00:33,666 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-20 20:00:33,667 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 20:00:33,667 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-20 20:00:33,667 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-20 20:00:33,667 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-20 20:00:33,667 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-20 20:00:33,667 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-20 20:00:33,667 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-20 20:00:33,667 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-20 20:00:33,668 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-20 20:00:33,668 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-20 20:00:33,668 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-20 20:00:33,668 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-20 20:00:33,926 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-20 20:00:33,954 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-20 20:00:33,956 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-20 20:00:33,957 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-20 20:00:33,958 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-20 20:00:33,959 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-20 20:00:34,957 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-20 20:00:35,218 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-20 20:00:35,220 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-20 20:00:35,236 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0828c8be5/b9a6d288f12c42658a2f210290616fc9/FLAG2f9cfba90
[2024-06-20 20:00:35,247 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0828c8be5/b9a6d288f12c42658a2f210290616fc9
[2024-06-20 20:00:35,249 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-20 20:00:35,250 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-20 20:00:35,252 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml
[2024-06-20 20:00:35,424 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-20 20:00:35,425 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-20 20:00:35,427 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-20 20:00:35,427 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-20 20:00:35,431 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-20 20:00:35,432 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 08:00:35" (1/2) ...
[2024-06-20 20:00:35,432 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628f9f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 08:00:35, skipping insertion in model container
[2024-06-20 20:00:35,433 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 08:00:35" (1/2) ...
[2024-06-20 20:00:35,434 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@37543a5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 08:00:35, skipping insertion in model container
[2024-06-20 20:00:35,434 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 08:00:35" (2/2) ...
[2024-06-20 20:00:35,434 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628f9f32 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 08:00:35, skipping insertion in model container
[2024-06-20 20:00:35,435 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 08:00:35" (2/2) ...
[2024-06-20 20:00:35,435 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-20 20:00:35,518 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-20 20:00:35,520 INFO  L97    edCorrectnessWitness]: Location invariant before [L852-L852] (((((((((((((((((! multithreaded || x$read_delayed == (_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_thd2) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (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_thd2) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (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_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )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_p1_EAX >= 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_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )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_p1_EAX) - (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_p1_EAX) - (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_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (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_thd2 >= 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_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd2) - (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_thd2 >= 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$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_thd2) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (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_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_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_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$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_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$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_thd2 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_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_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$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_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd2 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd2 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || (0 <= __unbuffered_p0_EAX && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed_var == 0)
[2024-06-20 20:00:35,520 INFO  L97    edCorrectnessWitness]: Location invariant before [L854-L854] (((((((((((((((((! multithreaded || x$read_delayed == (_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_thd2) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (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_thd2) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (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_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )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_p1_EAX >= 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_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )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_p1_EAX) - (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_p1_EAX) - (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_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (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_thd2 >= 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_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd2) - (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_thd2 >= 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$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_thd2) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (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_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_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_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$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_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$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_thd2 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_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_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$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_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd2 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd2 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || (0 <= __unbuffered_p0_EAX && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed_var == 0)
[2024-06-20 20:00:35,521 INFO  L97    edCorrectnessWitness]: Location invariant before [L855-L855] (((((((((((((((((! multithreaded || x$read_delayed == (_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_thd2) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (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_thd2) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (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_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )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_p1_EAX >= 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_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )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_p1_EAX) - (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_p1_EAX) - (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_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (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_thd2 >= 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_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd2) - (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_thd2 >= 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$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_thd2) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (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_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_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_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$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_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$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_thd2 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_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_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$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_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd2 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd2 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || (0 <= __unbuffered_p0_EAX && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed_var == 0)
[2024-06-20 20:00:35,521 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-20 20:00:35,521 INFO  L106   edCorrectnessWitness]: ghost_update [L850-L850] multithreaded = 1;
[2024-06-20 20:00:35,557 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-20 20:00:35,817 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 20:00:35,834 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-20 20:00:36,183 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 20:00:36,262 INFO  L206         MainTranslator]: Completed translation
[2024-06-20 20:00:36,262 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 08:00:36 WrapperNode
[2024-06-20 20:00:36,262 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-20 20:00:36,263 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-20 20:00:36,263 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-20 20:00:36,263 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-20 20:00:36,274 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 08:00:36" (1/1) ...
[2024-06-20 20:00:36,360 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 08:00:36" (1/1) ...
[2024-06-20 20:00:36,462 INFO  L138                Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 143
[2024-06-20 20:00:36,462 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-20 20:00:36,463 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-20 20:00:36,464 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-20 20:00:36,464 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-20 20:00:36,472 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 08:00:36" (1/1) ...
[2024-06-20 20:00:36,473 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 08:00:36" (1/1) ...
[2024-06-20 20:00:36,504 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 08:00:36" (1/1) ...
[2024-06-20 20:00:36,544 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-20 20:00:36,545 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 08:00:36" (1/1) ...
[2024-06-20 20:00:36,545 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 08:00:36" (1/1) ...
[2024-06-20 20:00:36,571 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 08:00:36" (1/1) ...
[2024-06-20 20:00:36,573 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 08:00:36" (1/1) ...
[2024-06-20 20:00:36,582 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 08:00:36" (1/1) ...
[2024-06-20 20:00:36,586 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 08:00:36" (1/1) ...
[2024-06-20 20:00:36,599 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-20 20:00:36,600 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-20 20:00:36,600 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-20 20:00:36,600 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-20 20:00:36,601 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 08:00:36" (1/1) ...
[2024-06-20 20:00:36,605 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 20:00:36,611 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-20 20:00:36,625 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-20 20:00:36,645 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-20 20:00:36,673 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-20 20:00:36,673 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-20 20:00:36,673 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-20 20:00:36,674 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-20 20:00:36,674 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-20 20:00:36,674 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-20 20:00:36,674 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-20 20:00:36,674 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-20 20:00:36,674 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-20 20:00:36,674 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-20 20:00:36,674 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-20 20:00:36,675 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-20 20:00:36,676 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-20 20:00:36,776 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-20 20:00:36,778 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-20 20:00:37,959 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-20 20:00:37,960 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-20 20:00:38,302 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-20 20:00:38,302 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-20 20:00:38,303 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 08:00:38 BoogieIcfgContainer
[2024-06-20 20:00:38,303 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-20 20:00:38,305 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-20 20:00:38,305 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-20 20:00:38,307 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-20 20:00:38,307 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 08:00:35" (1/4) ...
[2024-06-20 20:00:38,308 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5882f225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 08:00:38, skipping insertion in model container
[2024-06-20 20:00:38,308 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 08:00:35" (2/4) ...
[2024-06-20 20:00:38,309 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5882f225 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 08:00:38, skipping insertion in model container
[2024-06-20 20:00:38,309 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 08:00:36" (3/4) ...
[2024-06-20 20:00:38,309 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5882f225 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 08:00:38, skipping insertion in model container
[2024-06-20 20:00:38,309 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 08:00:38" (4/4) ...
[2024-06-20 20:00:38,310 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-20 20:00:38,323 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-20 20:00:38,323 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-20 20:00:38,323 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-20 20:00:38,431 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-20 20:00:38,461 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow
[2024-06-20 20:00:38,511 INFO  L124   PetriNetUnfolderBase]: 0/39 cut-off events.
[2024-06-20 20:00:38,511 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 20:00:38,514 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 71 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-20 20:00:38,514 INFO  L82        GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow
[2024-06-20 20:00:38,517 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow
[2024-06-20 20:00:38,530 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-20 20:00:38,537 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;@467eb7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-20 20:00:38,537 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-20 20:00:38,545 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-20 20:00:38,545 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-20 20:00:38,545 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 20:00:38,545 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:00:38,546 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2024-06-20 20:00:38,546 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:00:38,553 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:00:38,553 INFO  L85        PathProgramCache]: Analyzing trace with hash 443717112, now seen corresponding path program 1 times
[2024-06-20 20:00:38,560 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:00:38,560 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525522967]
[2024-06-20 20:00:38,561 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:00:38,561 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:00:38,836 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:00:43,198 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:00:43,198 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:00:43,199 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525522967]
[2024-06-20 20:00:43,199 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525522967] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:00:43,199 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:00:43,200 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-20 20:00:43,201 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259343442]
[2024-06-20 20:00:43,201 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:00:43,208 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-20 20:00:43,212 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:00:43,234 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-20 20:00:43,235 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-20 20:00:43,289 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 20:00:43,293 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand  has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:43,293 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:00:43,293 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 20:00:43,295 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:00:44,203 INFO  L124   PetriNetUnfolderBase]: 1602/2410 cut-off events.
[2024-06-20 20:00:44,203 INFO  L125   PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES.
[2024-06-20 20:00:44,210 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4887 conditions, 2410 events. 1602/2410 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11695 event pairs, 1117 based on Foata normal form. 1/2370 useless extension candidates. Maximal degree in co-relation 4875. Up to 2382 conditions per place. 
[2024-06-20 20:00:44,219 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 33 selfloop transitions, 4 changer transitions 0/43 dead transitions.
[2024-06-20 20:00:44,219 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 175 flow
[2024-06-20 20:00:44,221 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-20 20:00:44,222 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-20 20:00:44,227 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions.
[2024-06-20 20:00:44,229 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5793650793650794
[2024-06-20 20:00:44,230 INFO  L175             Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 73 transitions.
[2024-06-20 20:00:44,230 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 175 flow
[2024-06-20 20:00:44,232 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-20 20:00:44,235 INFO  L231             Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow
[2024-06-20 20:00:44,236 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-20 20:00:44,239 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places.
[2024-06-20 20:00:44,239 INFO  L495      AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow
[2024-06-20 20:00:44,239 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:44,239 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:00:44,239 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:00:44,240 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-20 20:00:44,240 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:00:44,241 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:00:44,241 INFO  L85        PathProgramCache]: Analyzing trace with hash 1210425239, now seen corresponding path program 1 times
[2024-06-20 20:00:44,241 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:00:44,242 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290754804]
[2024-06-20 20:00:44,242 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:00:44,242 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:00:44,350 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:00:47,547 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:00:47,547 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:00:47,547 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290754804]
[2024-06-20 20:00:47,548 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290754804] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:00:47,548 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:00:47,548 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-20 20:00:47,548 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5502669]
[2024-06-20 20:00:47,549 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:00:47,550 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-20 20:00:47,550 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:00:47,551 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-20 20:00:47,551 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-20 20:00:47,632 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 20:00:47,632 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.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:47,632 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:00:47,632 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 20:00:47,632 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:00:48,380 INFO  L124   PetriNetUnfolderBase]: 1596/2401 cut-off events.
[2024-06-20 20:00:48,380 INFO  L125   PetriNetUnfolderBase]: For 469/469 co-relation queries the response was YES.
[2024-06-20 20:00:48,384 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5492 conditions, 2401 events. 1596/2401 cut-off events. For 469/469 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11672 event pairs, 949 based on Foata normal form. 3/2402 useless extension candidates. Maximal degree in co-relation 5480. Up to 2358 conditions per place. 
[2024-06-20 20:00:48,391 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 40 selfloop transitions, 7 changer transitions 0/53 dead transitions.
[2024-06-20 20:00:48,392 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 242 flow
[2024-06-20 20:00:48,428 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-20 20:00:48,428 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-20 20:00:48,429 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions.
[2024-06-20 20:00:48,429 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5595238095238095
[2024-06-20 20:00:48,429 INFO  L175             Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 94 transitions.
[2024-06-20 20:00:48,429 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 242 flow
[2024-06-20 20:00:48,430 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-20 20:00:48,431 INFO  L231             Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow
[2024-06-20 20:00:48,431 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=46, PETRI_TRANSITIONS=39}
[2024-06-20 20:00:48,432 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places.
[2024-06-20 20:00:48,432 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow
[2024-06-20 20:00:48,432 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:48,432 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:00:48,432 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:00:48,432 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-20 20:00:48,433 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:00:48,433 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:00:48,433 INFO  L85        PathProgramCache]: Analyzing trace with hash -717437642, now seen corresponding path program 1 times
[2024-06-20 20:00:48,433 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:00:48,433 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205122668]
[2024-06-20 20:00:48,434 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:00:48,434 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:00:48,607 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:00:52,910 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:00:52,911 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:00:52,911 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205122668]
[2024-06-20 20:00:52,911 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205122668] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:00:52,911 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:00:52,911 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-20 20:00:52,912 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225130033]
[2024-06-20 20:00:52,912 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:00:52,912 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-20 20:00:52,913 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:00:52,913 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-20 20:00:52,913 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-20 20:00:53,020 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 20:00:53,020 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 138 flow. Second operand  has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:53,020 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:00:53,020 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 20:00:53,020 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:00:53,934 INFO  L124   PetriNetUnfolderBase]: 1590/2392 cut-off events.
[2024-06-20 20:00:53,934 INFO  L125   PetriNetUnfolderBase]: For 1331/1331 co-relation queries the response was YES.
[2024-06-20 20:00:53,938 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6080 conditions, 2392 events. 1590/2392 cut-off events. For 1331/1331 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11679 event pairs, 781 based on Foata normal form. 3/2393 useless extension candidates. Maximal degree in co-relation 6066. Up to 2334 conditions per place. 
[2024-06-20 20:00:53,945 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 47 selfloop transitions, 10 changer transitions 0/63 dead transitions.
[2024-06-20 20:00:53,945 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 63 transitions, 320 flow
[2024-06-20 20:00:53,946 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 20:00:53,946 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 20:00:53,949 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions.
[2024-06-20 20:00:53,951 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5476190476190477
[2024-06-20 20:00:53,951 INFO  L175             Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 5 states and 115 transitions.
[2024-06-20 20:00:53,951 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 63 transitions, 320 flow
[2024-06-20 20:00:53,954 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 63 transitions, 306 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-20 20:00:53,955 INFO  L231             Difference]: Finished difference. Result has 49 places, 42 transitions, 174 flow
[2024-06-20 20:00:53,955 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=42}
[2024-06-20 20:00:53,956 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places.
[2024-06-20 20:00:53,956 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 174 flow
[2024-06-20 20:00:53,956 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:00:53,956 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:00:53,956 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:00:53,957 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-20 20:00:53,957 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-20 20:00:53,957 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:00:53,957 INFO  L85        PathProgramCache]: Analyzing trace with hash -1573673233, now seen corresponding path program 1 times
[2024-06-20 20:00:53,958 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:00:53,958 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938965856]
[2024-06-20 20:00:53,958 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:00:53,958 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:00:54,009 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:00,006 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:01:00,006 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:00,006 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938965856]
[2024-06-20 20:01:00,006 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938965856] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:00,006 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:00,007 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 20:01:00,007 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130010556]
[2024-06-20 20:01:00,007 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:00,007 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 20:01:00,007 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:00,008 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 20:01:00,008 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-20 20:01:00,090 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:01:00,091 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 174 flow. Second operand  has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:00,091 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:00,091 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:01:00,091 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:01,035 INFO  L124   PetriNetUnfolderBase]: 1580/2378 cut-off events.
[2024-06-20 20:01:01,035 INFO  L125   PetriNetUnfolderBase]: For 2378/2378 co-relation queries the response was YES.
[2024-06-20 20:01:01,038 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6636 conditions, 2378 events. 1580/2378 cut-off events. For 2378/2378 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11419 event pairs, 745 based on Foata normal form. 4/2380 useless extension candidates. Maximal degree in co-relation 6620. Up to 2332 conditions per place. 
[2024-06-20 20:01:01,046 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 43 selfloop transitions, 10 changer transitions 0/58 dead transitions.
[2024-06-20 20:01:01,046 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 332 flow
[2024-06-20 20:01:01,046 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 20:01:01,046 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 20:01:01,048 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions.
[2024-06-20 20:01:01,048 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4087301587301587
[2024-06-20 20:01:01,048 INFO  L175             Difference]: Start difference. First operand has 49 places, 42 transitions, 174 flow. Second operand 6 states and 103 transitions.
[2024-06-20 20:01:01,048 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 332 flow
[2024-06-20 20:01:01,051 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 306 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-20 20:01:01,052 INFO  L231             Difference]: Finished difference. Result has 53 places, 47 transitions, 211 flow
[2024-06-20 20:01:01,052 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=211, PETRI_PLACES=53, PETRI_TRANSITIONS=47}
[2024-06-20 20:01:01,053 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places.
[2024-06-20 20:01:01,054 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 211 flow
[2024-06-20 20:01:01,054 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:01,054 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:01,054 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:01:01,054 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-20 20:01:01,054 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:01:01,055 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:01,055 INFO  L85        PathProgramCache]: Analyzing trace with hash 2032207573, now seen corresponding path program 1 times
[2024-06-20 20:01:01,055 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:01,055 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874310889]
[2024-06-20 20:01:01,055 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:01,055 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:01,117 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:05,117 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:01:05,118 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:05,118 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874310889]
[2024-06-20 20:01:05,118 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874310889] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:05,118 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:05,118 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 20:01:05,118 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257796647]
[2024-06-20 20:01:05,118 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:05,118 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 20:01:05,119 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:05,119 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 20:01:05,119 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-20 20:01:05,214 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 20:01:05,215 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 211 flow. Second operand  has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:05,215 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:05,218 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 20:01:05,218 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:06,291 INFO  L124   PetriNetUnfolderBase]: 1571/2363 cut-off events.
[2024-06-20 20:01:06,291 INFO  L125   PetriNetUnfolderBase]: For 3623/3623 co-relation queries the response was YES.
[2024-06-20 20:01:06,294 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7137 conditions, 2363 events. 1571/2363 cut-off events. For 3623/3623 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11541 event pairs, 568 based on Foata normal form. 6/2367 useless extension candidates. Maximal degree in co-relation 7119. Up to 2275 conditions per place. 
[2024-06-20 20:01:06,302 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 54 selfloop transitions, 13 changer transitions 0/73 dead transitions.
[2024-06-20 20:01:06,302 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 73 transitions, 423 flow
[2024-06-20 20:01:06,304 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 20:01:06,304 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 20:01:06,305 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions.
[2024-06-20 20:01:06,305 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5238095238095238
[2024-06-20 20:01:06,305 INFO  L175             Difference]: Start difference. First operand has 53 places, 47 transitions, 211 flow. Second operand 6 states and 132 transitions.
[2024-06-20 20:01:06,305 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 73 transitions, 423 flow
[2024-06-20 20:01:06,307 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 73 transitions, 401 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-20 20:01:06,308 INFO  L231             Difference]: Finished difference. Result has 55 places, 48 transitions, 236 flow
[2024-06-20 20:01:06,308 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=55, PETRI_TRANSITIONS=48}
[2024-06-20 20:01:06,309 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places.
[2024-06-20 20:01:06,309 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 236 flow
[2024-06-20 20:01:06,309 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:06,309 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:06,309 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:01:06,309 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-20 20:01:06,310 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:01:06,310 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:06,310 INFO  L85        PathProgramCache]: Analyzing trace with hash 27650208, now seen corresponding path program 1 times
[2024-06-20 20:01:06,310 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:06,310 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095218419]
[2024-06-20 20:01:06,311 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:06,311 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:06,340 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:14,830 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:01:14,831 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:14,831 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095218419]
[2024-06-20 20:01:14,831 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095218419] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:14,831 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:14,831 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 20:01:14,832 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69877157]
[2024-06-20 20:01:14,832 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:14,832 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 20:01:14,833 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:14,833 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 20:01:14,833 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-20 20:01:14,904 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:01:14,905 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 236 flow. Second operand  has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:14,905 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:14,905 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:01:14,905 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:15,972 INFO  L124   PetriNetUnfolderBase]: 1593/2407 cut-off events.
[2024-06-20 20:01:15,972 INFO  L125   PetriNetUnfolderBase]: For 5450/5453 co-relation queries the response was YES.
[2024-06-20 20:01:15,975 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7665 conditions, 2407 events. 1593/2407 cut-off events. For 5450/5453 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11873 event pairs, 672 based on Foata normal form. 6/2409 useless extension candidates. Maximal degree in co-relation 7646. Up to 2287 conditions per place. 
[2024-06-20 20:01:15,983 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 54 selfloop transitions, 17 changer transitions 0/76 dead transitions.
[2024-06-20 20:01:15,984 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 76 transitions, 494 flow
[2024-06-20 20:01:15,984 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 20:01:15,984 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 20:01:15,985 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions.
[2024-06-20 20:01:15,985 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-20 20:01:15,985 INFO  L175             Difference]: Start difference. First operand has 55 places, 48 transitions, 236 flow. Second operand 6 states and 117 transitions.
[2024-06-20 20:01:15,985 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 76 transitions, 494 flow
[2024-06-20 20:01:15,987 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 76 transitions, 457 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-06-20 20:01:15,988 INFO  L231             Difference]: Finished difference. Result has 57 places, 54 transitions, 287 flow
[2024-06-20 20:01:15,988 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=287, PETRI_PLACES=57, PETRI_TRANSITIONS=54}
[2024-06-20 20:01:15,989 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places.
[2024-06-20 20:01:15,989 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 287 flow
[2024-06-20 20:01:15,989 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:15,989 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:15,989 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:01:15,990 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-20 20:01:15,990 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:01:15,990 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:15,990 INFO  L85        PathProgramCache]: Analyzing trace with hash -455083810, now seen corresponding path program 2 times
[2024-06-20 20:01:15,990 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:15,990 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698061206]
[2024-06-20 20:01:15,991 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:15,991 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:16,016 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:25,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-20 20:01:25,016 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:25,018 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698061206]
[2024-06-20 20:01:25,018 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698061206] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:25,018 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:25,018 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 20:01:25,018 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874082969]
[2024-06-20 20:01:25,018 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:25,019 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 20:01:25,019 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:25,020 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 20:01:25,020 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 20:01:25,124 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:01:25,125 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 287 flow. Second operand  has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:25,125 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:25,125 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:01:25,125 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:26,158 INFO  L124   PetriNetUnfolderBase]: 1583/2391 cut-off events.
[2024-06-20 20:01:26,159 INFO  L125   PetriNetUnfolderBase]: For 7338/7338 co-relation queries the response was YES.
[2024-06-20 20:01:26,162 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8139 conditions, 2391 events. 1583/2391 cut-off events. For 7338/7338 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11739 event pairs, 664 based on Foata normal form. 4/2393 useless extension candidates. Maximal degree in co-relation 8118. Up to 2279 conditions per place. 
[2024-06-20 20:01:26,170 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 59 selfloop transitions, 18 changer transitions 0/82 dead transitions.
[2024-06-20 20:01:26,170 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 82 transitions, 513 flow
[2024-06-20 20:01:26,170 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:01:26,170 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:01:26,171 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions.
[2024-06-20 20:01:26,171 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43154761904761907
[2024-06-20 20:01:26,171 INFO  L175             Difference]: Start difference. First operand has 57 places, 54 transitions, 287 flow. Second operand 8 states and 145 transitions.
[2024-06-20 20:01:26,171 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 82 transitions, 513 flow
[2024-06-20 20:01:26,174 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 82 transitions, 480 flow, removed 12 selfloop flow, removed 2 redundant places.
[2024-06-20 20:01:26,175 INFO  L231             Difference]: Finished difference. Result has 63 places, 54 transitions, 298 flow
[2024-06-20 20:01:26,176 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=298, PETRI_PLACES=63, PETRI_TRANSITIONS=54}
[2024-06-20 20:01:26,176 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places.
[2024-06-20 20:01:26,176 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 298 flow
[2024-06-20 20:01:26,177 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:26,177 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:26,177 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:01:26,177 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-20 20:01:26,177 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:01:26,177 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:26,177 INFO  L85        PathProgramCache]: Analyzing trace with hash -471450322, now seen corresponding path program 1 times
[2024-06-20 20:01:26,178 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:26,178 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053464580]
[2024-06-20 20:01:26,178 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:26,178 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:26,228 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:35,421 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:01:35,422 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:35,422 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053464580]
[2024-06-20 20:01:35,422 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053464580] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:35,422 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:35,422 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 20:01:35,422 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612188634]
[2024-06-20 20:01:35,422 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:35,423 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 20:01:35,423 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:35,423 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 20:01:35,423 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 20:01:35,528 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:01:35,529 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 298 flow. Second operand  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:35,529 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:35,529 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:01:35,529 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:36,453 INFO  L124   PetriNetUnfolderBase]: 1573/2377 cut-off events.
[2024-06-20 20:01:36,453 INFO  L125   PetriNetUnfolderBase]: For 8849/8849 co-relation queries the response was YES.
[2024-06-20 20:01:36,457 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8342 conditions, 2377 events. 1573/2377 cut-off events. For 8849/8849 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11689 event pairs, 643 based on Foata normal form. 4/2379 useless extension candidates. Maximal degree in co-relation 8319. Up to 2303 conditions per place. 
[2024-06-20 20:01:36,465 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 56 selfloop transitions, 12 changer transitions 0/73 dead transitions.
[2024-06-20 20:01:36,465 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 73 transitions, 496 flow
[2024-06-20 20:01:36,466 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 20:01:36,466 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 20:01:36,467 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions.
[2024-06-20 20:01:36,467 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43253968253968256
[2024-06-20 20:01:36,467 INFO  L175             Difference]: Start difference. First operand has 63 places, 54 transitions, 298 flow. Second operand 6 states and 109 transitions.
[2024-06-20 20:01:36,467 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 73 transitions, 496 flow
[2024-06-20 20:01:36,471 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 73 transitions, 451 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-06-20 20:01:36,472 INFO  L231             Difference]: Finished difference. Result has 62 places, 57 transitions, 313 flow
[2024-06-20 20:01:36,472 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=313, PETRI_PLACES=62, PETRI_TRANSITIONS=57}
[2024-06-20 20:01:36,473 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places.
[2024-06-20 20:01:36,473 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 313 flow
[2024-06-20 20:01:36,473 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:36,473 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:36,473 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:01:36,473 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-20 20:01:36,474 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:01:36,474 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:36,474 INFO  L85        PathProgramCache]: Analyzing trace with hash 231620195, now seen corresponding path program 1 times
[2024-06-20 20:01:36,474 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:36,474 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768983018]
[2024-06-20 20:01:36,474 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:36,475 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:36,512 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:44,981 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:01:44,981 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:44,981 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768983018]
[2024-06-20 20:01:44,981 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768983018] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:44,981 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:44,982 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 20:01:44,982 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971595244]
[2024-06-20 20:01:44,982 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:44,982 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 20:01:44,982 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:44,982 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 20:01:44,982 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-20 20:01:45,080 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:01:45,081 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 313 flow. Second operand  has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:45,081 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:45,081 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:01:45,081 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:45,899 INFO  L124   PetriNetUnfolderBase]: 1570/2373 cut-off events.
[2024-06-20 20:01:45,900 INFO  L125   PetriNetUnfolderBase]: For 10140/10140 co-relation queries the response was YES.
[2024-06-20 20:01:45,903 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8800 conditions, 2373 events. 1570/2373 cut-off events. For 10140/10140 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11549 event pairs, 683 based on Foata normal form. 1/2372 useless extension candidates. Maximal degree in co-relation 8776. Up to 2332 conditions per place. 
[2024-06-20 20:01:45,911 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 53 selfloop transitions, 9 changer transitions 0/67 dead transitions.
[2024-06-20 20:01:45,912 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 67 transitions, 475 flow
[2024-06-20 20:01:45,912 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 20:01:45,912 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 20:01:45,912 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions.
[2024-06-20 20:01:45,913 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4142857142857143
[2024-06-20 20:01:45,913 INFO  L175             Difference]: Start difference. First operand has 62 places, 57 transitions, 313 flow. Second operand 5 states and 87 transitions.
[2024-06-20 20:01:45,913 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 67 transitions, 475 flow
[2024-06-20 20:01:45,917 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 67 transitions, 439 flow, removed 8 selfloop flow, removed 4 redundant places.
[2024-06-20 20:01:45,918 INFO  L231             Difference]: Finished difference. Result has 63 places, 60 transitions, 327 flow
[2024-06-20 20:01:45,918 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=327, PETRI_PLACES=63, PETRI_TRANSITIONS=60}
[2024-06-20 20:01:45,919 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places.
[2024-06-20 20:01:45,919 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 327 flow
[2024-06-20 20:01:45,919 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:45,919 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:45,919 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:01:45,919 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-20 20:01:45,920 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:01:45,920 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:45,920 INFO  L85        PathProgramCache]: Analyzing trace with hash 797315967, now seen corresponding path program 1 times
[2024-06-20 20:01:45,920 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:45,920 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977030533]
[2024-06-20 20:01:45,921 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:45,921 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:45,981 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:54,456 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:01:54,457 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:54,457 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977030533]
[2024-06-20 20:01:54,457 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977030533] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:54,457 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:54,457 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:01:54,457 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548369697]
[2024-06-20 20:01:54,458 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:54,458 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:01:54,460 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:54,460 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:01:54,461 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:01:54,613 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:01:54,613 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 327 flow. Second operand  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:54,614 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:54,614 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:01:54,614 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:55,697 INFO  L124   PetriNetUnfolderBase]: 1592/2415 cut-off events.
[2024-06-20 20:01:55,697 INFO  L125   PetriNetUnfolderBase]: For 12286/12286 co-relation queries the response was YES.
[2024-06-20 20:01:55,701 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9350 conditions, 2415 events. 1592/2415 cut-off events. For 12286/12286 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11830 event pairs, 670 based on Foata normal form. 4/2417 useless extension candidates. Maximal degree in co-relation 9325. Up to 2319 conditions per place. 
[2024-06-20 20:01:55,709 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 68 selfloop transitions, 15 changer transitions 0/88 dead transitions.
[2024-06-20 20:01:55,709 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 88 transitions, 587 flow
[2024-06-20 20:01:55,711 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:01:55,711 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:01:55,711 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions.
[2024-06-20 20:01:55,712 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4421768707482993
[2024-06-20 20:01:55,712 INFO  L175             Difference]: Start difference. First operand has 63 places, 60 transitions, 327 flow. Second operand 7 states and 130 transitions.
[2024-06-20 20:01:55,712 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 88 transitions, 587 flow
[2024-06-20 20:01:55,717 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 88 transitions, 559 flow, removed 7 selfloop flow, removed 3 redundant places.
[2024-06-20 20:01:55,718 INFO  L231             Difference]: Finished difference. Result has 67 places, 63 transitions, 369 flow
[2024-06-20 20:01:55,718 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=369, PETRI_PLACES=67, PETRI_TRANSITIONS=63}
[2024-06-20 20:01:55,719 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places.
[2024-06-20 20:01:55,719 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 369 flow
[2024-06-20 20:01:55,719 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:55,719 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:55,719 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:01:55,720 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-20 20:01:55,720 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-20 20:01:55,720 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:55,720 INFO  L85        PathProgramCache]: Analyzing trace with hash 802077567, now seen corresponding path program 2 times
[2024-06-20 20:01:55,720 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:55,721 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668151291]
[2024-06-20 20:01:55,721 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:55,721 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:55,771 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:02:03,478 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:02:03,478 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:02:03,479 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668151291]
[2024-06-20 20:02:03,479 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668151291] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:02:03,479 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:02:03,479 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:02:03,479 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614651001]
[2024-06-20 20:02:03,479 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:02:03,479 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:02:03,479 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:02:03,480 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:02:03,480 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:02:03,639 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:02:03,639 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 369 flow. Second operand  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:03,639 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:02:03,640 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:02:03,640 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:02:04,751 INFO  L124   PetriNetUnfolderBase]: 1614/2459 cut-off events.
[2024-06-20 20:02:04,752 INFO  L125   PetriNetUnfolderBase]: For 15164/15170 co-relation queries the response was YES.
[2024-06-20 20:02:04,755 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10085 conditions, 2459 events. 1614/2459 cut-off events. For 15164/15170 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12132 event pairs, 620 based on Foata normal form. 8/2463 useless extension candidates. Maximal degree in co-relation 10059. Up to 2240 conditions per place. 
[2024-06-20 20:02:04,762 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 75 selfloop transitions, 29 changer transitions 0/109 dead transitions.
[2024-06-20 20:02:04,762 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 109 transitions, 781 flow
[2024-06-20 20:02:04,780 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:02:04,780 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:02:04,781 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-20 20:02:04,781 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.455026455026455
[2024-06-20 20:02:04,781 INFO  L175             Difference]: Start difference. First operand has 67 places, 63 transitions, 369 flow. Second operand 9 states and 172 transitions.
[2024-06-20 20:02:04,781 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 109 transitions, 781 flow
[2024-06-20 20:02:04,787 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 109 transitions, 735 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-06-20 20:02:04,788 INFO  L231             Difference]: Finished difference. Result has 71 places, 69 transitions, 459 flow
[2024-06-20 20:02:04,788 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=459, PETRI_PLACES=71, PETRI_TRANSITIONS=69}
[2024-06-20 20:02:04,789 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places.
[2024-06-20 20:02:04,789 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 69 transitions, 459 flow
[2024-06-20 20:02:04,789 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:04,789 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:02:04,789 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:02:04,789 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-20 20:02:04,790 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:02:04,790 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:02:04,790 INFO  L85        PathProgramCache]: Analyzing trace with hash 802084511, now seen corresponding path program 1 times
[2024-06-20 20:02:04,790 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:02:04,790 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091782695]
[2024-06-20 20:02:04,790 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:02:04,791 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:02:04,852 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:02:12,678 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:02:12,679 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:02:12,679 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091782695]
[2024-06-20 20:02:12,679 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091782695] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:02:12,679 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:02:12,679 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:02:12,680 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227164664]
[2024-06-20 20:02:12,680 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:02:12,680 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:02:12,680 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:02:12,681 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:02:12,681 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:02:12,830 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:02:12,831 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 69 transitions, 459 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:12,831 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:02:12,831 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:02:12,831 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:02:13,973 INFO  L124   PetriNetUnfolderBase]: 1636/2491 cut-off events.
[2024-06-20 20:02:13,973 INFO  L125   PetriNetUnfolderBase]: For 18837/18843 co-relation queries the response was YES.
[2024-06-20 20:02:13,977 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10799 conditions, 2491 events. 1636/2491 cut-off events. For 18837/18843 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12316 event pairs, 586 based on Foata normal form. 8/2495 useless extension candidates. Maximal degree in co-relation 10772. Up to 2287 conditions per place. 
[2024-06-20 20:02:13,985 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 81 selfloop transitions, 26 changer transitions 0/112 dead transitions.
[2024-06-20 20:02:13,985 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 112 transitions, 867 flow
[2024-06-20 20:02:13,987 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:02:13,987 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:02:13,988 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions.
[2024-06-20 20:02:13,988 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4444444444444444
[2024-06-20 20:02:13,988 INFO  L175             Difference]: Start difference. First operand has 71 places, 69 transitions, 459 flow. Second operand 9 states and 168 transitions.
[2024-06-20 20:02:13,988 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 112 transitions, 867 flow
[2024-06-20 20:02:13,996 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 112 transitions, 811 flow, removed 15 selfloop flow, removed 5 redundant places.
[2024-06-20 20:02:13,997 INFO  L231             Difference]: Finished difference. Result has 75 places, 75 transitions, 529 flow
[2024-06-20 20:02:13,997 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=529, PETRI_PLACES=75, PETRI_TRANSITIONS=75}
[2024-06-20 20:02:13,999 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places.
[2024-06-20 20:02:14,000 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 75 transitions, 529 flow
[2024-06-20 20:02:14,000 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:14,000 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:02:14,000 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:02:14,000 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-20 20:02:14,000 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:02:14,001 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:02:14,001 INFO  L85        PathProgramCache]: Analyzing trace with hash 751154237, now seen corresponding path program 3 times
[2024-06-20 20:02:14,004 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:02:14,004 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637672769]
[2024-06-20 20:02:14,004 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:02:14,005 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:02:14,069 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:02:23,821 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:02:23,821 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:02:23,821 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637672769]
[2024-06-20 20:02:23,821 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637672769] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:02:23,821 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:02:23,822 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:02:23,822 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368093585]
[2024-06-20 20:02:23,822 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:02:23,822 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:02:23,822 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:02:23,823 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:02:23,824 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:02:23,975 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:02:23,976 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 75 transitions, 529 flow. Second operand  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:23,976 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:02:23,976 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:02:23,976 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:02:24,989 INFO  L124   PetriNetUnfolderBase]: 1626/2471 cut-off events.
[2024-06-20 20:02:24,990 INFO  L125   PetriNetUnfolderBase]: For 21630/21630 co-relation queries the response was YES.
[2024-06-20 20:02:24,994 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11242 conditions, 2471 events. 1626/2471 cut-off events. For 21630/21630 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12191 event pairs, 599 based on Foata normal form. 4/2470 useless extension candidates. Maximal degree in co-relation 11213. Up to 2264 conditions per place. 
[2024-06-20 20:02:25,002 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 76 selfloop transitions, 28 changer transitions 0/109 dead transitions.
[2024-06-20 20:02:25,002 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 109 transitions, 825 flow
[2024-06-20 20:02:25,004 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:02:25,004 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:02:25,005 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions.
[2024-06-20 20:02:25,006 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43386243386243384
[2024-06-20 20:02:25,006 INFO  L175             Difference]: Start difference. First operand has 75 places, 75 transitions, 529 flow. Second operand 9 states and 164 transitions.
[2024-06-20 20:02:25,006 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 109 transitions, 825 flow
[2024-06-20 20:02:25,034 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 109 transitions, 751 flow, removed 24 selfloop flow, removed 5 redundant places.
[2024-06-20 20:02:25,036 INFO  L231             Difference]: Finished difference. Result has 79 places, 75 transitions, 519 flow
[2024-06-20 20:02:25,040 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=519, PETRI_PLACES=79, PETRI_TRANSITIONS=75}
[2024-06-20 20:02:25,041 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places.
[2024-06-20 20:02:25,041 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 75 transitions, 519 flow
[2024-06-20 20:02:25,041 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:25,041 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:02:25,041 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:02:25,042 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-20 20:02:25,042 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:02:25,042 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:02:25,042 INFO  L85        PathProgramCache]: Analyzing trace with hash 547195505, now seen corresponding path program 2 times
[2024-06-20 20:02:25,042 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:02:25,042 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077358944]
[2024-06-20 20:02:25,042 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:02:25,043 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:02:25,104 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:02:33,354 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:02:33,354 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:02:33,354 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077358944]
[2024-06-20 20:02:33,355 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077358944] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:02:33,355 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:02:33,355 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:02:33,355 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063509405]
[2024-06-20 20:02:33,355 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:02:33,355 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:02:33,356 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:02:33,356 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:02:33,356 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:02:33,520 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:02:33,532 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 75 transitions, 519 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:33,532 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:02:33,532 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:02:33,532 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:02:34,543 INFO  L124   PetriNetUnfolderBase]: 1648/2517 cut-off events.
[2024-06-20 20:02:34,543 INFO  L125   PetriNetUnfolderBase]: For 24255/24255 co-relation queries the response was YES.
[2024-06-20 20:02:34,548 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11617 conditions, 2517 events. 1648/2517 cut-off events. For 24255/24255 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12493 event pairs, 576 based on Foata normal form. 4/2519 useless extension candidates. Maximal degree in co-relation 11586. Up to 2292 conditions per place. 
[2024-06-20 20:02:34,556 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 81 selfloop transitions, 29 changer transitions 0/115 dead transitions.
[2024-06-20 20:02:34,557 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 115 transitions, 911 flow
[2024-06-20 20:02:34,558 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:02:34,558 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:02:34,559 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions.
[2024-06-20 20:02:34,559 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4470899470899471
[2024-06-20 20:02:34,559 INFO  L175             Difference]: Start difference. First operand has 79 places, 75 transitions, 519 flow. Second operand 9 states and 169 transitions.
[2024-06-20 20:02:34,560 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 115 transitions, 911 flow
[2024-06-20 20:02:34,584 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 115 transitions, 847 flow, removed 2 selfloop flow, removed 8 redundant places.
[2024-06-20 20:02:34,588 INFO  L231             Difference]: Finished difference. Result has 80 places, 78 transitions, 551 flow
[2024-06-20 20:02:34,589 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=551, PETRI_PLACES=80, PETRI_TRANSITIONS=78}
[2024-06-20 20:02:34,590 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places.
[2024-06-20 20:02:34,590 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 78 transitions, 551 flow
[2024-06-20 20:02:34,590 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:34,591 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:02:34,591 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:02:34,604 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-20 20:02:34,604 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:02:34,604 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:02:34,605 INFO  L85        PathProgramCache]: Analyzing trace with hash 547492175, now seen corresponding path program 3 times
[2024-06-20 20:02:34,605 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:02:34,605 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899377189]
[2024-06-20 20:02:34,605 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:02:34,605 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:02:34,676 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:02:42,765 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:02:42,765 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:02:42,766 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899377189]
[2024-06-20 20:02:42,766 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899377189] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:02:42,766 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:02:42,766 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:02:42,766 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492903748]
[2024-06-20 20:02:42,766 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:02:42,767 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:02:42,767 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:02:42,767 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:02:42,767 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:02:42,890 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:02:42,890 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 78 transitions, 551 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:42,890 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:02:42,890 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:02:42,891 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:02:44,048 INFO  L124   PetriNetUnfolderBase]: 1638/2503 cut-off events.
[2024-06-20 20:02:44,048 INFO  L125   PetriNetUnfolderBase]: For 26722/26722 co-relation queries the response was YES.
[2024-06-20 20:02:44,053 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11730 conditions, 2503 events. 1638/2503 cut-off events. For 26722/26722 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12417 event pairs, 576 based on Foata normal form. 4/2505 useless extension candidates. Maximal degree in co-relation 11698. Up to 2284 conditions per place. 
[2024-06-20 20:02:44,062 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 81 selfloop transitions, 30 changer transitions 0/116 dead transitions.
[2024-06-20 20:02:44,062 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 116 transitions, 869 flow
[2024-06-20 20:02:44,077 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:02:44,078 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:02:44,078 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions.
[2024-06-20 20:02:44,078 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4261904761904762
[2024-06-20 20:02:44,079 INFO  L175             Difference]: Start difference. First operand has 80 places, 78 transitions, 551 flow. Second operand 10 states and 179 transitions.
[2024-06-20 20:02:44,079 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 116 transitions, 869 flow
[2024-06-20 20:02:44,094 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 116 transitions, 787 flow, removed 18 selfloop flow, removed 6 redundant places.
[2024-06-20 20:02:44,095 INFO  L231             Difference]: Finished difference. Result has 84 places, 78 transitions, 537 flow
[2024-06-20 20:02:44,095 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=537, PETRI_PLACES=84, PETRI_TRANSITIONS=78}
[2024-06-20 20:02:44,096 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 41 predicate places.
[2024-06-20 20:02:44,096 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 78 transitions, 537 flow
[2024-06-20 20:02:44,096 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:44,096 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:02:44,096 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:02:44,097 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-20 20:02:44,097 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:02:44,097 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:02:44,097 INFO  L85        PathProgramCache]: Analyzing trace with hash -2092152979, now seen corresponding path program 1 times
[2024-06-20 20:02:44,097 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:02:44,097 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018890967]
[2024-06-20 20:02:44,098 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:02:44,098 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:02:44,153 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:02:54,683 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:02:54,684 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:02:54,684 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018890967]
[2024-06-20 20:02:54,684 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018890967] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:02:54,684 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:02:54,684 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:02:54,684 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977299027]
[2024-06-20 20:02:54,684 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:02:54,684 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:02:54,684 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:02:54,685 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:02:54,685 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:02:54,780 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:02:54,780 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 78 transitions, 537 flow. Second operand  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:54,780 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:02:54,780 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:02:54,780 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:02:55,828 INFO  L124   PetriNetUnfolderBase]: 1630/2491 cut-off events.
[2024-06-20 20:02:55,828 INFO  L125   PetriNetUnfolderBase]: For 29146/29146 co-relation queries the response was YES.
[2024-06-20 20:02:55,833 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11790 conditions, 2491 events. 1630/2491 cut-off events. For 29146/29146 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12349 event pairs, 592 based on Foata normal form. 4/2493 useless extension candidates. Maximal degree in co-relation 11757. Up to 2369 conditions per place. 
[2024-06-20 20:02:55,841 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 82 selfloop transitions, 14 changer transitions 0/101 dead transitions.
[2024-06-20 20:02:55,841 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 101 transitions, 813 flow
[2024-06-20 20:02:55,843 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:02:55,843 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:02:55,843 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions.
[2024-06-20 20:02:55,844 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42517006802721086
[2024-06-20 20:02:55,844 INFO  L175             Difference]: Start difference. First operand has 84 places, 78 transitions, 537 flow. Second operand 7 states and 125 transitions.
[2024-06-20 20:02:55,844 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 101 transitions, 813 flow
[2024-06-20 20:02:55,857 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 101 transitions, 741 flow, removed 0 selfloop flow, removed 10 redundant places.
[2024-06-20 20:02:55,859 INFO  L231             Difference]: Finished difference. Result has 81 places, 80 transitions, 536 flow
[2024-06-20 20:02:55,859 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=536, PETRI_PLACES=81, PETRI_TRANSITIONS=80}
[2024-06-20 20:02:55,859 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places.
[2024-06-20 20:02:55,859 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 80 transitions, 536 flow
[2024-06-20 20:02:55,859 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:55,860 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:02:55,860 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:02:55,860 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-20 20:02:55,860 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:02:55,860 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:02:55,860 INFO  L85        PathProgramCache]: Analyzing trace with hash -1409706771, now seen corresponding path program 1 times
[2024-06-20 20:02:55,861 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:02:55,861 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059840836]
[2024-06-20 20:02:55,861 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:02:55,861 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:02:55,905 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:03:04,582 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:03:04,583 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:03:04,583 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059840836]
[2024-06-20 20:03:04,583 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059840836] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:03:04,583 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:03:04,583 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 20:03:04,583 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539079478]
[2024-06-20 20:03:04,583 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:03:04,584 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 20:03:04,584 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:03:04,584 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 20:03:04,584 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-20 20:03:04,693 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:03:04,694 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 80 transitions, 536 flow. Second operand  has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:04,694 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:03:04,694 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:03:04,694 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:03:05,485 INFO  L124   PetriNetUnfolderBase]: 1657/2531 cut-off events.
[2024-06-20 20:03:05,486 INFO  L125   PetriNetUnfolderBase]: For 32866/32866 co-relation queries the response was YES.
[2024-06-20 20:03:05,491 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12233 conditions, 2531 events. 1657/2531 cut-off events. For 32866/32866 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12614 event pairs, 655 based on Foata normal form. 3/2529 useless extension candidates. Maximal degree in co-relation 12199. Up to 2409 conditions per place. 
[2024-06-20 20:03:05,499 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 78 selfloop transitions, 17 changer transitions 0/100 dead transitions.
[2024-06-20 20:03:05,499 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 100 transitions, 860 flow
[2024-06-20 20:03:05,500 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 20:03:05,500 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 20:03:05,500 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions.
[2024-06-20 20:03:05,501 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4246031746031746
[2024-06-20 20:03:05,501 INFO  L175             Difference]: Start difference. First operand has 81 places, 80 transitions, 536 flow. Second operand 6 states and 107 transitions.
[2024-06-20 20:03:05,501 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 100 transitions, 860 flow
[2024-06-20 20:03:05,557 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 100 transitions, 807 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-20 20:03:05,558 INFO  L231             Difference]: Finished difference. Result has 83 places, 88 transitions, 604 flow
[2024-06-20 20:03:05,558 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=604, PETRI_PLACES=83, PETRI_TRANSITIONS=88}
[2024-06-20 20:03:05,559 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 40 predicate places.
[2024-06-20 20:03:05,559 INFO  L495      AbstractCegarLoop]: Abstraction has has 83 places, 88 transitions, 604 flow
[2024-06-20 20:03:05,559 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:05,559 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:03:05,559 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:03:05,559 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-20 20:03:05,559 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:03:05,559 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:03:05,559 INFO  L85        PathProgramCache]: Analyzing trace with hash -457405916, now seen corresponding path program 1 times
[2024-06-20 20:03:05,559 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:03:05,560 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354094211]
[2024-06-20 20:03:05,560 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:03:05,560 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:03:05,608 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:03:15,161 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:03:15,161 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:03:15,161 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354094211]
[2024-06-20 20:03:15,162 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354094211] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:03:15,162 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:03:15,162 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:03:15,162 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100128763]
[2024-06-20 20:03:15,162 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:03:15,162 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:03:15,162 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:03:15,163 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:03:15,163 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:03:15,268 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:03:15,268 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 88 transitions, 604 flow. Second operand  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:15,268 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:03:15,269 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:03:15,269 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:03:16,119 INFO  L124   PetriNetUnfolderBase]: 1679/2573 cut-off events.
[2024-06-20 20:03:16,120 INFO  L125   PetriNetUnfolderBase]: For 37306/37306 co-relation queries the response was YES.
[2024-06-20 20:03:16,124 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13100 conditions, 2573 events. 1679/2573 cut-off events. For 37306/37306 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12852 event pairs, 652 based on Foata normal form. 2/2573 useless extension candidates. Maximal degree in co-relation 13064. Up to 2476 conditions per place. 
[2024-06-20 20:03:16,132 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 89 selfloop transitions, 13 changer transitions 0/107 dead transitions.
[2024-06-20 20:03:16,132 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 107 transitions, 910 flow
[2024-06-20 20:03:16,133 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:03:16,133 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:03:16,133 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions.
[2024-06-20 20:03:16,133 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.391156462585034
[2024-06-20 20:03:16,133 INFO  L175             Difference]: Start difference. First operand has 83 places, 88 transitions, 604 flow. Second operand 7 states and 115 transitions.
[2024-06-20 20:03:16,134 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 107 transitions, 910 flow
[2024-06-20 20:03:16,148 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 107 transitions, 871 flow, removed 14 selfloop flow, removed 2 redundant places.
[2024-06-20 20:03:16,149 INFO  L231             Difference]: Finished difference. Result has 89 places, 94 transitions, 675 flow
[2024-06-20 20:03:16,149 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=675, PETRI_PLACES=89, PETRI_TRANSITIONS=94}
[2024-06-20 20:03:16,150 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 46 predicate places.
[2024-06-20 20:03:16,150 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 94 transitions, 675 flow
[2024-06-20 20:03:16,150 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:16,150 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:03:16,150 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:03:16,150 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-20 20:03:16,151 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:03:16,151 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:03:16,151 INFO  L85        PathProgramCache]: Analyzing trace with hash -751251006, now seen corresponding path program 2 times
[2024-06-20 20:03:16,151 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:03:16,151 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705556414]
[2024-06-20 20:03:16,151 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:03:16,151 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:03:16,187 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:03:24,844 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:03:24,845 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:03:24,845 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705556414]
[2024-06-20 20:03:24,845 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705556414] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:03:24,845 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:03:24,845 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:03:24,845 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580187171]
[2024-06-20 20:03:24,846 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:03:24,847 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:03:24,848 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:03:24,848 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:03:24,848 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:03:24,960 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:03:24,961 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 94 transitions, 675 flow. Second operand  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:24,961 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:03:24,961 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:03:24,961 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:03:25,847 INFO  L124   PetriNetUnfolderBase]: 1683/2583 cut-off events.
[2024-06-20 20:03:25,847 INFO  L125   PetriNetUnfolderBase]: For 40645/40645 co-relation queries the response was YES.
[2024-06-20 20:03:25,854 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13354 conditions, 2583 events. 1683/2583 cut-off events. For 40645/40645 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12902 event pairs, 653 based on Foata normal form. 4/2585 useless extension candidates. Maximal degree in co-relation 13315. Up to 2427 conditions per place. 
[2024-06-20 20:03:25,863 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 84 selfloop transitions, 26 changer transitions 0/115 dead transitions.
[2024-06-20 20:03:25,863 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 115 transitions, 1027 flow
[2024-06-20 20:03:25,863 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:03:25,865 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:03:25,865 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions.
[2024-06-20 20:03:25,866 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42517006802721086
[2024-06-20 20:03:25,866 INFO  L175             Difference]: Start difference. First operand has 89 places, 94 transitions, 675 flow. Second operand 7 states and 125 transitions.
[2024-06-20 20:03:25,866 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 115 transitions, 1027 flow
[2024-06-20 20:03:25,885 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 115 transitions, 995 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-06-20 20:03:25,886 INFO  L231             Difference]: Finished difference. Result has 92 places, 97 transitions, 743 flow
[2024-06-20 20:03:25,887 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=743, PETRI_PLACES=92, PETRI_TRANSITIONS=97}
[2024-06-20 20:03:25,887 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 49 predicate places.
[2024-06-20 20:03:25,887 INFO  L495      AbstractCegarLoop]: Abstraction has has 92 places, 97 transitions, 743 flow
[2024-06-20 20:03:25,887 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:25,887 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:03:25,888 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:03:25,888 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-20 20:03:25,888 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-20 20:03:25,888 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:03:25,888 INFO  L85        PathProgramCache]: Analyzing trace with hash 1458125058, now seen corresponding path program 3 times
[2024-06-20 20:03:25,889 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:03:25,889 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998066925]
[2024-06-20 20:03:25,889 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:03:25,889 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:03:25,929 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:03:34,632 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:03:34,633 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:03:34,633 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998066925]
[2024-06-20 20:03:34,633 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998066925] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:03:34,633 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:03:34,633 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 20:03:34,633 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212504836]
[2024-06-20 20:03:34,633 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:03:34,634 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 20:03:34,634 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:03:34,634 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 20:03:34,634 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 20:03:34,754 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:03:34,755 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 97 transitions, 743 flow. Second operand  has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:34,755 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:03:34,755 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:03:34,755 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:03:35,673 INFO  L124   PetriNetUnfolderBase]: 1690/2596 cut-off events.
[2024-06-20 20:03:35,673 INFO  L125   PetriNetUnfolderBase]: For 43713/43713 co-relation queries the response was YES.
[2024-06-20 20:03:35,680 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13648 conditions, 2596 events. 1690/2596 cut-off events. For 43713/43713 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12971 event pairs, 651 based on Foata normal form. 2/2596 useless extension candidates. Maximal degree in co-relation 13608. Up to 2475 conditions per place. 
[2024-06-20 20:03:35,688 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 95 selfloop transitions, 24 changer transitions 0/124 dead transitions.
[2024-06-20 20:03:35,689 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 124 transitions, 1121 flow
[2024-06-20 20:03:35,689 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:03:35,689 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:03:35,690 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-20 20:03:35,690 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4217687074829932
[2024-06-20 20:03:35,690 INFO  L175             Difference]: Start difference. First operand has 92 places, 97 transitions, 743 flow. Second operand 7 states and 124 transitions.
[2024-06-20 20:03:35,690 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 124 transitions, 1121 flow
[2024-06-20 20:03:35,719 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 124 transitions, 1050 flow, removed 15 selfloop flow, removed 4 redundant places.
[2024-06-20 20:03:35,721 INFO  L231             Difference]: Finished difference. Result has 96 places, 106 transitions, 834 flow
[2024-06-20 20:03:35,721 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=834, PETRI_PLACES=96, PETRI_TRANSITIONS=106}
[2024-06-20 20:03:35,721 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 53 predicate places.
[2024-06-20 20:03:35,721 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 106 transitions, 834 flow
[2024-06-20 20:03:35,722 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:35,722 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:03:35,722 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:03:35,722 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-20 20:03:35,722 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:03:35,722 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:03:35,723 INFO  L85        PathProgramCache]: Analyzing trace with hash -757910302, now seen corresponding path program 1 times
[2024-06-20 20:03:35,723 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:03:35,723 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883217686]
[2024-06-20 20:03:35,723 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:03:35,723 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:03:35,766 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:03:44,659 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:03:44,659 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:03:44,659 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883217686]
[2024-06-20 20:03:44,659 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883217686] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:03:44,659 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:03:44,659 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 20:03:44,660 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851902917]
[2024-06-20 20:03:44,660 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:03:44,660 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 20:03:44,661 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:03:44,662 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 20:03:44,662 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 20:03:44,793 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:03:44,793 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 106 transitions, 834 flow. Second operand  has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:44,793 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:03:44,793 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:03:44,793 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:03:45,682 INFO  L124   PetriNetUnfolderBase]: 1700/2606 cut-off events.
[2024-06-20 20:03:45,682 INFO  L125   PetriNetUnfolderBase]: For 46938/46941 co-relation queries the response was YES.
[2024-06-20 20:03:45,688 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13902 conditions, 2606 events. 1700/2606 cut-off events. For 46938/46941 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12977 event pairs, 633 based on Foata normal form. 4/2607 useless extension candidates. Maximal degree in co-relation 13860. Up to 2499 conditions per place. 
[2024-06-20 20:03:45,695 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 104 selfloop transitions, 15 changer transitions 0/124 dead transitions.
[2024-06-20 20:03:45,695 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 124 transitions, 1151 flow
[2024-06-20 20:03:45,696 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 20:03:45,696 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 20:03:45,696 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions.
[2024-06-20 20:03:45,696 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2024-06-20 20:03:45,696 INFO  L175             Difference]: Start difference. First operand has 96 places, 106 transitions, 834 flow. Second operand 6 states and 105 transitions.
[2024-06-20 20:03:45,696 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 124 transitions, 1151 flow
[2024-06-20 20:03:45,713 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 124 transitions, 1070 flow, removed 4 selfloop flow, removed 6 redundant places.
[2024-06-20 20:03:45,714 INFO  L231             Difference]: Finished difference. Result has 97 places, 112 transitions, 846 flow
[2024-06-20 20:03:45,714 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=846, PETRI_PLACES=97, PETRI_TRANSITIONS=112}
[2024-06-20 20:03:45,715 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 54 predicate places.
[2024-06-20 20:03:45,715 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 112 transitions, 846 flow
[2024-06-20 20:03:45,715 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:45,715 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:03:45,715 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:03:45,715 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-20 20:03:45,716 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:03:45,716 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:03:45,716 INFO  L85        PathProgramCache]: Analyzing trace with hash 988438468, now seen corresponding path program 2 times
[2024-06-20 20:03:45,716 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:03:45,716 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161879534]
[2024-06-20 20:03:45,716 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:03:45,717 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:03:45,752 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:03:55,421 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:03:55,421 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:03:55,422 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161879534]
[2024-06-20 20:03:55,422 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161879534] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:03:55,422 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:03:55,422 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 20:03:55,422 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530012758]
[2024-06-20 20:03:55,422 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:03:55,422 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 20:03:55,423 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:03:55,423 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 20:03:55,423 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-20 20:03:55,533 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:03:55,533 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 112 transitions, 846 flow. Second operand  has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:55,533 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:03:55,533 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:03:55,534 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:03:56,370 INFO  L124   PetriNetUnfolderBase]: 1702/2610 cut-off events.
[2024-06-20 20:03:56,370 INFO  L125   PetriNetUnfolderBase]: For 51332/51335 co-relation queries the response was YES.
[2024-06-20 20:03:56,376 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14470 conditions, 2610 events. 1702/2610 cut-off events. For 51332/51335 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 13077 event pairs, 636 based on Foata normal form. 4/2610 useless extension candidates. Maximal degree in co-relation 14426. Up to 2489 conditions per place. 
[2024-06-20 20:03:56,385 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 102 selfloop transitions, 22 changer transitions 0/129 dead transitions.
[2024-06-20 20:03:56,385 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 129 transitions, 1240 flow
[2024-06-20 20:03:56,386 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 20:03:56,386 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 20:03:56,386 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions.
[2024-06-20 20:03:56,386 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42063492063492064
[2024-06-20 20:03:56,386 INFO  L175             Difference]: Start difference. First operand has 97 places, 112 transitions, 846 flow. Second operand 6 states and 106 transitions.
[2024-06-20 20:03:56,386 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 129 transitions, 1240 flow
[2024-06-20 20:03:56,412 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 129 transitions, 1203 flow, removed 12 selfloop flow, removed 2 redundant places.
[2024-06-20 20:03:56,417 INFO  L231             Difference]: Finished difference. Result has 101 places, 118 transitions, 937 flow
[2024-06-20 20:03:56,418 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=937, PETRI_PLACES=101, PETRI_TRANSITIONS=118}
[2024-06-20 20:03:56,418 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 58 predicate places.
[2024-06-20 20:03:56,418 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 118 transitions, 937 flow
[2024-06-20 20:03:56,418 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:56,419 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:03:56,419 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:03:56,419 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-20 20:03:56,419 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:03:56,420 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:03:56,420 INFO  L85        PathProgramCache]: Analyzing trace with hash -751235134, now seen corresponding path program 1 times
[2024-06-20 20:03:56,420 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:03:56,420 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328669534]
[2024-06-20 20:03:56,420 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:03:56,421 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:03:56,524 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:04:06,462 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:04:06,462 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:04:06,463 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328669534]
[2024-06-20 20:04:06,463 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328669534] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:04:06,463 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:04:06,463 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:04:06,463 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037288955]
[2024-06-20 20:04:06,463 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:04:06,463 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:04:06,464 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:04:06,464 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:04:06,464 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:04:06,583 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:04:06,584 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 118 transitions, 937 flow. Second operand  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:06,584 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:04:06,584 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:04:06,584 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:04:07,475 INFO  L124   PetriNetUnfolderBase]: 1710/2613 cut-off events.
[2024-06-20 20:04:07,475 INFO  L125   PetriNetUnfolderBase]: For 54892/54892 co-relation queries the response was YES.
[2024-06-20 20:04:07,482 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14934 conditions, 2613 events. 1710/2613 cut-off events. For 54892/54892 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12959 event pairs, 629 based on Foata normal form. 4/2607 useless extension candidates. Maximal degree in co-relation 14888. Up to 2416 conditions per place. 
[2024-06-20 20:04:07,491 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 94 selfloop transitions, 43 changer transitions 0/142 dead transitions.
[2024-06-20 20:04:07,491 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 142 transitions, 1417 flow
[2024-06-20 20:04:07,491 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:04:07,492 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:04:07,492 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-20 20:04:07,492 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4217687074829932
[2024-06-20 20:04:07,492 INFO  L175             Difference]: Start difference. First operand has 101 places, 118 transitions, 937 flow. Second operand 7 states and 124 transitions.
[2024-06-20 20:04:07,492 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 142 transitions, 1417 flow
[2024-06-20 20:04:07,529 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 142 transitions, 1372 flow, removed 17 selfloop flow, removed 2 redundant places.
[2024-06-20 20:04:07,530 INFO  L231             Difference]: Finished difference. Result has 108 places, 129 transitions, 1154 flow
[2024-06-20 20:04:07,531 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1154, PETRI_PLACES=108, PETRI_TRANSITIONS=129}
[2024-06-20 20:04:07,531 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 65 predicate places.
[2024-06-20 20:04:07,531 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 129 transitions, 1154 flow
[2024-06-20 20:04:07,533 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:07,534 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:04:07,534 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:04:07,534 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-20 20:04:07,534 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-20 20:04:07,534 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:04:07,534 INFO  L85        PathProgramCache]: Analyzing trace with hash -323395580, now seen corresponding path program 1 times
[2024-06-20 20:04:07,534 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:04:07,535 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019463818]
[2024-06-20 20:04:07,535 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:04:07,535 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:04:07,580 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:04:18,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-20 20:04:18,415 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:04:18,415 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019463818]
[2024-06-20 20:04:18,415 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019463818] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:04:18,415 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:04:18,415 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:04:18,415 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037453271]
[2024-06-20 20:04:18,415 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:04:18,417 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:04:18,417 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:04:18,417 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:04:18,418 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:04:18,659 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:04:18,660 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 129 transitions, 1154 flow. Second operand  has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:18,660 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:04:18,660 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:04:18,660 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:04:19,938 INFO  L124   PetriNetUnfolderBase]: 1794/2752 cut-off events.
[2024-06-20 20:04:19,938 INFO  L125   PetriNetUnfolderBase]: For 67143/67143 co-relation queries the response was YES.
[2024-06-20 20:04:19,945 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17036 conditions, 2752 events. 1794/2752 cut-off events. For 67143/67143 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13775 event pairs, 610 based on Foata normal form. 8/2758 useless extension candidates. Maximal degree in co-relation 16986. Up to 2468 conditions per place. 
[2024-06-20 20:04:19,954 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 138 selfloop transitions, 28 changer transitions 0/171 dead transitions.
[2024-06-20 20:04:19,955 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 171 transitions, 1756 flow
[2024-06-20 20:04:19,957 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:04:19,957 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:04:19,957 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions.
[2024-06-20 20:04:19,957 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4417989417989418
[2024-06-20 20:04:19,957 INFO  L175             Difference]: Start difference. First operand has 108 places, 129 transitions, 1154 flow. Second operand 9 states and 167 transitions.
[2024-06-20 20:04:19,957 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 171 transitions, 1756 flow
[2024-06-20 20:04:19,997 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 171 transitions, 1684 flow, removed 29 selfloop flow, removed 2 redundant places.
[2024-06-20 20:04:19,999 INFO  L231             Difference]: Finished difference. Result has 115 places, 133 transitions, 1225 flow
[2024-06-20 20:04:19,999 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1082, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1225, PETRI_PLACES=115, PETRI_TRANSITIONS=133}
[2024-06-20 20:04:20,000 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 72 predicate places.
[2024-06-20 20:04:20,000 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 133 transitions, 1225 flow
[2024-06-20 20:04:20,000 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:20,000 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:04:20,000 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:04:20,000 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-20 20:04:20,000 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:04:20,001 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:04:20,001 INFO  L85        PathProgramCache]: Analyzing trace with hash 1997429342, now seen corresponding path program 2 times
[2024-06-20 20:04:20,001 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:04:20,001 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879412902]
[2024-06-20 20:04:20,001 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:04:20,002 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:04:20,048 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:04:30,035 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:04:30,036 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:04:30,036 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879412902]
[2024-06-20 20:04:30,036 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879412902] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:04:30,036 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:04:30,036 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:04:30,036 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182886966]
[2024-06-20 20:04:30,037 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:04:30,037 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:04:30,037 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:04:30,037 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:04:30,038 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:04:30,195 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:04:30,196 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 133 transitions, 1225 flow. Second operand  has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:30,196 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:04:30,196 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:04:30,196 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:04:31,401 INFO  L124   PetriNetUnfolderBase]: 1828/2813 cut-off events.
[2024-06-20 20:04:31,403 INFO  L125   PetriNetUnfolderBase]: For 74453/74456 co-relation queries the response was YES.
[2024-06-20 20:04:31,410 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17754 conditions, 2813 events. 1828/2813 cut-off events. For 74453/74456 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 14169 event pairs, 517 based on Foata normal form. 10/2819 useless extension candidates. Maximal degree in co-relation 17702. Up to 2501 conditions per place. 
[2024-06-20 20:04:31,419 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 125 selfloop transitions, 35 changer transitions 0/165 dead transitions.
[2024-06-20 20:04:31,419 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 165 transitions, 1683 flow
[2024-06-20 20:04:31,420 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:04:31,420 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:04:31,436 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions.
[2024-06-20 20:04:31,436 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4494047619047619
[2024-06-20 20:04:31,436 INFO  L175             Difference]: Start difference. First operand has 115 places, 133 transitions, 1225 flow. Second operand 8 states and 151 transitions.
[2024-06-20 20:04:31,436 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 165 transitions, 1683 flow
[2024-06-20 20:04:31,479 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 165 transitions, 1607 flow, removed 23 selfloop flow, removed 5 redundant places.
[2024-06-20 20:04:31,481 INFO  L231             Difference]: Finished difference. Result has 118 places, 135 transitions, 1272 flow
[2024-06-20 20:04:31,482 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1149, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1272, PETRI_PLACES=118, PETRI_TRANSITIONS=135}
[2024-06-20 20:04:31,482 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 75 predicate places.
[2024-06-20 20:04:31,482 INFO  L495      AbstractCegarLoop]: Abstraction has has 118 places, 135 transitions, 1272 flow
[2024-06-20 20:04:31,482 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:31,482 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:04:31,483 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:04:31,483 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-20 20:04:31,483 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:04:31,483 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:04:31,483 INFO  L85        PathProgramCache]: Analyzing trace with hash 1713702528, now seen corresponding path program 3 times
[2024-06-20 20:04:31,483 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:04:31,484 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305508963]
[2024-06-20 20:04:31,484 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:04:31,484 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:04:31,536 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:04:40,225 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:04:40,225 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:04:40,225 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305508963]
[2024-06-20 20:04:40,225 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305508963] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:04:40,226 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:04:40,226 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:04:40,226 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674242848]
[2024-06-20 20:04:40,226 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:04:40,227 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:04:40,227 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:04:40,227 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:04:40,227 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:04:40,400 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:04:40,401 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 135 transitions, 1272 flow. Second operand  has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:40,401 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:04:40,401 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:04:40,401 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:04:41,669 INFO  L124   PetriNetUnfolderBase]: 1812/2787 cut-off events.
[2024-06-20 20:04:41,670 INFO  L125   PetriNetUnfolderBase]: For 76422/76422 co-relation queries the response was YES.
[2024-06-20 20:04:41,679 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17758 conditions, 2787 events. 1812/2787 cut-off events. For 76422/76422 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 13958 event pairs, 589 based on Foata normal form. 8/2793 useless extension candidates. Maximal degree in co-relation 17704. Up to 2590 conditions per place. 
[2024-06-20 20:04:41,689 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 136 selfloop transitions, 24 changer transitions 0/165 dead transitions.
[2024-06-20 20:04:41,690 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 165 transitions, 1686 flow
[2024-06-20 20:04:41,692 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:04:41,692 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:04:41,692 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions.
[2024-06-20 20:04:41,692 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4375
[2024-06-20 20:04:41,692 INFO  L175             Difference]: Start difference. First operand has 118 places, 135 transitions, 1272 flow. Second operand 8 states and 147 transitions.
[2024-06-20 20:04:41,693 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 165 transitions, 1686 flow
[2024-06-20 20:04:41,741 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 165 transitions, 1561 flow, removed 29 selfloop flow, removed 6 redundant places.
[2024-06-20 20:04:41,743 INFO  L231             Difference]: Finished difference. Result has 120 places, 135 transitions, 1202 flow
[2024-06-20 20:04:41,744 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1202, PETRI_PLACES=120, PETRI_TRANSITIONS=135}
[2024-06-20 20:04:41,744 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 77 predicate places.
[2024-06-20 20:04:41,744 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 135 transitions, 1202 flow
[2024-06-20 20:04:41,744 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:41,745 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:04:41,758 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:04:41,758 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-20 20:04:41,758 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:04:41,772 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:04:41,772 INFO  L85        PathProgramCache]: Analyzing trace with hash 782587408, now seen corresponding path program 1 times
[2024-06-20 20:04:41,772 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:04:41,773 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277831226]
[2024-06-20 20:04:41,773 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:04:41,773 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:04:41,932 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:04:50,538 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:04:50,539 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:04:50,539 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277831226]
[2024-06-20 20:04:50,539 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277831226] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:04:50,539 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:04:50,539 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:04:50,539 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645530702]
[2024-06-20 20:04:50,539 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:04:50,540 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:04:50,540 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:04:50,540 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:04:50,540 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:04:50,639 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:04:50,639 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 135 transitions, 1202 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:50,639 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:04:50,639 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:04:50,640 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:04:52,107 INFO  L124   PetriNetUnfolderBase]: 1898/2923 cut-off events.
[2024-06-20 20:04:52,107 INFO  L125   PetriNetUnfolderBase]: For 84274/84277 co-relation queries the response was YES.
[2024-06-20 20:04:52,115 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18570 conditions, 2923 events. 1898/2923 cut-off events. For 84274/84277 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14838 event pairs, 455 based on Foata normal form. 6/2925 useless extension candidates. Maximal degree in co-relation 18515. Up to 2455 conditions per place. 
[2024-06-20 20:04:52,125 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 139 selfloop transitions, 58 changer transitions 0/202 dead transitions.
[2024-06-20 20:04:52,125 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 202 transitions, 2212 flow
[2024-06-20 20:04:52,127 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 20:04:52,127 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 20:04:52,128 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 218 transitions.
[2024-06-20 20:04:52,129 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47186147186147187
[2024-06-20 20:04:52,129 INFO  L175             Difference]: Start difference. First operand has 120 places, 135 transitions, 1202 flow. Second operand 11 states and 218 transitions.
[2024-06-20 20:04:52,129 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 202 transitions, 2212 flow
[2024-06-20 20:04:52,189 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 202 transitions, 2159 flow, removed 1 selfloop flow, removed 7 redundant places.
[2024-06-20 20:04:52,191 INFO  L231             Difference]: Finished difference. Result has 124 places, 147 transitions, 1463 flow
[2024-06-20 20:04:52,191 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1149, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1463, PETRI_PLACES=124, PETRI_TRANSITIONS=147}
[2024-06-20 20:04:52,192 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 81 predicate places.
[2024-06-20 20:04:52,192 INFO  L495      AbstractCegarLoop]: Abstraction has has 124 places, 147 transitions, 1463 flow
[2024-06-20 20:04:52,193 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:52,193 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:04:52,193 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:04:52,193 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-20 20:04:52,193 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:04:52,194 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:04:52,194 INFO  L85        PathProgramCache]: Analyzing trace with hash 610698674, now seen corresponding path program 2 times
[2024-06-20 20:04:52,194 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:04:52,194 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906575878]
[2024-06-20 20:04:52,194 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:04:52,194 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:04:52,283 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:05:00,605 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:05:00,605 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:05:00,606 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906575878]
[2024-06-20 20:05:00,607 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906575878] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:05:00,607 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:05:00,607 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:05:00,608 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427793226]
[2024-06-20 20:05:00,609 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:05:00,609 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:05:00,609 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:05:00,609 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:05:00,609 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:05:00,800 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:05:00,800 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 147 transitions, 1463 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:00,800 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:05:00,801 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:05:00,801 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:05:02,152 INFO  L124   PetriNetUnfolderBase]: 1888/2909 cut-off events.
[2024-06-20 20:05:02,152 INFO  L125   PetriNetUnfolderBase]: For 89948/89951 co-relation queries the response was YES.
[2024-06-20 20:05:02,160 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19074 conditions, 2909 events. 1888/2909 cut-off events. For 89948/89951 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14721 event pairs, 429 based on Foata normal form. 4/2909 useless extension candidates. Maximal degree in co-relation 19018. Up to 2447 conditions per place. 
[2024-06-20 20:05:02,169 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 126 selfloop transitions, 51 changer transitions 0/182 dead transitions.
[2024-06-20 20:05:02,169 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 182 transitions, 2107 flow
[2024-06-20 20:05:02,171 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:05:02,171 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:05:02,171 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions.
[2024-06-20 20:05:02,172 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-20 20:05:02,172 INFO  L175             Difference]: Start difference. First operand has 124 places, 147 transitions, 1463 flow. Second operand 8 states and 160 transitions.
[2024-06-20 20:05:02,172 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 182 transitions, 2107 flow
[2024-06-20 20:05:02,229 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 182 transitions, 1983 flow, removed 43 selfloop flow, removed 5 redundant places.
[2024-06-20 20:05:02,232 INFO  L231             Difference]: Finished difference. Result has 127 places, 147 transitions, 1449 flow
[2024-06-20 20:05:02,232 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1339, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1449, PETRI_PLACES=127, PETRI_TRANSITIONS=147}
[2024-06-20 20:05:02,233 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 84 predicate places.
[2024-06-20 20:05:02,233 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 147 transitions, 1449 flow
[2024-06-20 20:05:02,233 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:02,233 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:05:02,233 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:05:02,233 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-20 20:05:02,234 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:05:02,234 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:05:02,234 INFO  L85        PathProgramCache]: Analyzing trace with hash -318496080, now seen corresponding path program 3 times
[2024-06-20 20:05:02,234 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:05:02,234 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660524742]
[2024-06-20 20:05:02,234 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:05:02,234 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:05:02,306 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:05:11,466 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:05:11,466 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:05:11,466 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660524742]
[2024-06-20 20:05:11,466 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660524742] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:05:11,466 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:05:11,466 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:05:11,467 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715089587]
[2024-06-20 20:05:11,467 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:05:11,467 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:05:11,468 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:05:11,477 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:05:11,478 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:05:11,671 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:05:11,672 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 147 transitions, 1449 flow. Second operand  has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:11,672 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:05:11,672 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:05:11,672 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:05:12,944 INFO  L124   PetriNetUnfolderBase]: 1878/2888 cut-off events.
[2024-06-20 20:05:12,944 INFO  L125   PetriNetUnfolderBase]: For 94875/94875 co-relation queries the response was YES.
[2024-06-20 20:05:12,953 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19085 conditions, 2888 events. 1878/2888 cut-off events. For 94875/94875 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14630 event pairs, 507 based on Foata normal form. 4/2890 useless extension candidates. Maximal degree in co-relation 19027. Up to 2670 conditions per place. 
[2024-06-20 20:05:12,962 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 138 selfloop transitions, 27 changer transitions 0/170 dead transitions.
[2024-06-20 20:05:12,962 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 170 transitions, 1851 flow
[2024-06-20 20:05:12,964 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:05:12,964 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:05:12,965 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions.
[2024-06-20 20:05:12,965 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.445578231292517
[2024-06-20 20:05:12,965 INFO  L175             Difference]: Start difference. First operand has 127 places, 147 transitions, 1449 flow. Second operand 7 states and 131 transitions.
[2024-06-20 20:05:12,965 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 170 transitions, 1851 flow
[2024-06-20 20:05:13,025 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 170 transitions, 1723 flow, removed 17 selfloop flow, removed 6 redundant places.
[2024-06-20 20:05:13,027 INFO  L231             Difference]: Finished difference. Result has 128 places, 147 transitions, 1387 flow
[2024-06-20 20:05:13,028 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1321, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1387, PETRI_PLACES=128, PETRI_TRANSITIONS=147}
[2024-06-20 20:05:13,028 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 85 predicate places.
[2024-06-20 20:05:13,029 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 147 transitions, 1387 flow
[2024-06-20 20:05:13,029 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:13,029 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:05:13,029 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:05:13,029 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-20 20:05:13,029 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:05:13,030 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:05:13,030 INFO  L85        PathProgramCache]: Analyzing trace with hash 782833486, now seen corresponding path program 1 times
[2024-06-20 20:05:13,030 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:05:13,030 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929457503]
[2024-06-20 20:05:13,030 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:05:13,030 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:05:13,107 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:05:22,335 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:05:22,335 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:05:22,336 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929457503]
[2024-06-20 20:05:22,336 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929457503] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:05:22,336 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:05:22,336 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:05:22,336 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519864092]
[2024-06-20 20:05:22,336 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:05:22,337 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:05:22,337 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:05:22,338 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:05:22,338 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:05:22,638 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:05:22,639 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 147 transitions, 1387 flow. Second operand  has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:22,639 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:05:22,640 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:05:22,640 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:05:24,193 INFO  L124   PetriNetUnfolderBase]: 1895/2922 cut-off events.
[2024-06-20 20:05:24,193 INFO  L125   PetriNetUnfolderBase]: For 99883/99886 co-relation queries the response was YES.
[2024-06-20 20:05:24,202 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19265 conditions, 2922 events. 1895/2922 cut-off events. For 99883/99886 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14812 event pairs, 482 based on Foata normal form. 4/2922 useless extension candidates. Maximal degree in co-relation 19206. Up to 2639 conditions per place. 
[2024-06-20 20:05:24,213 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 136 selfloop transitions, 38 changer transitions 0/179 dead transitions.
[2024-06-20 20:05:24,213 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 179 transitions, 1863 flow
[2024-06-20 20:05:24,215 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:05:24,215 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:05:24,216 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions.
[2024-06-20 20:05:24,216 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-20 20:05:24,216 INFO  L175             Difference]: Start difference. First operand has 128 places, 147 transitions, 1387 flow. Second operand 8 states and 152 transitions.
[2024-06-20 20:05:24,216 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 179 transitions, 1863 flow
[2024-06-20 20:05:24,276 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 179 transitions, 1787 flow, removed 2 selfloop flow, removed 8 redundant places.
[2024-06-20 20:05:24,279 INFO  L231             Difference]: Finished difference. Result has 128 places, 149 transitions, 1438 flow
[2024-06-20 20:05:24,279 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1311, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1438, PETRI_PLACES=128, PETRI_TRANSITIONS=149}
[2024-06-20 20:05:24,280 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 85 predicate places.
[2024-06-20 20:05:24,280 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 149 transitions, 1438 flow
[2024-06-20 20:05:24,280 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:24,280 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:05:24,280 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:05:24,281 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-20 20:05:24,281 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:05:24,281 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:05:24,281 INFO  L85        PathProgramCache]: Analyzing trace with hash 304749468, now seen corresponding path program 4 times
[2024-06-20 20:05:24,281 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:05:24,282 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690865048]
[2024-06-20 20:05:24,282 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:05:24,282 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:05:24,329 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:05:33,853 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:05:33,854 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:05:33,854 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690865048]
[2024-06-20 20:05:33,854 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690865048] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:05:33,854 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:05:33,854 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:05:33,854 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440667003]
[2024-06-20 20:05:33,854 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:05:33,855 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:05:33,855 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:05:33,855 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:05:33,855 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:05:33,974 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:05:33,975 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 149 transitions, 1438 flow. Second operand  has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:33,975 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:05:33,975 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:05:33,982 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:05:35,281 INFO  L124   PetriNetUnfolderBase]: 1879/2903 cut-off events.
[2024-06-20 20:05:35,281 INFO  L125   PetriNetUnfolderBase]: For 98817/98817 co-relation queries the response was YES.
[2024-06-20 20:05:35,289 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19133 conditions, 2903 events. 1879/2903 cut-off events. For 98817/98817 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 14791 event pairs, 504 based on Foata normal form. 8/2909 useless extension candidates. Maximal degree in co-relation 19074. Up to 2576 conditions per place. 
[2024-06-20 20:05:35,297 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 148 selfloop transitions, 36 changer transitions 0/189 dead transitions.
[2024-06-20 20:05:35,297 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 189 transitions, 1976 flow
[2024-06-20 20:05:35,299 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:05:35,299 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:05:35,299 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions.
[2024-06-20 20:05:35,299 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.430952380952381
[2024-06-20 20:05:35,299 INFO  L175             Difference]: Start difference. First operand has 128 places, 149 transitions, 1438 flow. Second operand 10 states and 181 transitions.
[2024-06-20 20:05:35,300 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 189 transitions, 1976 flow
[2024-06-20 20:05:35,365 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 189 transitions, 1867 flow, removed 18 selfloop flow, removed 6 redundant places.
[2024-06-20 20:05:35,367 INFO  L231             Difference]: Finished difference. Result has 132 places, 151 transitions, 1462 flow
[2024-06-20 20:05:35,368 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1329, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1462, PETRI_PLACES=132, PETRI_TRANSITIONS=151}
[2024-06-20 20:05:35,368 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 89 predicate places.
[2024-06-20 20:05:35,368 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 151 transitions, 1462 flow
[2024-06-20 20:05:35,368 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:35,369 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:05:35,369 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:05:35,369 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-20 20:05:35,369 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:05:35,369 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:05:35,385 INFO  L85        PathProgramCache]: Analyzing trace with hash -524773268, now seen corresponding path program 4 times
[2024-06-20 20:05:35,385 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:05:35,385 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329092185]
[2024-06-20 20:05:35,385 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:05:35,385 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:05:35,452 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:05:44,785 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:05:44,785 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:05:44,786 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329092185]
[2024-06-20 20:05:44,786 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329092185] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:05:44,786 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:05:44,786 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:05:44,786 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417937584]
[2024-06-20 20:05:44,786 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:05:44,786 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:05:44,787 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:05:44,787 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:05:44,787 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:05:44,927 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:05:44,928 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 151 transitions, 1462 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:44,928 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:05:44,929 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:05:44,929 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:05:46,310 INFO  L124   PetriNetUnfolderBase]: 1901/2925 cut-off events.
[2024-06-20 20:05:46,311 INFO  L125   PetriNetUnfolderBase]: For 104412/104412 co-relation queries the response was YES.
[2024-06-20 20:05:46,319 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19530 conditions, 2925 events. 1901/2925 cut-off events. For 104412/104412 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 14834 event pairs, 415 based on Foata normal form. 4/2927 useless extension candidates. Maximal degree in co-relation 19470. Up to 2461 conditions per place. 
[2024-06-20 20:05:46,327 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 135 selfloop transitions, 58 changer transitions 0/198 dead transitions.
[2024-06-20 20:05:46,327 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 198 transitions, 2132 flow
[2024-06-20 20:05:46,329 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 20:05:46,329 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 20:05:46,329 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions.
[2024-06-20 20:05:46,330 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43506493506493504
[2024-06-20 20:05:46,330 INFO  L175             Difference]: Start difference. First operand has 132 places, 151 transitions, 1462 flow. Second operand 11 states and 201 transitions.
[2024-06-20 20:05:46,330 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 198 transitions, 2132 flow
[2024-06-20 20:05:46,393 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 198 transitions, 2017 flow, removed 23 selfloop flow, removed 8 redundant places.
[2024-06-20 20:05:46,396 INFO  L231             Difference]: Finished difference. Result has 135 places, 154 transitions, 1519 flow
[2024-06-20 20:05:46,396 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1347, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1519, PETRI_PLACES=135, PETRI_TRANSITIONS=154}
[2024-06-20 20:05:46,396 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 92 predicate places.
[2024-06-20 20:05:46,397 INFO  L495      AbstractCegarLoop]: Abstraction has has 135 places, 154 transitions, 1519 flow
[2024-06-20 20:05:46,397 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:46,397 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:05:46,397 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:05:46,398 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-20 20:05:46,398 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:05:46,398 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:05:46,398 INFO  L85        PathProgramCache]: Analyzing trace with hash -178120596, now seen corresponding path program 5 times
[2024-06-20 20:05:46,398 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:05:46,398 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292626634]
[2024-06-20 20:05:46,398 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:05:46,399 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:05:46,483 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:05:54,226 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:05:54,226 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:05:54,226 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292626634]
[2024-06-20 20:05:54,226 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292626634] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:05:54,226 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:05:54,226 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:05:54,227 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388975727]
[2024-06-20 20:05:54,227 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:05:54,227 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:05:54,227 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:05:54,227 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:05:54,228 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:05:54,391 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:05:54,392 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 154 transitions, 1519 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:54,392 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:05:54,392 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:05:54,392 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:05:55,707 INFO  L124   PetriNetUnfolderBase]: 1923/2979 cut-off events.
[2024-06-20 20:05:55,707 INFO  L125   PetriNetUnfolderBase]: For 110152/110152 co-relation queries the response was YES.
[2024-06-20 20:05:55,716 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19915 conditions, 2979 events. 1923/2979 cut-off events. For 110152/110152 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 15310 event pairs, 442 based on Foata normal form. 4/2977 useless extension candidates. Maximal degree in co-relation 19854. Up to 2480 conditions per place. 
[2024-06-20 20:05:55,724 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 134 selfloop transitions, 62 changer transitions 0/201 dead transitions.
[2024-06-20 20:05:55,724 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 201 transitions, 2207 flow
[2024-06-20 20:05:55,726 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:05:55,726 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:05:55,726 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions.
[2024-06-20 20:05:55,726 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45476190476190476
[2024-06-20 20:05:55,726 INFO  L175             Difference]: Start difference. First operand has 135 places, 154 transitions, 1519 flow. Second operand 10 states and 191 transitions.
[2024-06-20 20:05:55,727 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 201 transitions, 2207 flow
[2024-06-20 20:05:55,786 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 201 transitions, 2061 flow, removed 26 selfloop flow, removed 8 redundant places.
[2024-06-20 20:05:55,789 INFO  L231             Difference]: Finished difference. Result has 137 places, 157 transitions, 1559 flow
[2024-06-20 20:05:55,789 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1384, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1559, PETRI_PLACES=137, PETRI_TRANSITIONS=157}
[2024-06-20 20:05:55,789 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 94 predicate places.
[2024-06-20 20:05:55,789 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 157 transitions, 1559 flow
[2024-06-20 20:05:55,789 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:55,790 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:05:55,790 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:05:55,790 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-20 20:05:55,790 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-20 20:05:55,790 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:05:55,790 INFO  L85        PathProgramCache]: Analyzing trace with hash -809873138, now seen corresponding path program 6 times
[2024-06-20 20:05:55,790 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:05:55,791 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937136414]
[2024-06-20 20:05:55,791 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:05:55,791 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:05:55,857 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:06:04,768 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:06:04,769 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:06:04,769 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937136414]
[2024-06-20 20:06:04,769 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937136414] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:06:04,769 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:06:04,769 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:06:04,769 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549285298]
[2024-06-20 20:06:04,770 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:06:04,771 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:06:04,772 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:06:04,772 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:06:04,773 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:06:04,924 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:06:04,924 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 157 transitions, 1559 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:04,924 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:06:04,924 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:06:04,924 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:06:06,166 INFO  L124   PetriNetUnfolderBase]: 1913/2963 cut-off events.
[2024-06-20 20:06:06,166 INFO  L125   PetriNetUnfolderBase]: For 113994/113994 co-relation queries the response was YES.
[2024-06-20 20:06:06,175 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19832 conditions, 2963 events. 1913/2963 cut-off events. For 113994/113994 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 15171 event pairs, 408 based on Foata normal form. 4/2965 useless extension candidates. Maximal degree in co-relation 19770. Up to 2472 conditions per place. 
[2024-06-20 20:06:06,184 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 135 selfloop transitions, 57 changer transitions 0/197 dead transitions.
[2024-06-20 20:06:06,184 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 197 transitions, 2063 flow
[2024-06-20 20:06:06,186 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:06:06,186 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:06:06,186 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions.
[2024-06-20 20:06:06,187 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-20 20:06:06,187 INFO  L175             Difference]: Start difference. First operand has 137 places, 157 transitions, 1559 flow. Second operand 10 states and 189 transitions.
[2024-06-20 20:06:06,187 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 197 transitions, 2063 flow
[2024-06-20 20:06:06,288 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 197 transitions, 1886 flow, removed 30 selfloop flow, removed 7 redundant places.
[2024-06-20 20:06:06,290 INFO  L231             Difference]: Finished difference. Result has 140 places, 157 transitions, 1504 flow
[2024-06-20 20:06:06,290 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1382, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1504, PETRI_PLACES=140, PETRI_TRANSITIONS=157}
[2024-06-20 20:06:06,291 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 97 predicate places.
[2024-06-20 20:06:06,291 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 157 transitions, 1504 flow
[2024-06-20 20:06:06,291 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:06,291 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:06:06,291 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:06:06,291 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-20 20:06:06,291 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-20 20:06:06,292 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:06:06,292 INFO  L85        PathProgramCache]: Analyzing trace with hash -514645010, now seen corresponding path program 2 times
[2024-06-20 20:06:06,292 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:06:06,292 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124928917]
[2024-06-20 20:06:06,292 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:06:06,292 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:06:06,343 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:06:14,756 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:06:14,757 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:06:14,757 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124928917]
[2024-06-20 20:06:14,757 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124928917] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:06:14,757 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:06:14,757 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:06:14,757 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033921205]
[2024-06-20 20:06:14,757 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:06:14,758 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:06:14,758 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:06:14,758 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:06:14,758 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:06:14,869 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:06:14,872 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 157 transitions, 1504 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:14,872 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:06:14,872 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:06:14,872 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:06:16,143 INFO  L124   PetriNetUnfolderBase]: 1930/3002 cut-off events.
[2024-06-20 20:06:16,144 INFO  L125   PetriNetUnfolderBase]: For 120241/120241 co-relation queries the response was YES.
[2024-06-20 20:06:16,154 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20055 conditions, 3002 events. 1930/3002 cut-off events. For 120241/120241 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 15474 event pairs, 517 based on Foata normal form. 4/2999 useless extension candidates. Maximal degree in co-relation 19992. Up to 2692 conditions per place. 
[2024-06-20 20:06:16,163 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 143 selfloop transitions, 37 changer transitions 0/185 dead transitions.
[2024-06-20 20:06:16,163 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 185 transitions, 1986 flow
[2024-06-20 20:06:16,165 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:06:16,165 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:06:16,165 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions.
[2024-06-20 20:06:16,165 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43154761904761907
[2024-06-20 20:06:16,165 INFO  L175             Difference]: Start difference. First operand has 140 places, 157 transitions, 1504 flow. Second operand 8 states and 145 transitions.
[2024-06-20 20:06:16,165 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 185 transitions, 1986 flow
[2024-06-20 20:06:16,229 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 185 transitions, 1840 flow, removed 0 selfloop flow, removed 10 redundant places.
[2024-06-20 20:06:16,231 INFO  L231             Difference]: Finished difference. Result has 138 places, 159 transitions, 1489 flow
[2024-06-20 20:06:16,231 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1358, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1489, PETRI_PLACES=138, PETRI_TRANSITIONS=159}
[2024-06-20 20:06:16,231 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 95 predicate places.
[2024-06-20 20:06:16,231 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 159 transitions, 1489 flow
[2024-06-20 20:06:16,231 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:16,232 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:06:16,232 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:06:16,232 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-20 20:06:16,232 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-20 20:06:16,232 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:06:16,232 INFO  L85        PathProgramCache]: Analyzing trace with hash 58541712, now seen corresponding path program 3 times
[2024-06-20 20:06:16,232 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:06:16,233 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011840374]
[2024-06-20 20:06:16,233 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:06:16,233 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:06:16,295 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:06:25,779 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:06:25,779 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:06:25,780 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011840374]
[2024-06-20 20:06:25,780 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011840374] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:06:25,780 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:06:25,780 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:06:25,780 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416320467]
[2024-06-20 20:06:25,780 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:06:25,780 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:06:25,781 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:06:25,781 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:06:25,781 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:06:25,925 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:06:25,925 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 159 transitions, 1489 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-20 20:06:25,925 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:06:25,925 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:06:25,925 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:06:27,126 INFO  L124   PetriNetUnfolderBase]: 1947/3027 cut-off events.
[2024-06-20 20:06:27,127 INFO  L125   PetriNetUnfolderBase]: For 127760/127760 co-relation queries the response was YES.
[2024-06-20 20:06:27,137 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20451 conditions, 3027 events. 1947/3027 cut-off events. For 127760/127760 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 15692 event pairs, 487 based on Foata normal form. 4/3024 useless extension candidates. Maximal degree in co-relation 20387. Up to 2636 conditions per place. 
[2024-06-20 20:06:27,147 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 142 selfloop transitions, 44 changer transitions 0/191 dead transitions.
[2024-06-20 20:06:27,147 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 191 transitions, 2163 flow
[2024-06-20 20:06:27,149 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:06:27,149 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:06:27,150 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions.
[2024-06-20 20:06:27,150 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4375
[2024-06-20 20:06:27,150 INFO  L175             Difference]: Start difference. First operand has 138 places, 159 transitions, 1489 flow. Second operand 8 states and 147 transitions.
[2024-06-20 20:06:27,150 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 191 transitions, 2163 flow
[2024-06-20 20:06:27,228 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 191 transitions, 2050 flow, removed 21 selfloop flow, removed 6 redundant places.
[2024-06-20 20:06:27,230 INFO  L231             Difference]: Finished difference. Result has 140 places, 163 transitions, 1575 flow
[2024-06-20 20:06:27,230 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1376, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1575, PETRI_PLACES=140, PETRI_TRANSITIONS=163}
[2024-06-20 20:06:27,231 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 97 predicate places.
[2024-06-20 20:06:27,231 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 163 transitions, 1575 flow
[2024-06-20 20:06:27,231 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-20 20:06:27,231 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:06:27,231 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:06:27,231 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-20 20:06:27,232 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-20 20:06:27,232 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:06:27,232 INFO  L85        PathProgramCache]: Analyzing trace with hash 50199612, now seen corresponding path program 4 times
[2024-06-20 20:06:27,232 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:06:27,232 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147655844]
[2024-06-20 20:06:27,232 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:06:27,232 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:06:27,301 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:06:35,708 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:06:35,708 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:06:35,709 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147655844]
[2024-06-20 20:06:35,709 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147655844] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:06:35,709 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:06:35,709 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:06:35,709 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129419832]
[2024-06-20 20:06:35,709 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:06:35,710 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:06:35,711 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:06:35,711 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:06:35,711 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:06:35,836 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:06:35,836 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 163 transitions, 1575 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-20 20:06:35,836 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:06:35,837 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:06:35,837 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:06:37,324 INFO  L124   PetriNetUnfolderBase]: 1939/3015 cut-off events.
[2024-06-20 20:06:37,324 INFO  L125   PetriNetUnfolderBase]: For 132728/132728 co-relation queries the response was YES.
[2024-06-20 20:06:37,333 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20528 conditions, 3015 events. 1939/3015 cut-off events. For 132728/132728 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 15488 event pairs, 515 based on Foata normal form. 4/3012 useless extension candidates. Maximal degree in co-relation 20463. Up to 2707 conditions per place. 
[2024-06-20 20:06:37,342 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 149 selfloop transitions, 37 changer transitions 0/191 dead transitions.
[2024-06-20 20:06:37,342 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 191 transitions, 2029 flow
[2024-06-20 20:06:37,344 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:06:37,344 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:06:37,344 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions.
[2024-06-20 20:06:37,344 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44047619047619047
[2024-06-20 20:06:37,345 INFO  L175             Difference]: Start difference. First operand has 140 places, 163 transitions, 1575 flow. Second operand 8 states and 148 transitions.
[2024-06-20 20:06:37,345 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 191 transitions, 2029 flow
[2024-06-20 20:06:37,436 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 191 transitions, 1905 flow, removed 41 selfloop flow, removed 4 redundant places.
[2024-06-20 20:06:37,438 INFO  L231             Difference]: Finished difference. Result has 144 places, 163 transitions, 1532 flow
[2024-06-20 20:06:37,438 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1451, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1532, PETRI_PLACES=144, PETRI_TRANSITIONS=163}
[2024-06-20 20:06:37,438 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 101 predicate places.
[2024-06-20 20:06:37,438 INFO  L495      AbstractCegarLoop]: Abstraction has has 144 places, 163 transitions, 1532 flow
[2024-06-20 20:06:37,439 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-20 20:06:37,439 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:06:37,439 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:06:37,439 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-20 20:06:37,439 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:06:37,439 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:06:37,440 INFO  L85        PathProgramCache]: Analyzing trace with hash 571253225, now seen corresponding path program 1 times
[2024-06-20 20:06:37,440 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:06:37,440 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109785444]
[2024-06-20 20:06:37,440 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:06:37,440 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:06:37,478 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:06:46,121 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:06:46,122 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:06:46,122 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109785444]
[2024-06-20 20:06:46,122 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109785444] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:06:46,122 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:06:46,122 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:06:46,122 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035911011]
[2024-06-20 20:06:46,122 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:06:46,124 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:06:46,124 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:06:46,125 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:06:46,125 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:06:46,279 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:06:46,280 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 163 transitions, 1532 flow. Second operand  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:46,280 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:06:46,280 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:06:46,280 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:06:47,331 INFO  L124   PetriNetUnfolderBase]: 1936/2999 cut-off events.
[2024-06-20 20:06:47,331 INFO  L125   PetriNetUnfolderBase]: For 135895/135895 co-relation queries the response was YES.
[2024-06-20 20:06:47,342 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20582 conditions, 2999 events. 1936/2999 cut-off events. For 135895/135895 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 15401 event pairs, 608 based on Foata normal form. 1/2998 useless extension candidates. Maximal degree in co-relation 20515. Up to 2860 conditions per place. 
[2024-06-20 20:06:47,351 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 153 selfloop transitions, 17 changer transitions 0/175 dead transitions.
[2024-06-20 20:06:47,352 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 175 transitions, 1908 flow
[2024-06-20 20:06:47,352 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 20:06:47,352 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 20:06:47,353 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions.
[2024-06-20 20:06:47,353 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2024-06-20 20:06:47,353 INFO  L175             Difference]: Start difference. First operand has 144 places, 163 transitions, 1532 flow. Second operand 6 states and 105 transitions.
[2024-06-20 20:06:47,353 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 175 transitions, 1908 flow
[2024-06-20 20:06:47,457 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 175 transitions, 1801 flow, removed 12 selfloop flow, removed 7 redundant places.
[2024-06-20 20:06:47,459 INFO  L231             Difference]: Finished difference. Result has 143 places, 163 transitions, 1469 flow
[2024-06-20 20:06:47,459 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1425, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1469, PETRI_PLACES=143, PETRI_TRANSITIONS=163}
[2024-06-20 20:06:47,459 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 100 predicate places.
[2024-06-20 20:06:47,459 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 163 transitions, 1469 flow
[2024-06-20 20:06:47,460 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:47,460 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:06:47,460 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:06:47,460 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-20 20:06:47,460 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-20 20:06:47,460 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:06:47,460 INFO  L85        PathProgramCache]: Analyzing trace with hash 571259022, now seen corresponding path program 1 times
[2024-06-20 20:06:47,461 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:06:47,461 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460991133]
[2024-06-20 20:06:47,461 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:06:47,461 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:06:47,495 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:06:56,292 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:06:56,293 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:06:56,293 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460991133]
[2024-06-20 20:06:56,293 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460991133] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:06:56,293 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:06:56,293 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:06:56,293 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177945053]
[2024-06-20 20:06:56,293 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:06:56,294 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:06:56,294 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:06:56,294 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:06:56,294 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:06:56,441 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:06:56,441 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 163 transitions, 1469 flow. Second operand  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:56,442 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:06:56,442 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:06:56,442 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:06:57,453 INFO  L124   PetriNetUnfolderBase]: 1992/3089 cut-off events.
[2024-06-20 20:06:57,453 INFO  L125   PetriNetUnfolderBase]: For 146866/146869 co-relation queries the response was YES.
[2024-06-20 20:06:57,464 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21239 conditions, 3089 events. 1992/3089 cut-off events. For 146866/146869 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 15938 event pairs, 587 based on Foata normal form. 6/3086 useless extension candidates. Maximal degree in co-relation 21171. Up to 2825 conditions per place. 
[2024-06-20 20:06:57,483 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 147 selfloop transitions, 39 changer transitions 0/191 dead transitions.
[2024-06-20 20:06:57,483 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 191 transitions, 2118 flow
[2024-06-20 20:06:57,484 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:06:57,484 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:06:57,489 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions.
[2024-06-20 20:06:57,489 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42517006802721086
[2024-06-20 20:06:57,489 INFO  L175             Difference]: Start difference. First operand has 143 places, 163 transitions, 1469 flow. Second operand 7 states and 125 transitions.
[2024-06-20 20:06:57,490 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 191 transitions, 2118 flow
[2024-06-20 20:06:57,581 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 191 transitions, 2074 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-06-20 20:06:57,583 INFO  L231             Difference]: Finished difference. Result has 147 places, 176 transitions, 1701 flow
[2024-06-20 20:06:57,583 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1425, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1701, PETRI_PLACES=147, PETRI_TRANSITIONS=176}
[2024-06-20 20:06:57,584 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 104 predicate places.
[2024-06-20 20:06:57,584 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 176 transitions, 1701 flow
[2024-06-20 20:06:57,585 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:57,585 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:06:57,585 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:06:57,585 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-20 20:06:57,585 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-20 20:06:57,585 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:06:57,585 INFO  L85        PathProgramCache]: Analyzing trace with hash -1813460756, now seen corresponding path program 2 times
[2024-06-20 20:06:57,585 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:06:57,586 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506052350]
[2024-06-20 20:06:57,586 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:06:57,586 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:06:57,623 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:07:06,585 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:07:06,585 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:07:06,585 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506052350]
[2024-06-20 20:07:06,586 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506052350] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:07:06,586 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:07:06,586 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:07:06,586 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604654203]
[2024-06-20 20:07:06,586 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:07:06,586 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:07:06,586 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:07:06,587 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:07:06,587 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:07:06,715 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:07:06,716 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 176 transitions, 1701 flow. Second operand  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:06,716 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:07:06,716 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:07:06,716 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:07:07,707 INFO  L124   PetriNetUnfolderBase]: 2064/3200 cut-off events.
[2024-06-20 20:07:07,707 INFO  L125   PetriNetUnfolderBase]: For 165537/165540 co-relation queries the response was YES.
[2024-06-20 20:07:07,718 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23055 conditions, 3200 events. 2064/3200 cut-off events. For 165537/165540 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 16580 event pairs, 589 based on Foata normal form. 10/3199 useless extension candidates. Maximal degree in co-relation 22984. Up to 2704 conditions per place. 
[2024-06-20 20:07:07,729 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 155 selfloop transitions, 59 changer transitions 0/219 dead transitions.
[2024-06-20 20:07:07,730 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 219 transitions, 2699 flow
[2024-06-20 20:07:07,731 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:07:07,731 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:07:07,731 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions.
[2024-06-20 20:07:07,731 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4421768707482993
[2024-06-20 20:07:07,731 INFO  L175             Difference]: Start difference. First operand has 147 places, 176 transitions, 1701 flow. Second operand 7 states and 130 transitions.
[2024-06-20 20:07:07,731 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 219 transitions, 2699 flow
[2024-06-20 20:07:07,829 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 219 transitions, 2613 flow, removed 42 selfloop flow, removed 1 redundant places.
[2024-06-20 20:07:07,831 INFO  L231             Difference]: Finished difference. Result has 155 places, 196 transitions, 2099 flow
[2024-06-20 20:07:07,832 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1623, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2099, PETRI_PLACES=155, PETRI_TRANSITIONS=196}
[2024-06-20 20:07:07,832 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 112 predicate places.
[2024-06-20 20:07:07,832 INFO  L495      AbstractCegarLoop]: Abstraction has has 155 places, 196 transitions, 2099 flow
[2024-06-20 20:07:07,832 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:07,832 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:07:07,832 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:07:07,833 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-20 20:07:07,833 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:07:07,833 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:07:07,833 INFO  L85        PathProgramCache]: Analyzing trace with hash -1813727666, now seen corresponding path program 3 times
[2024-06-20 20:07:07,833 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:07:07,833 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711751447]
[2024-06-20 20:07:07,833 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:07:07,834 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:07:07,868 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:07:16,411 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:07:16,412 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:07:16,412 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711751447]
[2024-06-20 20:07:16,412 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711751447] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:07:16,412 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:07:16,412 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:07:16,412 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163508069]
[2024-06-20 20:07:16,412 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:07:16,412 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:07:16,413 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:07:16,413 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:07:16,413 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:07:16,574 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:07:16,574 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 196 transitions, 2099 flow. Second operand  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:16,574 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:07:16,574 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:07:16,574 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:07:17,662 INFO  L124   PetriNetUnfolderBase]: 2104/3253 cut-off events.
[2024-06-20 20:07:17,662 INFO  L125   PetriNetUnfolderBase]: For 173444/173447 co-relation queries the response was YES.
[2024-06-20 20:07:17,673 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24402 conditions, 3253 events. 2104/3253 cut-off events. For 173444/173447 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16854 event pairs, 609 based on Foata normal form. 6/3248 useless extension candidates. Maximal degree in co-relation 24326. Up to 2739 conditions per place. 
[2024-06-20 20:07:17,685 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 162 selfloop transitions, 60 changer transitions 0/227 dead transitions.
[2024-06-20 20:07:17,685 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 227 transitions, 2998 flow
[2024-06-20 20:07:17,686 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:07:17,686 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:07:17,686 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions.
[2024-06-20 20:07:17,686 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4387755102040816
[2024-06-20 20:07:17,687 INFO  L175             Difference]: Start difference. First operand has 155 places, 196 transitions, 2099 flow. Second operand 7 states and 129 transitions.
[2024-06-20 20:07:17,687 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 227 transitions, 2998 flow
[2024-06-20 20:07:17,824 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 227 transitions, 2852 flow, removed 61 selfloop flow, removed 2 redundant places.
[2024-06-20 20:07:17,827 INFO  L231             Difference]: Finished difference. Result has 162 places, 210 transitions, 2381 flow
[2024-06-20 20:07:17,827 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1981, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2381, PETRI_PLACES=162, PETRI_TRANSITIONS=210}
[2024-06-20 20:07:17,827 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 119 predicate places.
[2024-06-20 20:07:17,827 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 210 transitions, 2381 flow
[2024-06-20 20:07:17,827 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:17,828 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:07:17,828 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:07:17,828 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-20 20:07:17,828 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:07:17,828 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:07:17,828 INFO  L85        PathProgramCache]: Analyzing trace with hash -1813450836, now seen corresponding path program 1 times
[2024-06-20 20:07:17,828 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:07:17,829 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369820915]
[2024-06-20 20:07:17,829 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:07:17,829 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:07:17,868 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:07:27,286 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:07:27,286 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:07:27,287 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369820915]
[2024-06-20 20:07:27,287 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369820915] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:07:27,287 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:07:27,287 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:07:27,287 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701264630]
[2024-06-20 20:07:27,287 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:07:27,287 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:07:27,288 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:07:27,288 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:07:27,288 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:07:27,442 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:07:27,442 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 210 transitions, 2381 flow. Second operand  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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-20 20:07:27,442 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:07:27,443 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:07:27,443 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:07:28,571 INFO  L124   PetriNetUnfolderBase]: 2148/3318 cut-off events.
[2024-06-20 20:07:28,572 INFO  L125   PetriNetUnfolderBase]: For 186138/186138 co-relation queries the response was YES.
[2024-06-20 20:07:28,584 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25078 conditions, 3318 events. 2148/3318 cut-off events. For 186138/186138 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 17164 event pairs, 598 based on Foata normal form. 14/3325 useless extension candidates. Maximal degree in co-relation 24998. Up to 3048 conditions per place. 
[2024-06-20 20:07:28,595 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 176 selfloop transitions, 52 changer transitions 0/233 dead transitions.
[2024-06-20 20:07:28,596 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 233 transitions, 3018 flow
[2024-06-20 20:07:28,596 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:07:28,596 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:07:28,597 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions.
[2024-06-20 20:07:28,597 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41369047619047616
[2024-06-20 20:07:28,597 INFO  L175             Difference]: Start difference. First operand has 162 places, 210 transitions, 2381 flow. Second operand 8 states and 139 transitions.
[2024-06-20 20:07:28,597 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 233 transitions, 3018 flow
[2024-06-20 20:07:28,740 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 233 transitions, 2897 flow, removed 30 selfloop flow, removed 3 redundant places.
[2024-06-20 20:07:28,743 INFO  L231             Difference]: Finished difference. Result has 168 places, 216 transitions, 2476 flow
[2024-06-20 20:07:28,743 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2262, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2476, PETRI_PLACES=168, PETRI_TRANSITIONS=216}
[2024-06-20 20:07:28,744 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 125 predicate places.
[2024-06-20 20:07:28,744 INFO  L495      AbstractCegarLoop]: Abstraction has has 168 places, 216 transitions, 2476 flow
[2024-06-20 20:07:28,744 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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-20 20:07:28,744 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:07:28,744 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:07:28,745 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-20 20:07:28,745 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:07:28,745 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:07:28,745 INFO  L85        PathProgramCache]: Analyzing trace with hash -1686539331, now seen corresponding path program 1 times
[2024-06-20 20:07:28,745 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:07:28,745 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107395700]
[2024-06-20 20:07:28,745 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:07:28,746 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:07:28,810 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:07:38,239 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:07:38,240 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:07:38,241 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107395700]
[2024-06-20 20:07:38,241 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107395700] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:07:38,241 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:07:38,241 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:07:38,241 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211839049]
[2024-06-20 20:07:38,241 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:07:38,242 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:07:38,242 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:07:38,243 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:07:38,243 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:07:38,361 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:07:38,361 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 216 transitions, 2476 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:38,361 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:07:38,361 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:07:38,362 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:07:39,472 INFO  L124   PetriNetUnfolderBase]: 2141/3315 cut-off events.
[2024-06-20 20:07:39,473 INFO  L125   PetriNetUnfolderBase]: For 182640/182640 co-relation queries the response was YES.
[2024-06-20 20:07:39,485 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25169 conditions, 3315 events. 2141/3315 cut-off events. For 182640/182640 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 17281 event pairs, 594 based on Foata normal form. 1/3314 useless extension candidates. Maximal degree in co-relation 25087. Up to 3130 conditions per place. 
[2024-06-20 20:07:39,497 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 209 selfloop transitions, 22 changer transitions 0/236 dead transitions.
[2024-06-20 20:07:39,497 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 236 transitions, 3000 flow
[2024-06-20 20:07:39,498 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:07:39,498 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:07:39,498 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions.
[2024-06-20 20:07:39,499 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42517006802721086
[2024-06-20 20:07:39,499 INFO  L175             Difference]: Start difference. First operand has 168 places, 216 transitions, 2476 flow. Second operand 7 states and 125 transitions.
[2024-06-20 20:07:39,499 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 236 transitions, 3000 flow
[2024-06-20 20:07:39,640 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 236 transitions, 2859 flow, removed 26 selfloop flow, removed 5 redundant places.
[2024-06-20 20:07:39,643 INFO  L231             Difference]: Finished difference. Result has 170 places, 216 transitions, 2385 flow
[2024-06-20 20:07:39,643 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2335, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2385, PETRI_PLACES=170, PETRI_TRANSITIONS=216}
[2024-06-20 20:07:39,643 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 127 predicate places.
[2024-06-20 20:07:39,644 INFO  L495      AbstractCegarLoop]: Abstraction has has 170 places, 216 transitions, 2385 flow
[2024-06-20 20:07:39,644 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:39,644 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:07:39,644 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:07:39,644 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-20 20:07:39,644 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:07:39,644 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:07:39,645 INFO  L85        PathProgramCache]: Analyzing trace with hash -825996923, now seen corresponding path program 1 times
[2024-06-20 20:07:39,645 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:07:39,645 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024232161]
[2024-06-20 20:07:39,645 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:07:39,645 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:07:39,687 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:07:48,015 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:07:48,015 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:07:48,015 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024232161]
[2024-06-20 20:07:48,015 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024232161] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:07:48,015 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:07:48,015 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:07:48,015 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866760571]
[2024-06-20 20:07:48,015 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:07:48,016 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:07:48,016 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:07:48,016 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:07:48,016 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:07:48,146 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:07:48,146 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 216 transitions, 2385 flow. Second operand  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:48,146 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:07:48,146 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:07:48,147 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:07:49,342 INFO  L124   PetriNetUnfolderBase]: 2151/3329 cut-off events.
[2024-06-20 20:07:49,343 INFO  L125   PetriNetUnfolderBase]: For 190006/190009 co-relation queries the response was YES.
[2024-06-20 20:07:49,354 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25185 conditions, 3329 events. 2151/3329 cut-off events. For 190006/190009 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 17334 event pairs, 597 based on Foata normal form. 4/3329 useless extension candidates. Maximal degree in co-relation 25102. Up to 3098 conditions per place. 
[2024-06-20 20:07:49,369 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 199 selfloop transitions, 34 changer transitions 0/238 dead transitions.
[2024-06-20 20:07:49,369 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 238 transitions, 2968 flow
[2024-06-20 20:07:49,370 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:07:49,370 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:07:49,371 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions.
[2024-06-20 20:07:49,371 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43197278911564624
[2024-06-20 20:07:49,371 INFO  L175             Difference]: Start difference. First operand has 170 places, 216 transitions, 2385 flow. Second operand 7 states and 127 transitions.
[2024-06-20 20:07:49,371 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 238 transitions, 2968 flow
[2024-06-20 20:07:49,534 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 238 transitions, 2854 flow, removed 7 selfloop flow, removed 7 redundant places.
[2024-06-20 20:07:49,536 INFO  L231             Difference]: Finished difference. Result has 171 places, 220 transitions, 2422 flow
[2024-06-20 20:07:49,537 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2271, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2422, PETRI_PLACES=171, PETRI_TRANSITIONS=220}
[2024-06-20 20:07:49,537 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 128 predicate places.
[2024-06-20 20:07:49,545 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 220 transitions, 2422 flow
[2024-06-20 20:07:49,545 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:49,545 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:07:49,546 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:07:49,546 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-20 20:07:49,546 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-20 20:07:49,546 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:07:49,546 INFO  L85        PathProgramCache]: Analyzing trace with hash -325274495, now seen corresponding path program 2 times
[2024-06-20 20:07:49,546 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:07:49,546 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945668572]
[2024-06-20 20:07:49,546 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:07:49,547 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:07:49,582 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:07:58,698 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:07:58,699 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:07:58,699 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945668572]
[2024-06-20 20:07:58,699 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945668572] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:07:58,699 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:07:58,699 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:07:58,699 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888322485]
[2024-06-20 20:07:58,699 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:07:58,700 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:07:58,700 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:07:58,700 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:07:58,700 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:07:58,844 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:07:58,845 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 220 transitions, 2422 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:58,845 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:07:58,845 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:07:58,845 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:07:59,973 INFO  L124   PetriNetUnfolderBase]: 2185/3385 cut-off events.
[2024-06-20 20:07:59,973 INFO  L125   PetriNetUnfolderBase]: For 201595/201598 co-relation queries the response was YES.
[2024-06-20 20:07:59,987 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25925 conditions, 3385 events. 2185/3385 cut-off events. For 201595/201598 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 17809 event pairs, 597 based on Foata normal form. 4/3385 useless extension candidates. Maximal degree in co-relation 25841. Up to 3111 conditions per place. 
[2024-06-20 20:07:59,999 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 196 selfloop transitions, 45 changer transitions 0/246 dead transitions.
[2024-06-20 20:08:00,000 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 246 transitions, 3210 flow
[2024-06-20 20:08:00,001 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:08:00,001 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:08:00,001 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions.
[2024-06-20 20:08:00,001 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43197278911564624
[2024-06-20 20:08:00,001 INFO  L175             Difference]: Start difference. First operand has 171 places, 220 transitions, 2422 flow. Second operand 7 states and 127 transitions.
[2024-06-20 20:08:00,002 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 246 transitions, 3210 flow
[2024-06-20 20:08:00,178 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 246 transitions, 3147 flow, removed 14 selfloop flow, removed 3 redundant places.
[2024-06-20 20:08:00,181 INFO  L231             Difference]: Finished difference. Result has 176 places, 229 transitions, 2665 flow
[2024-06-20 20:08:00,181 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2359, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2665, PETRI_PLACES=176, PETRI_TRANSITIONS=229}
[2024-06-20 20:08:00,182 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 133 predicate places.
[2024-06-20 20:08:00,182 INFO  L495      AbstractCegarLoop]: Abstraction has has 176 places, 229 transitions, 2665 flow
[2024-06-20 20:08:00,182 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:08:00,182 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:08:00,182 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:08:00,182 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-20 20:08:00,183 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-20 20:08:00,183 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:08:00,183 INFO  L85        PathProgramCache]: Analyzing trace with hash 747121215, now seen corresponding path program 3 times
[2024-06-20 20:08:00,183 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:08:00,183 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146922970]
[2024-06-20 20:08:00,183 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:08:00,183 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:08:00,218 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:08:09,363 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:08:09,363 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:08:09,364 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146922970]
[2024-06-20 20:08:09,364 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146922970] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:08:09,364 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:08:09,364 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:08:09,364 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064111219]
[2024-06-20 20:08:09,364 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:08:09,364 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:08:09,365 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:08:09,365 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:08:09,365 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:08:09,521 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:08:09,521 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 229 transitions, 2665 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:08:09,521 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:08:09,522 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:08:09,522 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:08:10,618 INFO  L124   PetriNetUnfolderBase]: 2179/3373 cut-off events.
[2024-06-20 20:08:10,618 INFO  L125   PetriNetUnfolderBase]: For 208335/208335 co-relation queries the response was YES.
[2024-06-20 20:08:10,634 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26122 conditions, 3373 events. 2179/3373 cut-off events. For 208335/208335 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 17665 event pairs, 601 based on Foata normal form. 2/3373 useless extension candidates. Maximal degree in co-relation 26036. Up to 3199 conditions per place. 
[2024-06-20 20:08:10,647 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 225 selfloop transitions, 19 changer transitions 0/249 dead transitions.
[2024-06-20 20:08:10,647 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 249 transitions, 3213 flow
[2024-06-20 20:08:10,648 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:08:10,648 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:08:10,649 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions.
[2024-06-20 20:08:10,649 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3862433862433862
[2024-06-20 20:08:10,649 INFO  L175             Difference]: Start difference. First operand has 176 places, 229 transitions, 2665 flow. Second operand 9 states and 146 transitions.
[2024-06-20 20:08:10,649 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 249 transitions, 3213 flow
[2024-06-20 20:08:10,884 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 249 transitions, 3115 flow, removed 18 selfloop flow, removed 4 redundant places.
[2024-06-20 20:08:10,897 INFO  L231             Difference]: Finished difference. Result has 181 places, 229 transitions, 2611 flow
[2024-06-20 20:08:10,903 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2567, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2611, PETRI_PLACES=181, PETRI_TRANSITIONS=229}
[2024-06-20 20:08:10,904 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 138 predicate places.
[2024-06-20 20:08:10,904 INFO  L495      AbstractCegarLoop]: Abstraction has has 181 places, 229 transitions, 2611 flow
[2024-06-20 20:08:10,904 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:08:10,905 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:08:10,905 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:08:10,905 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-20 20:08:10,905 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:08:10,906 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:08:10,906 INFO  L85        PathProgramCache]: Analyzing trace with hash -803238273, now seen corresponding path program 4 times
[2024-06-20 20:08:10,906 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:08:10,907 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239931140]
[2024-06-20 20:08:10,907 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:08:10,907 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:08:10,947 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:08:19,998 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:08:19,999 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:08:19,999 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239931140]
[2024-06-20 20:08:19,999 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239931140] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:08:19,999 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:08:19,999 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:08:19,999 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906105]
[2024-06-20 20:08:19,999 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:08:19,999 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:08:19,999 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:08:19,999 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:08:20,000 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:08:20,180 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:08:20,181 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 229 transitions, 2611 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:08:20,181 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:08:20,181 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:08:20,181 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:08:21,374 INFO  L124   PetriNetUnfolderBase]: 2163/3357 cut-off events.
[2024-06-20 20:08:21,374 INFO  L125   PetriNetUnfolderBase]: For 213824/213827 co-relation queries the response was YES.
[2024-06-20 20:08:21,389 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25860 conditions, 3357 events. 2163/3357 cut-off events. For 213824/213827 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 17610 event pairs, 594 based on Foata normal form. 6/3360 useless extension candidates. Maximal degree in co-relation 25773. Up to 3063 conditions per place. 
[2024-06-20 20:08:21,401 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 200 selfloop transitions, 48 changer transitions 0/253 dead transitions.
[2024-06-20 20:08:21,401 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 253 transitions, 3179 flow
[2024-06-20 20:08:21,402 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:08:21,402 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:08:21,402 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions.
[2024-06-20 20:08:21,402 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41798941798941797
[2024-06-20 20:08:21,402 INFO  L175             Difference]: Start difference. First operand has 181 places, 229 transitions, 2611 flow. Second operand 9 states and 158 transitions.
[2024-06-20 20:08:21,403 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 253 transitions, 3179 flow
[2024-06-20 20:08:21,606 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 253 transitions, 3064 flow, removed 26 selfloop flow, removed 10 redundant places.
[2024-06-20 20:08:21,609 INFO  L231             Difference]: Finished difference. Result has 180 places, 229 transitions, 2600 flow
[2024-06-20 20:08:21,609 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2496, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2600, PETRI_PLACES=180, PETRI_TRANSITIONS=229}
[2024-06-20 20:08:21,609 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 137 predicate places.
[2024-06-20 20:08:21,610 INFO  L495      AbstractCegarLoop]: Abstraction has has 180 places, 229 transitions, 2600 flow
[2024-06-20 20:08:21,610 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:08:21,610 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:08:21,610 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:08:21,610 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-20 20:08:21,610 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-20 20:08:21,610 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:08:21,611 INFO  L85        PathProgramCache]: Analyzing trace with hash -390996863, now seen corresponding path program 5 times
[2024-06-20 20:08:21,611 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:08:21,611 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886277454]
[2024-06-20 20:08:21,611 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:08:21,611 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:08:21,646 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:08:30,522 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:08:30,522 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:08:30,522 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886277454]
[2024-06-20 20:08:30,522 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886277454] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:08:30,523 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:08:30,523 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:08:30,523 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063264087]
[2024-06-20 20:08:30,523 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:08:30,523 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:08:30,523 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:08:30,523 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:08:30,523 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:08:30,675 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:08:30,676 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 229 transitions, 2600 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:08:30,676 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:08:30,676 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:08:30,676 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:08:31,809 INFO  L124   PetriNetUnfolderBase]: 2193/3402 cut-off events.
[2024-06-20 20:08:31,809 INFO  L125   PetriNetUnfolderBase]: For 226175/226178 co-relation queries the response was YES.
[2024-06-20 20:08:31,833 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26341 conditions, 3402 events. 2193/3402 cut-off events. For 226175/226178 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 17882 event pairs, 586 based on Foata normal form. 8/3406 useless extension candidates. Maximal degree in co-relation 26256. Up to 2834 conditions per place. 
[2024-06-20 20:08:31,846 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 175 selfloop transitions, 77 changer transitions 0/257 dead transitions.
[2024-06-20 20:08:31,847 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 257 transitions, 3457 flow
[2024-06-20 20:08:31,847 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:08:31,847 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:08:31,848 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-20 20:08:31,848 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44642857142857145
[2024-06-20 20:08:31,848 INFO  L175             Difference]: Start difference. First operand has 180 places, 229 transitions, 2600 flow. Second operand 8 states and 150 transitions.
[2024-06-20 20:08:31,848 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 257 transitions, 3457 flow
[2024-06-20 20:08:32,031 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 257 transitions, 3305 flow, removed 10 selfloop flow, removed 9 redundant places.
[2024-06-20 20:08:32,034 INFO  L231             Difference]: Finished difference. Result has 179 places, 234 transitions, 2689 flow
[2024-06-20 20:08:32,035 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2448, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2689, PETRI_PLACES=179, PETRI_TRANSITIONS=234}
[2024-06-20 20:08:32,035 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 136 predicate places.
[2024-06-20 20:08:32,035 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 234 transitions, 2689 flow
[2024-06-20 20:08:32,035 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:08:32,035 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:08:32,035 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:08:32,035 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-20 20:08:32,036 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-20 20:08:32,036 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:08:32,036 INFO  L85        PathProgramCache]: Analyzing trace with hash -391234013, now seen corresponding path program 6 times
[2024-06-20 20:08:32,036 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:08:32,036 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009709009]
[2024-06-20 20:08:32,036 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:08:32,036 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:08:32,070 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:08:41,299 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:08:41,299 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:08:41,299 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009709009]
[2024-06-20 20:08:41,299 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009709009] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:08:41,299 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:08:41,299 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:08:41,299 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256685321]
[2024-06-20 20:08:41,299 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:08:41,300 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:08:41,300 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:08:41,300 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:08:41,300 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:08:41,386 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:08:41,386 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 234 transitions, 2689 flow. Second operand  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:08:41,386 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:08:41,386 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:08:41,386 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:08:42,580 INFO  L124   PetriNetUnfolderBase]: 2175/3383 cut-off events.
[2024-06-20 20:08:42,581 INFO  L125   PetriNetUnfolderBase]: For 227292/227295 co-relation queries the response was YES.
[2024-06-20 20:08:42,597 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26259 conditions, 3383 events. 2175/3383 cut-off events. For 227292/227295 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 17802 event pairs, 588 based on Foata normal form. 8/3380 useless extension candidates. Maximal degree in co-relation 26174. Up to 2825 conditions per place. 
[2024-06-20 20:08:42,612 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 172 selfloop transitions, 75 changer transitions 0/252 dead transitions.
[2024-06-20 20:08:42,612 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 252 transitions, 3461 flow
[2024-06-20 20:08:42,613 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:08:42,613 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:08:42,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions.
[2024-06-20 20:08:42,613 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4421768707482993
[2024-06-20 20:08:42,613 INFO  L175             Difference]: Start difference. First operand has 179 places, 234 transitions, 2689 flow. Second operand 7 states and 130 transitions.
[2024-06-20 20:08:42,614 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 252 transitions, 3461 flow
[2024-06-20 20:08:42,823 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 252 transitions, 3277 flow, removed 32 selfloop flow, removed 5 redundant places.
[2024-06-20 20:08:42,826 INFO  L231             Difference]: Finished difference. Result has 181 places, 234 transitions, 2664 flow
[2024-06-20 20:08:42,826 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2505, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2664, PETRI_PLACES=181, PETRI_TRANSITIONS=234}
[2024-06-20 20:08:42,827 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 138 predicate places.
[2024-06-20 20:08:42,827 INFO  L495      AbstractCegarLoop]: Abstraction has has 181 places, 234 transitions, 2664 flow
[2024-06-20 20:08:42,827 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:08:42,827 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:08:42,827 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:08:42,827 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-20 20:08:42,827 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-20 20:08:42,828 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:08:42,828 INFO  L85        PathProgramCache]: Analyzing trace with hash -382907165, now seen corresponding path program 1 times
[2024-06-20 20:08:42,828 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:08:42,828 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323188187]
[2024-06-20 20:08:42,828 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:08:42,828 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:08:42,870 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:08:52,857 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:08:52,857 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:08:52,857 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323188187]
[2024-06-20 20:08:52,857 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323188187] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:08:52,858 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:08:52,858 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:08:52,858 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163889422]
[2024-06-20 20:08:52,858 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:08:52,858 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:08:52,858 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:08:52,859 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:08:52,859 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:08:53,040 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:08:53,040 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 234 transitions, 2664 flow. Second operand  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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-20 20:08:53,040 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:08:53,040 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:08:53,040 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:08:54,172 INFO  L124   PetriNetUnfolderBase]: 2173/3378 cut-off events.
[2024-06-20 20:08:54,172 INFO  L125   PetriNetUnfolderBase]: For 228842/228842 co-relation queries the response was YES.
[2024-06-20 20:08:54,185 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26179 conditions, 3378 events. 2173/3378 cut-off events. For 228842/228842 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 17748 event pairs, 534 based on Foata normal form. 2/3378 useless extension candidates. Maximal degree in co-relation 26093. Up to 3130 conditions per place. 
[2024-06-20 20:08:54,195 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 202 selfloop transitions, 51 changer transitions 0/258 dead transitions.
[2024-06-20 20:08:54,195 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 258 transitions, 3347 flow
[2024-06-20 20:08:54,196 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:08:54,196 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:08:54,202 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions.
[2024-06-20 20:08:54,202 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40476190476190477
[2024-06-20 20:08:54,202 INFO  L175             Difference]: Start difference. First operand has 181 places, 234 transitions, 2664 flow. Second operand 9 states and 153 transitions.
[2024-06-20 20:08:54,202 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 258 transitions, 3347 flow
[2024-06-20 20:08:54,401 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 258 transitions, 3059 flow, removed 14 selfloop flow, removed 8 redundant places.
[2024-06-20 20:08:54,404 INFO  L231             Difference]: Finished difference. Result has 182 places, 239 transitions, 2580 flow
[2024-06-20 20:08:54,404 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2392, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2580, PETRI_PLACES=182, PETRI_TRANSITIONS=239}
[2024-06-20 20:08:54,405 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 139 predicate places.
[2024-06-20 20:08:54,405 INFO  L495      AbstractCegarLoop]: Abstraction has has 182 places, 239 transitions, 2580 flow
[2024-06-20 20:08:54,410 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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-20 20:08:54,410 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:08:54,410 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:08:54,410 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-20 20:08:54,410 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-20 20:08:54,411 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:08:54,411 INFO  L85        PathProgramCache]: Analyzing trace with hash 1787928417, now seen corresponding path program 1 times
[2024-06-20 20:08:54,411 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:08:54,411 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009648804]
[2024-06-20 20:08:54,411 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:08:54,411 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:08:54,505 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:09:04,176 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:09:04,176 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:09:04,176 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009648804]
[2024-06-20 20:09:04,176 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009648804] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:09:04,176 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:09:04,176 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:09:04,176 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222657459]
[2024-06-20 20:09:04,177 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:09:04,177 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:09:04,177 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:09:04,178 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:09:04,178 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:09:04,313 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:09:04,314 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 239 transitions, 2580 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:09:04,314 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:09:04,314 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:09:04,314 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:09:05,370 INFO  L124   PetriNetUnfolderBase]: 2183/3391 cut-off events.
[2024-06-20 20:09:05,370 INFO  L125   PetriNetUnfolderBase]: For 235105/235105 co-relation queries the response was YES.
[2024-06-20 20:09:05,386 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26353 conditions, 3391 events. 2183/3391 cut-off events. For 235105/235105 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 17833 event pairs, 570 based on Foata normal form. 2/3391 useless extension candidates. Maximal degree in co-relation 26267. Up to 3195 conditions per place. 
[2024-06-20 20:09:05,399 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 237 selfloop transitions, 17 changer transitions 0/259 dead transitions.
[2024-06-20 20:09:05,399 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 259 transitions, 3182 flow
[2024-06-20 20:09:05,399 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:09:05,400 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:09:05,400 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions.
[2024-06-20 20:09:05,400 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41496598639455784
[2024-06-20 20:09:05,400 INFO  L175             Difference]: Start difference. First operand has 182 places, 239 transitions, 2580 flow. Second operand 7 states and 122 transitions.
[2024-06-20 20:09:05,400 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 259 transitions, 3182 flow
[2024-06-20 20:09:05,666 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 259 transitions, 3032 flow, removed 28 selfloop flow, removed 7 redundant places.
[2024-06-20 20:09:05,669 INFO  L231             Difference]: Finished difference. Result has 182 places, 242 transitions, 2522 flow
[2024-06-20 20:09:05,670 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2430, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2522, PETRI_PLACES=182, PETRI_TRANSITIONS=242}
[2024-06-20 20:09:05,670 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 139 predicate places.
[2024-06-20 20:09:05,670 INFO  L495      AbstractCegarLoop]: Abstraction has has 182 places, 242 transitions, 2522 flow
[2024-06-20 20:09:05,670 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:09:05,670 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:09:05,670 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:09:05,671 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-20 20:09:05,671 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:09:05,672 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:09:05,672 INFO  L85        PathProgramCache]: Analyzing trace with hash 524513731, now seen corresponding path program 2 times
[2024-06-20 20:09:05,672 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:09:05,672 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666118839]
[2024-06-20 20:09:05,672 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:09:05,672 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:09:05,735 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:09:15,996 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:09:15,996 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:09:15,996 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666118839]
[2024-06-20 20:09:15,996 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666118839] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:09:15,996 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:09:15,996 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:09:15,996 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825568934]
[2024-06-20 20:09:15,997 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:09:15,997 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:09:15,997 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:09:15,999 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:09:15,999 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:09:16,094 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:09:16,094 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 242 transitions, 2522 flow. Second operand  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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-20 20:09:16,094 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:09:16,094 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:09:16,094 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:09:17,320 INFO  L124   PetriNetUnfolderBase]: 2193/3396 cut-off events.
[2024-06-20 20:09:17,321 INFO  L125   PetriNetUnfolderBase]: For 243408/243408 co-relation queries the response was YES.
[2024-06-20 20:09:17,333 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26760 conditions, 3396 events. 2193/3396 cut-off events. For 243408/243408 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 17824 event pairs, 564 based on Foata normal form. 2/3396 useless extension candidates. Maximal degree in co-relation 26673. Up to 3192 conditions per place. 
[2024-06-20 20:09:17,345 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 231 selfloop transitions, 25 changer transitions 0/261 dead transitions.
[2024-06-20 20:09:17,345 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 261 transitions, 3130 flow
[2024-06-20 20:09:17,347 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:09:17,347 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:09:17,363 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions.
[2024-06-20 20:09:17,364 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41836734693877553
[2024-06-20 20:09:17,364 INFO  L175             Difference]: Start difference. First operand has 182 places, 242 transitions, 2522 flow. Second operand 7 states and 123 transitions.
[2024-06-20 20:09:17,364 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 261 transitions, 3130 flow
[2024-06-20 20:09:17,614 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 261 transitions, 3060 flow, removed 20 selfloop flow, removed 5 redundant places.
[2024-06-20 20:09:17,617 INFO  L231             Difference]: Finished difference. Result has 184 places, 245 transitions, 2567 flow
[2024-06-20 20:09:17,617 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2452, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2567, PETRI_PLACES=184, PETRI_TRANSITIONS=245}
[2024-06-20 20:09:17,617 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 141 predicate places.
[2024-06-20 20:09:17,617 INFO  L495      AbstractCegarLoop]: Abstraction has has 184 places, 245 transitions, 2567 flow
[2024-06-20 20:09:17,617 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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-20 20:09:17,617 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:09:17,618 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:09:17,618 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-20 20:09:17,618 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:09:17,618 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:09:17,618 INFO  L85        PathProgramCache]: Analyzing trace with hash 1788048573, now seen corresponding path program 1 times
[2024-06-20 20:09:17,618 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:09:17,618 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885137321]
[2024-06-20 20:09:17,619 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:09:17,619 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:09:17,656 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:09:26,832 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:09:26,832 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:09:26,832 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885137321]
[2024-06-20 20:09:26,833 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885137321] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:09:26,833 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:09:26,833 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:09:26,833 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966548260]
[2024-06-20 20:09:26,833 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:09:26,834 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:09:26,834 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:09:26,834 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:09:26,835 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:09:26,911 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:09:26,911 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 245 transitions, 2567 flow. Second operand  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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-20 20:09:26,911 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:09:26,911 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:09:26,911 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:09:28,124 INFO  L124   PetriNetUnfolderBase]: 2189/3395 cut-off events.
[2024-06-20 20:09:28,124 INFO  L125   PetriNetUnfolderBase]: For 249506/249506 co-relation queries the response was YES.
[2024-06-20 20:09:28,137 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27004 conditions, 3395 events. 2189/3395 cut-off events. For 249506/249506 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 17808 event pairs, 581 based on Foata normal form. 2/3390 useless extension candidates. Maximal degree in co-relation 26916. Up to 3074 conditions per place. 
[2024-06-20 20:09:28,149 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 207 selfloop transitions, 56 changer transitions 0/268 dead transitions.
[2024-06-20 20:09:28,149 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 268 transitions, 3386 flow
[2024-06-20 20:09:28,151 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:09:28,151 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:09:28,151 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions.
[2024-06-20 20:09:28,151 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42517006802721086
[2024-06-20 20:09:28,151 INFO  L175             Difference]: Start difference. First operand has 184 places, 245 transitions, 2567 flow. Second operand 7 states and 125 transitions.
[2024-06-20 20:09:28,151 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 268 transitions, 3386 flow
[2024-06-20 20:09:28,378 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 268 transitions, 3295 flow, removed 23 selfloop flow, removed 5 redundant places.
[2024-06-20 20:09:28,382 INFO  L231             Difference]: Finished difference. Result has 187 places, 253 transitions, 2793 flow
[2024-06-20 20:09:28,382 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2476, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2793, PETRI_PLACES=187, PETRI_TRANSITIONS=253}
[2024-06-20 20:09:28,382 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 144 predicate places.
[2024-06-20 20:09:28,382 INFO  L495      AbstractCegarLoop]: Abstraction has has 187 places, 253 transitions, 2793 flow
[2024-06-20 20:09:28,383 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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-20 20:09:28,383 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:09:28,383 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:09:28,383 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-20 20:09:28,383 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:09:28,383 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:09:28,384 INFO  L85        PathProgramCache]: Analyzing trace with hash 529162305, now seen corresponding path program 1 times
[2024-06-20 20:09:28,384 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:09:28,384 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208493191]
[2024-06-20 20:09:28,384 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:09:28,384 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:09:28,423 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:09:37,887 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:09:37,887 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:09:37,887 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208493191]
[2024-06-20 20:09:37,887 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208493191] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:09:37,887 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:09:37,887 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:09:37,888 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697875648]
[2024-06-20 20:09:37,888 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:09:37,888 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:09:37,888 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:09:37,888 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:09:37,888 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:09:38,062 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:09:38,062 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 253 transitions, 2793 flow. Second operand  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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-20 20:09:38,062 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:09:38,062 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:09:38,062 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:09:39,286 INFO  L124   PetriNetUnfolderBase]: 2179/3388 cut-off events.
[2024-06-20 20:09:39,287 INFO  L125   PetriNetUnfolderBase]: For 256615/256618 co-relation queries the response was YES.
[2024-06-20 20:09:39,299 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27164 conditions, 3388 events. 2179/3388 cut-off events. For 256615/256618 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 17806 event pairs, 518 based on Foata normal form. 6/3390 useless extension candidates. Maximal degree in co-relation 27074. Up to 2904 conditions per place. 
[2024-06-20 20:09:39,310 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 182 selfloop transitions, 96 changer transitions 0/283 dead transitions.
[2024-06-20 20:09:39,310 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 283 transitions, 3621 flow
[2024-06-20 20:09:39,311 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:09:39,311 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:09:39,311 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions.
[2024-06-20 20:09:39,311 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4375
[2024-06-20 20:09:39,311 INFO  L175             Difference]: Start difference. First operand has 187 places, 253 transitions, 2793 flow. Second operand 8 states and 147 transitions.
[2024-06-20 20:09:39,311 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 283 transitions, 3621 flow
[2024-06-20 20:09:39,545 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 283 transitions, 3497 flow, removed 46 selfloop flow, removed 3 redundant places.
[2024-06-20 20:09:39,548 INFO  L231             Difference]: Finished difference. Result has 194 places, 264 transitions, 3098 flow
[2024-06-20 20:09:39,548 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2675, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3098, PETRI_PLACES=194, PETRI_TRANSITIONS=264}
[2024-06-20 20:09:39,549 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 151 predicate places.
[2024-06-20 20:09:39,549 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 264 transitions, 3098 flow
[2024-06-20 20:09:39,549 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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-20 20:09:39,549 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:09:39,549 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:09:39,549 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-20 20:09:39,549 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:09:39,550 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:09:39,550 INFO  L85        PathProgramCache]: Analyzing trace with hash -390987935, now seen corresponding path program 3 times
[2024-06-20 20:09:39,550 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:09:39,550 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014146382]
[2024-06-20 20:09:39,550 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:09:39,550 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:09:39,609 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:09:49,229 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:09:49,229 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:09:49,229 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014146382]
[2024-06-20 20:09:49,229 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014146382] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:09:49,229 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:09:49,230 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:09:49,230 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822676177]
[2024-06-20 20:09:49,230 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:09:49,230 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:09:49,230 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:09:49,230 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:09:49,231 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:09:49,363 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:09:49,364 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 264 transitions, 3098 flow. Second operand  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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-20 20:09:49,364 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:09:49,364 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:09:49,364 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:09:50,440 INFO  L124   PetriNetUnfolderBase]: 2173/3378 cut-off events.
[2024-06-20 20:09:50,440 INFO  L125   PetriNetUnfolderBase]: For 258734/258737 co-relation queries the response was YES.
[2024-06-20 20:09:50,456 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27646 conditions, 3378 events. 2173/3378 cut-off events. For 258734/258737 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 17725 event pairs, 510 based on Foata normal form. 2/3376 useless extension candidates. Maximal degree in co-relation 27552. Up to 3151 conditions per place. 
[2024-06-20 20:09:50,469 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 245 selfloop transitions, 31 changer transitions 0/281 dead transitions.
[2024-06-20 20:09:50,470 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 281 transitions, 3746 flow
[2024-06-20 20:09:50,470 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:09:50,470 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:09:50,470 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions.
[2024-06-20 20:09:50,471 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41836734693877553
[2024-06-20 20:09:50,471 INFO  L175             Difference]: Start difference. First operand has 194 places, 264 transitions, 3098 flow. Second operand 7 states and 123 transitions.
[2024-06-20 20:09:50,471 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 281 transitions, 3746 flow
[2024-06-20 20:09:50,849 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 281 transitions, 3637 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-06-20 20:09:50,853 INFO  L231             Difference]: Finished difference. Result has 197 places, 267 transitions, 3121 flow
[2024-06-20 20:09:50,853 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2989, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3121, PETRI_PLACES=197, PETRI_TRANSITIONS=267}
[2024-06-20 20:09:50,853 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 154 predicate places.
[2024-06-20 20:09:50,853 INFO  L495      AbstractCegarLoop]: Abstraction has has 197 places, 267 transitions, 3121 flow
[2024-06-20 20:09:50,854 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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-20 20:09:50,854 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:09:50,854 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-20 20:09:50,854 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-20 20:09:50,854 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:09:50,854 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:09:50,854 INFO  L85        PathProgramCache]: Analyzing trace with hash -1532009531, now seen corresponding path program 1 times
[2024-06-20 20:09:50,854 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:09:50,855 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730680634]
[2024-06-20 20:09:50,855 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:09:50,855 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:09:50,943 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:10:00,397 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:10:00,397 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:10:00,397 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730680634]
[2024-06-20 20:10:00,398 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730680634] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:10:00,398 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:10:00,398 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:10:00,398 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040924740]
[2024-06-20 20:10:00,398 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:10:00,402 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:10:00,402 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:10:00,402 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:10:00,402 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:10:00,581 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:10:00,581 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 267 transitions, 3121 flow. Second operand  has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:10:00,581 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:10:00,581 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:10:00,582 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:10:02,130 INFO  L124   PetriNetUnfolderBase]: 2342/3666 cut-off events.
[2024-06-20 20:10:02,131 INFO  L125   PetriNetUnfolderBase]: For 309023/309026 co-relation queries the response was YES.
[2024-06-20 20:10:02,146 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30389 conditions, 3666 events. 2342/3666 cut-off events. For 309023/309026 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 19761 event pairs, 472 based on Foata normal form. 16/3678 useless extension candidates. Maximal degree in co-relation 30294. Up to 2810 conditions per place. 
[2024-06-20 20:10:02,157 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 250 selfloop transitions, 62 changer transitions 0/317 dead transitions.
[2024-06-20 20:10:02,157 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 317 transitions, 4161 flow
[2024-06-20 20:10:02,159 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:10:02,159 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:10:02,160 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 183 transitions.
[2024-06-20 20:10:02,160 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48412698412698413
[2024-06-20 20:10:02,160 INFO  L175             Difference]: Start difference. First operand has 197 places, 267 transitions, 3121 flow. Second operand 9 states and 183 transitions.
[2024-06-20 20:10:02,160 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 317 transitions, 4161 flow
[2024-06-20 20:10:02,416 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 317 transitions, 4051 flow, removed 26 selfloop flow, removed 5 redundant places.
[2024-06-20 20:10:02,419 INFO  L231             Difference]: Finished difference. Result has 201 places, 269 transitions, 3219 flow
[2024-06-20 20:10:02,419 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3011, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3219, PETRI_PLACES=201, PETRI_TRANSITIONS=269}
[2024-06-20 20:10:02,420 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 158 predicate places.
[2024-06-20 20:10:02,420 INFO  L495      AbstractCegarLoop]: Abstraction has has 201 places, 269 transitions, 3219 flow
[2024-06-20 20:10:02,420 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:10:02,420 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:10:02,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-20 20:10:02,420 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-20 20:10:02,420 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-20 20:10:02,421 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:10:02,421 INFO  L85        PathProgramCache]: Analyzing trace with hash -315983651, now seen corresponding path program 2 times
[2024-06-20 20:10:02,421 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:10:02,425 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114087357]
[2024-06-20 20:10:02,425 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:10:02,425 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:10:02,520 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:10:10,801 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:10:10,801 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:10:10,801 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114087357]
[2024-06-20 20:10:10,801 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114087357] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:10:10,801 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:10:10,801 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:10:10,802 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867175112]
[2024-06-20 20:10:10,802 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:10:10,802 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:10:10,802 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:10:10,802 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:10:10,802 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:10:11,037 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:10:11,037 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 269 transitions, 3219 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-20 20:10:11,037 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:10:11,037 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:10:11,037 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:10:12,572 INFO  L124   PetriNetUnfolderBase]: 2417/3796 cut-off events.
[2024-06-20 20:10:12,572 INFO  L125   PetriNetUnfolderBase]: For 323364/323367 co-relation queries the response was YES.
[2024-06-20 20:10:12,588 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31586 conditions, 3796 events. 2417/3796 cut-off events. For 323364/323367 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 20742 event pairs, 502 based on Foata normal form. 20/3812 useless extension candidates. Maximal degree in co-relation 31490. Up to 3134 conditions per place. 
[2024-06-20 20:10:12,600 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 247 selfloop transitions, 60 changer transitions 0/312 dead transitions.
[2024-06-20 20:10:12,600 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 312 transitions, 4021 flow
[2024-06-20 20:10:12,602 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:10:12,602 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:10:12,602 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions.
[2024-06-20 20:10:12,602 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4708994708994709
[2024-06-20 20:10:12,603 INFO  L175             Difference]: Start difference. First operand has 201 places, 269 transitions, 3219 flow. Second operand 9 states and 178 transitions.
[2024-06-20 20:10:12,603 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 312 transitions, 4021 flow
[2024-06-20 20:10:12,915 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 312 transitions, 3908 flow, removed 21 selfloop flow, removed 5 redundant places.
[2024-06-20 20:10:12,918 INFO  L231             Difference]: Finished difference. Result has 205 places, 270 transitions, 3275 flow
[2024-06-20 20:10:12,918 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3112, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3275, PETRI_PLACES=205, PETRI_TRANSITIONS=270}
[2024-06-20 20:10:12,918 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 162 predicate places.
[2024-06-20 20:10:12,919 INFO  L495      AbstractCegarLoop]: Abstraction has has 205 places, 270 transitions, 3275 flow
[2024-06-20 20:10:12,919 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-20 20:10:12,919 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:10:12,919 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:10:12,919 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-20 20:10:12,919 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-20 20:10:12,919 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:10:12,919 INFO  L85        PathProgramCache]: Analyzing trace with hash 1795305693, now seen corresponding path program 3 times
[2024-06-20 20:10:12,920 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:10:12,920 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769402979]
[2024-06-20 20:10:12,920 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:10:12,920 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:10:12,986 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:10:20,895 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:10:20,896 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:10:20,896 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769402979]
[2024-06-20 20:10:20,896 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769402979] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:10:20,896 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:10:20,896 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:10:20,896 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549013243]
[2024-06-20 20:10:20,897 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:10:20,897 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:10:20,897 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:10:20,897 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:10:20,897 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:10:21,088 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:10:21,088 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 270 transitions, 3275 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-20 20:10:21,088 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:10:21,088 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:10:21,088 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:10:22,617 INFO  L124   PetriNetUnfolderBase]: 2381/3730 cut-off events.
[2024-06-20 20:10:22,617 INFO  L125   PetriNetUnfolderBase]: For 309690/309693 co-relation queries the response was YES.
[2024-06-20 20:10:22,636 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30477 conditions, 3730 events. 2381/3730 cut-off events. For 309690/309693 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 20176 event pairs, 466 based on Foata normal form. 22/3748 useless extension candidates. Maximal degree in co-relation 30379. Up to 3078 conditions per place. 
[2024-06-20 20:10:22,648 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 249 selfloop transitions, 70 changer transitions 0/324 dead transitions.
[2024-06-20 20:10:22,648 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 324 transitions, 4097 flow
[2024-06-20 20:10:22,650 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-20 20:10:22,650 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-20 20:10:22,650 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 227 transitions.
[2024-06-20 20:10:22,651 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4503968253968254
[2024-06-20 20:10:22,651 INFO  L175             Difference]: Start difference. First operand has 205 places, 270 transitions, 3275 flow. Second operand 12 states and 227 transitions.
[2024-06-20 20:10:22,651 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 324 transitions, 4097 flow
[2024-06-20 20:10:23,117 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 324 transitions, 3946 flow, removed 17 selfloop flow, removed 7 redundant places.
[2024-06-20 20:10:23,121 INFO  L231             Difference]: Finished difference. Result has 210 places, 270 transitions, 3271 flow
[2024-06-20 20:10:23,121 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3124, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3271, PETRI_PLACES=210, PETRI_TRANSITIONS=270}
[2024-06-20 20:10:23,121 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 167 predicate places.
[2024-06-20 20:10:23,121 INFO  L495      AbstractCegarLoop]: Abstraction has has 210 places, 270 transitions, 3271 flow
[2024-06-20 20:10:23,122 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-20 20:10:23,122 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:10:23,122 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-20 20:10:23,122 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-20 20:10:23,122 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:10:23,123 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:10:23,123 INFO  L85        PathProgramCache]: Analyzing trace with hash 1837600989, now seen corresponding path program 4 times
[2024-06-20 20:10:23,123 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:10:23,123 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027982520]
[2024-06-20 20:10:23,123 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:10:23,123 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:10:23,186 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:10:31,721 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:10:31,721 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:10:31,721 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027982520]
[2024-06-20 20:10:31,721 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027982520] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:10:31,721 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:10:31,721 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:10:31,721 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763272519]
[2024-06-20 20:10:31,721 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:10:31,721 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:10:31,721 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:10:31,722 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:10:31,722 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:10:31,945 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:10:31,945 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 270 transitions, 3271 flow. Second operand  has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:10:31,945 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:10:31,945 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:10:31,945 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:10:33,623 INFO  L124   PetriNetUnfolderBase]: 2550/4012 cut-off events.
[2024-06-20 20:10:33,624 INFO  L125   PetriNetUnfolderBase]: For 344526/344526 co-relation queries the response was YES.
[2024-06-20 20:10:33,644 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33017 conditions, 4012 events. 2550/4012 cut-off events. For 344526/344526 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 22277 event pairs, 639 based on Foata normal form. 16/4026 useless extension candidates. Maximal degree in co-relation 32918. Up to 3382 conditions per place. 
[2024-06-20 20:10:33,657 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 287 selfloop transitions, 31 changer transitions 0/323 dead transitions.
[2024-06-20 20:10:33,657 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 323 transitions, 4349 flow
[2024-06-20 20:10:33,659 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:10:33,659 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:10:33,659 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions.
[2024-06-20 20:10:33,660 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45476190476190476
[2024-06-20 20:10:33,660 INFO  L175             Difference]: Start difference. First operand has 210 places, 270 transitions, 3271 flow. Second operand 10 states and 191 transitions.
[2024-06-20 20:10:33,660 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 323 transitions, 4349 flow
[2024-06-20 20:10:34,005 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 323 transitions, 4199 flow, removed 2 selfloop flow, removed 11 redundant places.
[2024-06-20 20:10:34,009 INFO  L231             Difference]: Finished difference. Result has 209 places, 272 transitions, 3271 flow
[2024-06-20 20:10:34,009 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3121, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3271, PETRI_PLACES=209, PETRI_TRANSITIONS=272}
[2024-06-20 20:10:34,009 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 166 predicate places.
[2024-06-20 20:10:34,010 INFO  L495      AbstractCegarLoop]: Abstraction has has 209 places, 272 transitions, 3271 flow
[2024-06-20 20:10:34,010 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:10:34,010 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:10:34,010 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-20 20:10:34,010 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-20 20:10:34,010 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:10:34,010 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:10:34,011 INFO  L85        PathProgramCache]: Analyzing trace with hash 292756223, now seen corresponding path program 5 times
[2024-06-20 20:10:34,011 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:10:34,011 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145297797]
[2024-06-20 20:10:34,011 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:10:34,011 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:10:34,102 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:10:42,023 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:10:42,023 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:10:42,023 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145297797]
[2024-06-20 20:10:42,024 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145297797] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:10:42,024 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:10:42,024 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:10:42,024 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648765778]
[2024-06-20 20:10:42,024 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:10:42,024 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:10:42,025 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:10:42,025 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:10:42,025 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:10:42,210 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:10:42,224 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 272 transitions, 3271 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-20 20:10:42,224 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:10:42,224 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:10:42,224 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:10:43,796 INFO  L124   PetriNetUnfolderBase]: 2608/4110 cut-off events.
[2024-06-20 20:10:43,796 INFO  L125   PetriNetUnfolderBase]: For 359145/359145 co-relation queries the response was YES.
[2024-06-20 20:10:43,818 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33620 conditions, 4110 events. 2608/4110 cut-off events. For 359145/359145 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 22978 event pairs, 670 based on Foata normal form. 16/4124 useless extension candidates. Maximal degree in co-relation 33520. Up to 3566 conditions per place. 
[2024-06-20 20:10:43,832 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 285 selfloop transitions, 28 changer transitions 0/318 dead transitions.
[2024-06-20 20:10:43,832 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 318 transitions, 4287 flow
[2024-06-20 20:10:43,834 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:10:43,834 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:10:43,834 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions.
[2024-06-20 20:10:43,834 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4576719576719577
[2024-06-20 20:10:43,834 INFO  L175             Difference]: Start difference. First operand has 209 places, 272 transitions, 3271 flow. Second operand 9 states and 173 transitions.
[2024-06-20 20:10:43,834 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 318 transitions, 4287 flow
[2024-06-20 20:10:44,310 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 318 transitions, 4197 flow, removed 22 selfloop flow, removed 6 redundant places.
[2024-06-20 20:10:44,313 INFO  L231             Difference]: Finished difference. Result has 212 places, 273 transitions, 3285 flow
[2024-06-20 20:10:44,314 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3187, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3285, PETRI_PLACES=212, PETRI_TRANSITIONS=273}
[2024-06-20 20:10:44,315 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 169 predicate places.
[2024-06-20 20:10:44,315 INFO  L495      AbstractCegarLoop]: Abstraction has has 212 places, 273 transitions, 3285 flow
[2024-06-20 20:10:44,315 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-20 20:10:44,316 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:10:44,316 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-20 20:10:44,316 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-20 20:10:44,316 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:10:44,316 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:10:44,317 INFO  L85        PathProgramCache]: Analyzing trace with hash 292933853, now seen corresponding path program 6 times
[2024-06-20 20:10:44,317 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:10:44,317 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055010773]
[2024-06-20 20:10:44,317 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:10:44,317 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:10:44,406 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:10:53,344 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:10:53,344 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:10:53,344 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055010773]
[2024-06-20 20:10:53,344 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055010773] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:10:53,344 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:10:53,345 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:10:53,345 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502521351]
[2024-06-20 20:10:53,345 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:10:53,345 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:10:53,345 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:10:53,345 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:10:53,345 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:10:53,442 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:10:53,442 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 273 transitions, 3285 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-20 20:10:53,442 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:10:53,442 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:10:53,442 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:10:55,070 INFO  L124   PetriNetUnfolderBase]: 2572/4054 cut-off events.
[2024-06-20 20:10:55,071 INFO  L125   PetriNetUnfolderBase]: For 347543/347543 co-relation queries the response was YES.
[2024-06-20 20:10:55,091 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32269 conditions, 4054 events. 2572/4054 cut-off events. For 347543/347543 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 22598 event pairs, 677 based on Foata normal form. 20/4072 useless extension candidates. Maximal degree in co-relation 32167. Up to 3694 conditions per place. 
[2024-06-20 20:10:55,103 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 280 selfloop transitions, 26 changer transitions 0/311 dead transitions.
[2024-06-20 20:10:55,104 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 311 transitions, 4035 flow
[2024-06-20 20:10:55,105 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:10:55,105 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:10:55,106 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions.
[2024-06-20 20:10:55,106 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43915343915343913
[2024-06-20 20:10:55,106 INFO  L175             Difference]: Start difference. First operand has 212 places, 273 transitions, 3285 flow. Second operand 9 states and 166 transitions.
[2024-06-20 20:10:55,106 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 311 transitions, 4035 flow
[2024-06-20 20:10:55,554 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 311 transitions, 3934 flow, removed 22 selfloop flow, removed 7 redundant places.
[2024-06-20 20:10:55,557 INFO  L231             Difference]: Finished difference. Result has 214 places, 273 transitions, 3243 flow
[2024-06-20 20:10:55,558 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3184, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3243, PETRI_PLACES=214, PETRI_TRANSITIONS=273}
[2024-06-20 20:10:55,558 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 171 predicate places.
[2024-06-20 20:10:55,559 INFO  L495      AbstractCegarLoop]: Abstraction has has 214 places, 273 transitions, 3243 flow
[2024-06-20 20:10:55,559 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-20 20:10:55,559 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:10:55,559 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-20 20:10:55,559 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-20 20:10:55,559 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:10:55,560 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:10:55,560 INFO  L85        PathProgramCache]: Analyzing trace with hash 1824123725, now seen corresponding path program 1 times
[2024-06-20 20:10:55,560 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:10:55,560 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948189338]
[2024-06-20 20:10:55,560 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:10:55,560 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:10:55,656 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:11:06,242 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:11:06,242 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:11:06,243 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948189338]
[2024-06-20 20:11:06,243 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948189338] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:11:06,243 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:11:06,243 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-20 20:11:06,243 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928093027]
[2024-06-20 20:11:06,243 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:11:06,244 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-20 20:11:06,245 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:11:06,245 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-20 20:11:06,245 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132
[2024-06-20 20:11:06,520 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:11:06,521 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 273 transitions, 3243 flow. Second operand  has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:11:06,521 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:11:06,521 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:11:06,521 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:11:08,170 INFO  L124   PetriNetUnfolderBase]: 2613/4122 cut-off events.
[2024-06-20 20:11:08,170 INFO  L125   PetriNetUnfolderBase]: For 347637/347640 co-relation queries the response was YES.
[2024-06-20 20:11:08,189 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32518 conditions, 4122 events. 2613/4122 cut-off events. For 347637/347640 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 23118 event pairs, 470 based on Foata normal form. 12/4130 useless extension candidates. Maximal degree in co-relation 32415. Up to 3143 conditions per place. 
[2024-06-20 20:11:08,201 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 247 selfloop transitions, 64 changer transitions 0/316 dead transitions.
[2024-06-20 20:11:08,201 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 316 transitions, 4067 flow
[2024-06-20 20:11:08,203 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:11:08,203 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:11:08,203 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-20 20:11:08,203 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4656084656084656
[2024-06-20 20:11:08,203 INFO  L175             Difference]: Start difference. First operand has 214 places, 273 transitions, 3243 flow. Second operand 9 states and 176 transitions.
[2024-06-20 20:11:08,204 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 316 transitions, 4067 flow
[2024-06-20 20:11:08,644 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 316 transitions, 4000 flow, removed 1 selfloop flow, removed 9 redundant places.
[2024-06-20 20:11:08,647 INFO  L231             Difference]: Finished difference. Result has 214 places, 274 transitions, 3354 flow
[2024-06-20 20:11:08,647 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3176, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3354, PETRI_PLACES=214, PETRI_TRANSITIONS=274}
[2024-06-20 20:11:08,647 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 171 predicate places.
[2024-06-20 20:11:08,648 INFO  L495      AbstractCegarLoop]: Abstraction has has 214 places, 274 transitions, 3354 flow
[2024-06-20 20:11:08,648 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:11:08,648 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:11:08,648 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-20 20:11:08,648 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-20 20:11:08,648 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:11:08,648 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:11:08,649 INFO  L85        PathProgramCache]: Analyzing trace with hash 942173418, now seen corresponding path program 1 times
[2024-06-20 20:11:08,649 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:11:08,649 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108398782]
[2024-06-20 20:11:08,649 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:11:08,649 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:11:08,685 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:11:17,264 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:11:17,264 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:11:17,265 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108398782]
[2024-06-20 20:11:17,265 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108398782] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:11:17,265 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:11:17,265 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:11:17,265 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531830720]
[2024-06-20 20:11:17,265 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:11:17,265 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:11:17,265 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:11:17,265 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:11:17,265 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:11:17,410 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:11:17,411 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 274 transitions, 3354 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-20 20:11:17,411 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:11:17,411 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:11:17,411 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:11:18,746 INFO  L124   PetriNetUnfolderBase]: 2618/4134 cut-off events.
[2024-06-20 20:11:18,754 INFO  L125   PetriNetUnfolderBase]: For 345736/345739 co-relation queries the response was YES.
[2024-06-20 20:11:18,773 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33025 conditions, 4134 events. 2618/4134 cut-off events. For 345736/345739 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 23286 event pairs, 707 based on Foata normal form. 3/4133 useless extension candidates. Maximal degree in co-relation 32921. Up to 3876 conditions per place. 
[2024-06-20 20:11:18,785 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 254 selfloop transitions, 36 changer transitions 0/295 dead transitions.
[2024-06-20 20:11:18,785 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 295 transitions, 4054 flow
[2024-06-20 20:11:18,786 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:11:18,786 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:11:18,786 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions.
[2024-06-20 20:11:18,786 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43537414965986393
[2024-06-20 20:11:18,786 INFO  L175             Difference]: Start difference. First operand has 214 places, 274 transitions, 3354 flow. Second operand 7 states and 128 transitions.
[2024-06-20 20:11:18,786 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 295 transitions, 4054 flow
[2024-06-20 20:11:19,177 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 295 transitions, 3896 flow, removed 16 selfloop flow, removed 7 redundant places.
[2024-06-20 20:11:19,180 INFO  L231             Difference]: Finished difference. Result has 214 places, 277 transitions, 3350 flow
[2024-06-20 20:11:19,180 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3196, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3350, PETRI_PLACES=214, PETRI_TRANSITIONS=277}
[2024-06-20 20:11:19,181 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 171 predicate places.
[2024-06-20 20:11:19,181 INFO  L495      AbstractCegarLoop]: Abstraction has has 214 places, 277 transitions, 3350 flow
[2024-06-20 20:11:19,181 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-20 20:11:19,181 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:11:19,182 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-20 20:11:19,182 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-20 20:11:19,182 INFO  L420      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:11:19,182 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:11:19,182 INFO  L85        PathProgramCache]: Analyzing trace with hash 357918097, now seen corresponding path program 7 times
[2024-06-20 20:11:19,182 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:11:19,182 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627291217]
[2024-06-20 20:11:19,183 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:11:19,183 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:11:19,246 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:11:27,239 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:11:27,239 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:11:27,239 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627291217]
[2024-06-20 20:11:27,239 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627291217] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:11:27,240 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:11:27,240 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:11:27,240 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052164319]
[2024-06-20 20:11:27,240 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:11:27,240 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:11:27,240 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:11:27,240 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:11:27,241 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:11:27,342 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:11:27,342 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 277 transitions, 3350 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-20 20:11:27,343 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:11:27,343 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:11:27,343 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:11:29,083 INFO  L124   PetriNetUnfolderBase]: 2669/4215 cut-off events.
[2024-06-20 20:11:29,083 INFO  L125   PetriNetUnfolderBase]: For 369845/369845 co-relation queries the response was YES.
[2024-06-20 20:11:29,102 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33347 conditions, 4215 events. 2669/4215 cut-off events. For 369845/369845 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 23806 event pairs, 568 based on Foata normal form. 12/4220 useless extension candidates. Maximal degree in co-relation 33242. Up to 3614 conditions per place. 
[2024-06-20 20:11:29,114 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 255 selfloop transitions, 70 changer transitions 0/330 dead transitions.
[2024-06-20 20:11:29,114 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 330 transitions, 4222 flow
[2024-06-20 20:11:29,116 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-20 20:11:29,116 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-20 20:11:29,117 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 225 transitions.
[2024-06-20 20:11:29,117 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44642857142857145
[2024-06-20 20:11:29,117 INFO  L175             Difference]: Start difference. First operand has 214 places, 277 transitions, 3350 flow. Second operand 12 states and 225 transitions.
[2024-06-20 20:11:29,117 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 330 transitions, 4222 flow
[2024-06-20 20:11:29,475 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 330 transitions, 4130 flow, removed 12 selfloop flow, removed 6 redundant places.
[2024-06-20 20:11:29,478 INFO  L231             Difference]: Finished difference. Result has 220 places, 280 transitions, 3487 flow
[2024-06-20 20:11:29,478 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3258, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3487, PETRI_PLACES=220, PETRI_TRANSITIONS=280}
[2024-06-20 20:11:29,479 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 177 predicate places.
[2024-06-20 20:11:29,480 INFO  L495      AbstractCegarLoop]: Abstraction has has 220 places, 280 transitions, 3487 flow
[2024-06-20 20:11:29,480 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-20 20:11:29,480 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:11:29,480 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-20 20:11:29,480 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-20 20:11:29,480 INFO  L420      AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:11:29,481 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:11:29,481 INFO  L85        PathProgramCache]: Analyzing trace with hash -1795903477, now seen corresponding path program 8 times
[2024-06-20 20:11:29,481 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:11:29,481 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414461344]
[2024-06-20 20:11:29,481 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:11:29,481 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:11:29,542 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:11:39,048 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:11:39,048 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:11:39,048 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414461344]
[2024-06-20 20:11:39,051 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414461344] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:11:39,051 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:11:39,051 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:11:39,051 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125590192]
[2024-06-20 20:11:39,051 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:11:39,052 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:11:39,052 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:11:39,052 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:11:39,052 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:11:39,223 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:11:39,223 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 280 transitions, 3487 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-20 20:11:39,223 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:11:39,223 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:11:39,224 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:11:41,013 INFO  L124   PetriNetUnfolderBase]: 2744/4350 cut-off events.
[2024-06-20 20:11:41,013 INFO  L125   PetriNetUnfolderBase]: For 387576/387576 co-relation queries the response was YES.
[2024-06-20 20:11:41,033 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34819 conditions, 4350 events. 2744/4350 cut-off events. For 387576/387576 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 24872 event pairs, 592 based on Foata normal form. 20/4363 useless extension candidates. Maximal degree in co-relation 34714. Up to 3683 conditions per place. 
[2024-06-20 20:11:41,046 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 257 selfloop transitions, 70 changer transitions 0/332 dead transitions.
[2024-06-20 20:11:41,046 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 332 transitions, 4365 flow
[2024-06-20 20:11:41,048 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-20 20:11:41,048 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-20 20:11:41,048 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 218 transitions.
[2024-06-20 20:11:41,049 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43253968253968256
[2024-06-20 20:11:41,049 INFO  L175             Difference]: Start difference. First operand has 220 places, 280 transitions, 3487 flow. Second operand 12 states and 218 transitions.
[2024-06-20 20:11:41,049 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 332 transitions, 4365 flow
[2024-06-20 20:11:41,529 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 332 transitions, 4162 flow, removed 34 selfloop flow, removed 10 redundant places.
[2024-06-20 20:11:41,533 INFO  L231             Difference]: Finished difference. Result has 222 places, 281 transitions, 3479 flow
[2024-06-20 20:11:41,533 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3284, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3479, PETRI_PLACES=222, PETRI_TRANSITIONS=281}
[2024-06-20 20:11:41,533 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 179 predicate places.
[2024-06-20 20:11:41,534 INFO  L495      AbstractCegarLoop]: Abstraction has has 222 places, 281 transitions, 3479 flow
[2024-06-20 20:11:41,534 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-20 20:11:41,534 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:11:41,534 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-20 20:11:41,534 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-20 20:11:41,534 INFO  L420      AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:11:41,534 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:11:41,534 INFO  L85        PathProgramCache]: Analyzing trace with hash -1127050383, now seen corresponding path program 9 times
[2024-06-20 20:11:41,535 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:11:41,535 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020734602]
[2024-06-20 20:11:41,535 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:11:41,535 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:11:41,600 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:11:49,963 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:11:49,964 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:11:49,964 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020734602]
[2024-06-20 20:11:49,964 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020734602] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:11:49,964 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:11:49,964 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:11:49,964 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500056878]
[2024-06-20 20:11:49,964 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:11:49,964 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:11:49,965 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:11:49,965 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:11:49,965 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:11:50,182 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:11:50,182 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 281 transitions, 3479 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-20 20:11:50,182 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:11:50,182 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:11:50,183 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:11:52,129 INFO  L124   PetriNetUnfolderBase]: 2863/4546 cut-off events.
[2024-06-20 20:11:52,130 INFO  L125   PetriNetUnfolderBase]: For 415678/415678 co-relation queries the response was YES.
[2024-06-20 20:11:52,152 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36696 conditions, 4546 events. 2863/4546 cut-off events. For 415678/415678 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 26246 event pairs, 603 based on Foata normal form. 16/4555 useless extension candidates. Maximal degree in co-relation 36590. Up to 3496 conditions per place. 
[2024-06-20 20:11:52,167 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 263 selfloop transitions, 73 changer transitions 0/341 dead transitions.
[2024-06-20 20:11:52,167 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 341 transitions, 4659 flow
[2024-06-20 20:11:52,169 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-20 20:11:52,169 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-20 20:11:52,169 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 228 transitions.
[2024-06-20 20:11:52,169 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-20 20:11:52,170 INFO  L175             Difference]: Start difference. First operand has 222 places, 281 transitions, 3479 flow. Second operand 12 states and 228 transitions.
[2024-06-20 20:11:52,170 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 341 transitions, 4659 flow
[2024-06-20 20:11:52,546 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 341 transitions, 4492 flow, removed 15 selfloop flow, removed 10 redundant places.
[2024-06-20 20:11:52,550 INFO  L231             Difference]: Finished difference. Result has 224 places, 283 transitions, 3562 flow
[2024-06-20 20:11:52,550 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3312, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3562, PETRI_PLACES=224, PETRI_TRANSITIONS=283}
[2024-06-20 20:11:52,550 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 181 predicate places.
[2024-06-20 20:11:52,550 INFO  L495      AbstractCegarLoop]: Abstraction has has 224 places, 283 transitions, 3562 flow
[2024-06-20 20:11:52,550 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-20 20:11:52,551 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:11:52,551 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-20 20:11:52,551 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-20 20:11:52,551 INFO  L420      AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:11:52,551 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:11:52,551 INFO  L85        PathProgramCache]: Analyzing trace with hash -1126872753, now seen corresponding path program 10 times
[2024-06-20 20:11:52,551 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:11:52,552 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120951577]
[2024-06-20 20:11:52,552 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:11:52,552 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:11:52,628 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:12:02,183 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:12:02,183 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:12:02,184 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120951577]
[2024-06-20 20:12:02,184 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120951577] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:12:02,184 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:12:02,184 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:12:02,184 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117201855]
[2024-06-20 20:12:02,184 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:12:02,184 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:12:02,184 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:12:02,185 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:12:02,185 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:12:02,349 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:12:02,350 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 283 transitions, 3562 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-20 20:12:02,350 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:12:02,350 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:12:02,350 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:12:04,108 INFO  L124   PetriNetUnfolderBase]: 2863/4554 cut-off events.
[2024-06-20 20:12:04,109 INFO  L125   PetriNetUnfolderBase]: For 415254/415254 co-relation queries the response was YES.
[2024-06-20 20:12:04,132 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36093 conditions, 4554 events. 2863/4554 cut-off events. For 415254/415254 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 26405 event pairs, 627 based on Foata normal form. 20/4567 useless extension candidates. Maximal degree in co-relation 35986. Up to 3892 conditions per place. 
[2024-06-20 20:12:04,146 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 262 selfloop transitions, 69 changer transitions 0/336 dead transitions.
[2024-06-20 20:12:04,146 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 336 transitions, 4456 flow
[2024-06-20 20:12:04,148 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-20 20:12:04,148 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-20 20:12:04,148 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 223 transitions.
[2024-06-20 20:12:04,149 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44246031746031744
[2024-06-20 20:12:04,149 INFO  L175             Difference]: Start difference. First operand has 224 places, 283 transitions, 3562 flow. Second operand 12 states and 223 transitions.
[2024-06-20 20:12:04,149 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 336 transitions, 4456 flow
[2024-06-20 20:12:04,590 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 336 transitions, 4309 flow, removed 29 selfloop flow, removed 8 redundant places.
[2024-06-20 20:12:04,594 INFO  L231             Difference]: Finished difference. Result has 228 places, 284 transitions, 3612 flow
[2024-06-20 20:12:04,594 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3425, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3612, PETRI_PLACES=228, PETRI_TRANSITIONS=284}
[2024-06-20 20:12:04,594 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 185 predicate places.
[2024-06-20 20:12:04,595 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 284 transitions, 3612 flow
[2024-06-20 20:12:04,595 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-20 20:12:04,595 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:12:04,595 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-20 20:12:04,595 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-20 20:12:04,595 INFO  L420      AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:12:04,595 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:12:04,596 INFO  L85        PathProgramCache]: Analyzing trace with hash -890393779, now seen corresponding path program 2 times
[2024-06-20 20:12:04,596 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:12:04,596 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944584796]
[2024-06-20 20:12:04,596 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:12:04,596 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:12:04,678 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:12:12,978 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:12:12,978 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:12:12,978 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944584796]
[2024-06-20 20:12:12,978 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944584796] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:12:12,978 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:12:12,978 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:12:12,978 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039500573]
[2024-06-20 20:12:12,979 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:12:12,979 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:12:12,979 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:12:12,979 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:12:12,979 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:12:13,180 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:12:13,180 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 284 transitions, 3612 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:12:13,180 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:12:13,180 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:12:13,180 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:12:15,010 INFO  L124   PetriNetUnfolderBase]: 2904/4638 cut-off events.
[2024-06-20 20:12:15,010 INFO  L125   PetriNetUnfolderBase]: For 411424/411424 co-relation queries the response was YES.
[2024-06-20 20:12:15,036 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36627 conditions, 4638 events. 2904/4638 cut-off events. For 411424/411424 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 27093 event pairs, 567 based on Foata normal form. 12/4648 useless extension candidates. Maximal degree in co-relation 36518. Up to 3740 conditions per place. 
[2024-06-20 20:12:15,051 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 269 selfloop transitions, 64 changer transitions 0/338 dead transitions.
[2024-06-20 20:12:15,052 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 338 transitions, 4734 flow
[2024-06-20 20:12:15,053 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 20:12:15,053 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 20:12:15,053 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 211 transitions.
[2024-06-20 20:12:15,054 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45670995670995673
[2024-06-20 20:12:15,054 INFO  L175             Difference]: Start difference. First operand has 228 places, 284 transitions, 3612 flow. Second operand 11 states and 211 transitions.
[2024-06-20 20:12:15,054 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 338 transitions, 4734 flow
[2024-06-20 20:12:15,585 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 338 transitions, 4577 flow, removed 11 selfloop flow, removed 10 redundant places.
[2024-06-20 20:12:15,589 INFO  L231             Difference]: Finished difference. Result has 229 places, 285 transitions, 3641 flow
[2024-06-20 20:12:15,589 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3455, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3641, PETRI_PLACES=229, PETRI_TRANSITIONS=285}
[2024-06-20 20:12:15,590 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 186 predicate places.
[2024-06-20 20:12:15,590 INFO  L495      AbstractCegarLoop]: Abstraction has has 229 places, 285 transitions, 3641 flow
[2024-06-20 20:12:15,590 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:12:15,590 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:12:15,590 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-20 20:12:15,590 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2024-06-20 20:12:15,590 INFO  L420      AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:12:15,591 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:12:15,591 INFO  L85        PathProgramCache]: Analyzing trace with hash -652584115, now seen corresponding path program 3 times
[2024-06-20 20:12:15,591 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:12:15,591 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043174171]
[2024-06-20 20:12:15,591 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:12:15,591 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:12:15,657 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:12:24,684 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:12:24,684 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:12:24,684 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043174171]
[2024-06-20 20:12:24,684 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043174171] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:12:24,684 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:12:24,684 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:12:24,684 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091005257]
[2024-06-20 20:12:24,684 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:12:24,684 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:12:24,684 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:12:24,685 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:12:24,685 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:12:24,917 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:12:24,918 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 285 transitions, 3641 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:12:24,918 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:12:24,918 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:12:24,918 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:12:26,858 INFO  L124   PetriNetUnfolderBase]: 2945/4719 cut-off events.
[2024-06-20 20:12:26,859 INFO  L125   PetriNetUnfolderBase]: For 424683/424683 co-relation queries the response was YES.
[2024-06-20 20:12:26,882 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37170 conditions, 4719 events. 2945/4719 cut-off events. For 424683/424683 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 27809 event pairs, 582 based on Foata normal form. 12/4729 useless extension candidates. Maximal degree in co-relation 37060. Up to 3947 conditions per place. 
[2024-06-20 20:12:26,896 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 268 selfloop transitions, 66 changer transitions 0/339 dead transitions.
[2024-06-20 20:12:26,896 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 339 transitions, 4559 flow
[2024-06-20 20:12:26,898 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-20 20:12:26,898 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-20 20:12:26,898 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 220 transitions.
[2024-06-20 20:12:26,898 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4365079365079365
[2024-06-20 20:12:26,898 INFO  L175             Difference]: Start difference. First operand has 229 places, 285 transitions, 3641 flow. Second operand 12 states and 220 transitions.
[2024-06-20 20:12:26,898 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 339 transitions, 4559 flow
[2024-06-20 20:12:27,433 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 339 transitions, 4405 flow, removed 19 selfloop flow, removed 8 redundant places.
[2024-06-20 20:12:27,437 INFO  L231             Difference]: Finished difference. Result has 233 places, 286 transitions, 3679 flow
[2024-06-20 20:12:27,437 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3487, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3679, PETRI_PLACES=233, PETRI_TRANSITIONS=286}
[2024-06-20 20:12:27,437 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 190 predicate places.
[2024-06-20 20:12:27,438 INFO  L495      AbstractCegarLoop]: Abstraction has has 233 places, 286 transitions, 3679 flow
[2024-06-20 20:12:27,438 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:12:27,438 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:12:27,438 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-20 20:12:27,438 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2024-06-20 20:12:27,438 INFO  L420      AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:12:27,438 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:12:27,438 INFO  L85        PathProgramCache]: Analyzing trace with hash 1306873517, now seen corresponding path program 4 times
[2024-06-20 20:12:27,439 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:12:27,439 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180682475]
[2024-06-20 20:12:27,439 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:12:27,439 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:12:27,517 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:12:35,443 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:12:35,443 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:12:35,443 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180682475]
[2024-06-20 20:12:35,443 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180682475] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:12:35,444 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:12:35,444 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:12:35,444 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839949536]
[2024-06-20 20:12:35,444 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:12:35,444 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:12:35,444 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:12:35,444 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:12:35,445 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:12:35,643 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:12:35,643 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 286 transitions, 3679 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-20 20:12:35,643 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:12:35,643 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:12:35,644 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:12:37,583 INFO  L124   PetriNetUnfolderBase]: 2925/4679 cut-off events.
[2024-06-20 20:12:37,584 INFO  L125   PetriNetUnfolderBase]: For 416520/416520 co-relation queries the response was YES.
[2024-06-20 20:12:37,608 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36276 conditions, 4679 events. 2925/4679 cut-off events. For 416520/416520 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 27575 event pairs, 578 based on Foata normal form. 12/4684 useless extension candidates. Maximal degree in co-relation 36165. Up to 3015 conditions per place. 
[2024-06-20 20:12:37,622 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 249 selfloop transitions, 86 changer transitions 0/340 dead transitions.
[2024-06-20 20:12:37,622 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 340 transitions, 4685 flow
[2024-06-20 20:12:37,623 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-20 20:12:37,623 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-20 20:12:37,623 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 220 transitions.
[2024-06-20 20:12:37,624 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4365079365079365
[2024-06-20 20:12:37,624 INFO  L175             Difference]: Start difference. First operand has 233 places, 286 transitions, 3679 flow. Second operand 12 states and 220 transitions.
[2024-06-20 20:12:37,624 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 340 transitions, 4685 flow
[2024-06-20 20:12:38,185 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 340 transitions, 4515 flow, removed 20 selfloop flow, removed 10 redundant places.
[2024-06-20 20:12:38,189 INFO  L231             Difference]: Finished difference. Result has 235 places, 286 transitions, 3687 flow
[2024-06-20 20:12:38,189 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3509, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3687, PETRI_PLACES=235, PETRI_TRANSITIONS=286}
[2024-06-20 20:12:38,189 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 192 predicate places.
[2024-06-20 20:12:38,189 INFO  L495      AbstractCegarLoop]: Abstraction has has 235 places, 286 transitions, 3687 flow
[2024-06-20 20:12:38,189 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-20 20:12:38,189 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:12:38,190 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-20 20:12:38,190 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2024-06-20 20:12:38,190 INFO  L420      AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:12:38,190 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:12:38,190 INFO  L85        PathProgramCache]: Analyzing trace with hash -667766300, now seen corresponding path program 2 times
[2024-06-20 20:12:38,190 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:12:38,190 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236416043]
[2024-06-20 20:12:38,191 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:12:38,191 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:12:38,227 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:12:46,758 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:12:46,758 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:12:46,758 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236416043]
[2024-06-20 20:12:46,758 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236416043] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:12:46,758 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:12:46,758 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:12:46,758 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224341408]
[2024-06-20 20:12:46,758 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:12:46,759 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:12:46,759 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:12:46,759 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:12:46,759 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:12:46,928 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:12:46,928 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 286 transitions, 3687 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-20 20:12:46,928 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:12:46,928 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:12:46,928 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:12:48,449 INFO  L124   PetriNetUnfolderBase]: 2922/4688 cut-off events.
[2024-06-20 20:12:48,449 INFO  L125   PetriNetUnfolderBase]: For 406895/406895 co-relation queries the response was YES.
[2024-06-20 20:12:48,475 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36329 conditions, 4688 events. 2922/4688 cut-off events. For 406895/406895 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 27703 event pairs, 737 based on Foata normal form. 1/4687 useless extension candidates. Maximal degree in co-relation 36217. Up to 4397 conditions per place. 
[2024-06-20 20:12:48,489 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 270 selfloop transitions, 37 changer transitions 0/312 dead transitions.
[2024-06-20 20:12:48,489 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 312 transitions, 4379 flow
[2024-06-20 20:12:48,490 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:12:48,490 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:12:48,490 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions.
[2024-06-20 20:12:48,491 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41798941798941797
[2024-06-20 20:12:48,491 INFO  L175             Difference]: Start difference. First operand has 235 places, 286 transitions, 3687 flow. Second operand 9 states and 158 transitions.
[2024-06-20 20:12:48,491 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 312 transitions, 4379 flow
[2024-06-20 20:12:49,123 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 312 transitions, 4025 flow, removed 39 selfloop flow, removed 13 redundant places.
[2024-06-20 20:12:49,127 INFO  L231             Difference]: Finished difference. Result has 231 places, 286 transitions, 3417 flow
[2024-06-20 20:12:49,127 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3333, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3417, PETRI_PLACES=231, PETRI_TRANSITIONS=286}
[2024-06-20 20:12:49,129 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 188 predicate places.
[2024-06-20 20:12:49,129 INFO  L495      AbstractCegarLoop]: Abstraction has has 231 places, 286 transitions, 3417 flow
[2024-06-20 20:12:49,129 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-20 20:12:49,129 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:12:49,129 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-20 20:12:49,129 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2024-06-20 20:12:49,129 INFO  L420      AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:12:49,130 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:12:49,130 INFO  L85        PathProgramCache]: Analyzing trace with hash -662909840, now seen corresponding path program 3 times
[2024-06-20 20:12:49,130 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:12:49,130 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38785578]
[2024-06-20 20:12:49,130 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:12:49,130 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:12:49,164 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:12:58,234 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:12:58,234 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:12:58,235 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38785578]
[2024-06-20 20:12:58,235 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38785578] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:12:58,235 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:12:58,235 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:12:58,235 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476479705]
[2024-06-20 20:12:58,235 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:12:58,235 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:12:58,235 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:12:58,236 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:12:58,236 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:12:58,374 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:12:58,374 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 286 transitions, 3417 flow. Second operand  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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-20 20:12:58,374 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:12:58,374 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:12:58,374 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:12:59,815 INFO  L124   PetriNetUnfolderBase]: 2912/4666 cut-off events.
[2024-06-20 20:12:59,815 INFO  L125   PetriNetUnfolderBase]: For 410170/410170 co-relation queries the response was YES.
[2024-06-20 20:12:59,839 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34896 conditions, 4666 events. 2912/4666 cut-off events. For 410170/410170 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 27518 event pairs, 793 based on Foata normal form. 2/4662 useless extension candidates. Maximal degree in co-relation 34786. Up to 4309 conditions per place. 
[2024-06-20 20:12:59,851 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 240 selfloop transitions, 55 changer transitions 0/300 dead transitions.
[2024-06-20 20:12:59,851 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 300 transitions, 4049 flow
[2024-06-20 20:12:59,852 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:12:59,852 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:12:59,852 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-20 20:12:59,852 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4217687074829932
[2024-06-20 20:12:59,853 INFO  L175             Difference]: Start difference. First operand has 231 places, 286 transitions, 3417 flow. Second operand 7 states and 124 transitions.
[2024-06-20 20:12:59,853 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 300 transitions, 4049 flow
[2024-06-20 20:13:00,584 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 300 transitions, 3905 flow, removed 26 selfloop flow, removed 9 redundant places.
[2024-06-20 20:13:00,587 INFO  L231             Difference]: Finished difference. Result has 229 places, 286 transitions, 3397 flow
[2024-06-20 20:13:00,587 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3273, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3397, PETRI_PLACES=229, PETRI_TRANSITIONS=286}
[2024-06-20 20:13:00,588 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 186 predicate places.
[2024-06-20 20:13:00,588 INFO  L495      AbstractCegarLoop]: Abstraction has has 229 places, 286 transitions, 3397 flow
[2024-06-20 20:13:00,588 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 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-20 20:13:00,588 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:13:00,588 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-20 20:13:00,588 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71
[2024-06-20 20:13:00,588 INFO  L420      AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:13:00,589 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:13:00,589 INFO  L85        PathProgramCache]: Analyzing trace with hash 1014320331, now seen corresponding path program 1 times
[2024-06-20 20:13:00,589 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:13:00,589 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071348053]
[2024-06-20 20:13:00,589 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:13:00,589 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:13:00,626 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:13:09,786 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:13:09,787 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:13:09,787 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071348053]
[2024-06-20 20:13:09,787 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071348053] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:13:09,787 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:13:09,787 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:13:09,787 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489229678]
[2024-06-20 20:13:09,787 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:13:09,788 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:13:09,788 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:13:09,788 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:13:09,788 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:13:09,907 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:13:09,908 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 286 transitions, 3397 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:13:09,908 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:13:09,908 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:13:09,908 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:13:11,425 INFO  L124   PetriNetUnfolderBase]: 2969/4753 cut-off events.
[2024-06-20 20:13:11,425 INFO  L125   PetriNetUnfolderBase]: For 439745/439745 co-relation queries the response was YES.
[2024-06-20 20:13:11,446 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35318 conditions, 4753 events. 2969/4753 cut-off events. For 439745/439745 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 28083 event pairs, 803 based on Foata normal form. 14/4760 useless extension candidates. Maximal degree in co-relation 35209. Up to 4430 conditions per place. 
[2024-06-20 20:13:11,458 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 255 selfloop transitions, 47 changer transitions 0/307 dead transitions.
[2024-06-20 20:13:11,458 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 307 transitions, 4161 flow
[2024-06-20 20:13:11,459 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:13:11,459 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:13:11,459 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions.
[2024-06-20 20:13:11,459 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4107142857142857
[2024-06-20 20:13:11,459 INFO  L175             Difference]: Start difference. First operand has 229 places, 286 transitions, 3397 flow. Second operand 8 states and 138 transitions.
[2024-06-20 20:13:11,459 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 307 transitions, 4161 flow
[2024-06-20 20:13:12,042 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 307 transitions, 4019 flow, removed 3 selfloop flow, removed 7 redundant places.
[2024-06-20 20:13:12,045 INFO  L231             Difference]: Finished difference. Result has 231 places, 292 transitions, 3466 flow
[2024-06-20 20:13:12,046 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3255, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3466, PETRI_PLACES=231, PETRI_TRANSITIONS=292}
[2024-06-20 20:13:12,046 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 188 predicate places.
[2024-06-20 20:13:12,046 INFO  L495      AbstractCegarLoop]: Abstraction has has 231 places, 292 transitions, 3466 flow
[2024-06-20 20:13:12,046 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:13:12,046 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:13:12,046 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-20 20:13:12,046 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72
[2024-06-20 20:13:12,047 INFO  L420      AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:13:12,047 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:13:12,047 INFO  L85        PathProgramCache]: Analyzing trace with hash 1029975021, now seen corresponding path program 2 times
[2024-06-20 20:13:12,047 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:13:12,047 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087484024]
[2024-06-20 20:13:12,047 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:13:12,047 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:13:12,083 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:13:21,156 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:13:21,156 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:13:21,156 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087484024]
[2024-06-20 20:13:21,156 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087484024] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:13:21,156 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:13:21,156 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:13:21,156 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810485895]
[2024-06-20 20:13:21,156 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:13:21,156 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:13:21,156 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:13:21,157 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:13:21,157 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:13:21,287 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:13:21,287 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 292 transitions, 3466 flow. Second operand  has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 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-20 20:13:21,288 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:13:21,288 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:13:21,288 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:13:22,865 INFO  L124   PetriNetUnfolderBase]: 3003/4814 cut-off events.
[2024-06-20 20:13:22,866 INFO  L125   PetriNetUnfolderBase]: For 425682/425685 co-relation queries the response was YES.
[2024-06-20 20:13:22,891 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35912 conditions, 4814 events. 3003/4814 cut-off events. For 425682/425685 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 28491 event pairs, 808 based on Foata normal form. 10/4820 useless extension candidates. Maximal degree in co-relation 35802. Up to 4233 conditions per place. 
[2024-06-20 20:13:22,905 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 223 selfloop transitions, 92 changer transitions 0/320 dead transitions.
[2024-06-20 20:13:22,905 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 320 transitions, 4423 flow
[2024-06-20 20:13:22,906 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:13:22,906 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:13:22,906 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions.
[2024-06-20 20:13:22,907 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-20 20:13:22,907 INFO  L175             Difference]: Start difference. First operand has 231 places, 292 transitions, 3466 flow. Second operand 9 states and 162 transitions.
[2024-06-20 20:13:22,907 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 320 transitions, 4423 flow
[2024-06-20 20:13:23,526 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 320 transitions, 4304 flow, removed 20 selfloop flow, removed 5 redundant places.
[2024-06-20 20:13:23,530 INFO  L231             Difference]: Finished difference. Result has 236 places, 298 transitions, 3677 flow
[2024-06-20 20:13:23,530 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3347, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3677, PETRI_PLACES=236, PETRI_TRANSITIONS=298}
[2024-06-20 20:13:23,530 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 193 predicate places.
[2024-06-20 20:13:23,530 INFO  L495      AbstractCegarLoop]: Abstraction has has 236 places, 298 transitions, 3677 flow
[2024-06-20 20:13:23,531 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 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-20 20:13:23,531 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:13:23,531 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-20 20:13:23,531 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73
[2024-06-20 20:13:23,531 INFO  L420      AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:13:23,531 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:13:23,531 INFO  L85        PathProgramCache]: Analyzing trace with hash -389070993, now seen corresponding path program 3 times
[2024-06-20 20:13:23,531 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:13:23,532 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437976636]
[2024-06-20 20:13:23,532 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:13:23,532 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:13:23,586 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:13:33,521 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:13:33,522 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:13:33,522 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437976636]
[2024-06-20 20:13:33,522 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437976636] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:13:33,522 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:13:33,522 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:13:33,522 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033848742]
[2024-06-20 20:13:33,522 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:13:33,523 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:13:33,523 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:13:33,523 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:13:33,523 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:13:33,708 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:13:33,708 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 298 transitions, 3677 flow. Second operand  has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 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-20 20:13:33,708 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:13:33,708 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:13:33,709 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:13:35,200 INFO  L124   PetriNetUnfolderBase]: 3070/4921 cut-off events.
[2024-06-20 20:13:35,201 INFO  L125   PetriNetUnfolderBase]: For 461670/461670 co-relation queries the response was YES.
[2024-06-20 20:13:35,228 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37906 conditions, 4921 events. 3070/4921 cut-off events. For 461670/461670 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 29217 event pairs, 808 based on Foata normal form. 2/4921 useless extension candidates. Maximal degree in co-relation 37794. Up to 4378 conditions per place. 
[2024-06-20 20:13:35,243 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 254 selfloop transitions, 68 changer transitions 0/327 dead transitions.
[2024-06-20 20:13:35,243 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 327 transitions, 4686 flow
[2024-06-20 20:13:35,244 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:13:35,244 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:13:35,244 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions.
[2024-06-20 20:13:35,244 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41798941798941797
[2024-06-20 20:13:35,244 INFO  L175             Difference]: Start difference. First operand has 236 places, 298 transitions, 3677 flow. Second operand 9 states and 158 transitions.
[2024-06-20 20:13:35,244 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 327 transitions, 4686 flow
[2024-06-20 20:13:35,850 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 327 transitions, 4402 flow, removed 64 selfloop flow, removed 6 redundant places.
[2024-06-20 20:13:35,853 INFO  L231             Difference]: Finished difference. Result has 240 places, 302 transitions, 3665 flow
[2024-06-20 20:13:35,854 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3414, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3665, PETRI_PLACES=240, PETRI_TRANSITIONS=302}
[2024-06-20 20:13:35,854 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 197 predicate places.
[2024-06-20 20:13:35,854 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 302 transitions, 3665 flow
[2024-06-20 20:13:35,854 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 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-20 20:13:35,854 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:13:35,854 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-20 20:13:35,855 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74
[2024-06-20 20:13:35,855 INFO  L420      AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:13:35,855 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:13:35,855 INFO  L85        PathProgramCache]: Analyzing trace with hash -408792145, now seen corresponding path program 1 times
[2024-06-20 20:13:35,855 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:13:35,855 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244129534]
[2024-06-20 20:13:35,855 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:13:35,856 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:13:35,934 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:13:46,170 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:13:46,171 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:13:46,171 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244129534]
[2024-06-20 20:13:46,171 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244129534] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:13:46,171 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:13:46,171 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:13:46,171 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661981967]
[2024-06-20 20:13:46,171 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:13:46,171 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:13:46,172 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:13:46,172 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:13:46,172 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:13:46,381 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:13:46,382 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 302 transitions, 3665 flow. Second operand  has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 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-20 20:13:46,382 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:13:46,382 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:13:46,382 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:13:48,001 INFO  L124   PetriNetUnfolderBase]: 3126/4998 cut-off events.
[2024-06-20 20:13:48,002 INFO  L125   PetriNetUnfolderBase]: For 488527/488527 co-relation queries the response was YES.
[2024-06-20 20:13:48,030 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38971 conditions, 4998 events. 3126/4998 cut-off events. For 488527/488527 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 29724 event pairs, 749 based on Foata normal form. 4/4995 useless extension candidates. Maximal degree in co-relation 38858. Up to 4570 conditions per place. 
[2024-06-20 20:13:48,045 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 277 selfloop transitions, 48 changer transitions 0/330 dead transitions.
[2024-06-20 20:13:48,045 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 330 transitions, 4683 flow
[2024-06-20 20:13:48,046 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:13:48,046 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:13:48,046 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions.
[2024-06-20 20:13:48,046 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4255952380952381
[2024-06-20 20:13:48,046 INFO  L175             Difference]: Start difference. First operand has 240 places, 302 transitions, 3665 flow. Second operand 8 states and 143 transitions.
[2024-06-20 20:13:48,047 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 330 transitions, 4683 flow
[2024-06-20 20:13:48,623 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 330 transitions, 4564 flow, removed 24 selfloop flow, removed 5 redundant places.
[2024-06-20 20:13:48,627 INFO  L231             Difference]: Finished difference. Result has 244 places, 310 transitions, 3839 flow
[2024-06-20 20:13:48,627 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3546, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3839, PETRI_PLACES=244, PETRI_TRANSITIONS=310}
[2024-06-20 20:13:48,627 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 201 predicate places.
[2024-06-20 20:13:48,627 INFO  L495      AbstractCegarLoop]: Abstraction has has 244 places, 310 transitions, 3839 flow
[2024-06-20 20:13:48,627 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 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-20 20:13:48,628 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:13:48,628 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-20 20:13:48,628 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75
[2024-06-20 20:13:48,628 INFO  L420      AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:13:48,628 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:13:48,628 INFO  L85        PathProgramCache]: Analyzing trace with hash -405067495, now seen corresponding path program 2 times
[2024-06-20 20:13:48,628 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:13:48,628 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75614934]
[2024-06-20 20:13:48,629 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:13:48,629 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:13:48,704 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:13:57,876 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:13:57,876 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:13:57,876 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75614934]
[2024-06-20 20:13:57,876 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75614934] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:13:57,877 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:13:57,877 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:13:57,877 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265700205]
[2024-06-20 20:13:57,877 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:13:57,877 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:13:57,877 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:13:57,878 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:13:57,878 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:13:58,078 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:13:58,078 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 310 transitions, 3839 flow. Second operand  has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 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-20 20:13:58,078 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:13:58,079 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:13:58,079 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:13:59,769 INFO  L124   PetriNetUnfolderBase]: 3210/5119 cut-off events.
[2024-06-20 20:13:59,770 INFO  L125   PetriNetUnfolderBase]: For 528891/528891 co-relation queries the response was YES.
[2024-06-20 20:13:59,799 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41418 conditions, 5119 events. 3210/5119 cut-off events. For 528891/528891 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 30448 event pairs, 737 based on Foata normal form. 4/5116 useless extension candidates. Maximal degree in co-relation 41302. Up to 4511 conditions per place. 
[2024-06-20 20:13:59,815 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 256 selfloop transitions, 86 changer transitions 0/347 dead transitions.
[2024-06-20 20:13:59,815 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 347 transitions, 5169 flow
[2024-06-20 20:13:59,816 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:13:59,816 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:13:59,816 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions.
[2024-06-20 20:13:59,817 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4312169312169312
[2024-06-20 20:13:59,817 INFO  L175             Difference]: Start difference. First operand has 244 places, 310 transitions, 3839 flow. Second operand 9 states and 163 transitions.
[2024-06-20 20:13:59,817 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 347 transitions, 5169 flow
[2024-06-20 20:14:00,492 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 347 transitions, 5015 flow, removed 54 selfloop flow, removed 4 redundant places.
[2024-06-20 20:14:00,496 INFO  L231             Difference]: Finished difference. Result has 250 places, 322 transitions, 4200 flow
[2024-06-20 20:14:00,496 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3685, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4200, PETRI_PLACES=250, PETRI_TRANSITIONS=322}
[2024-06-20 20:14:00,496 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 207 predicate places.
[2024-06-20 20:14:00,496 INFO  L495      AbstractCegarLoop]: Abstraction has has 250 places, 322 transitions, 4200 flow
[2024-06-20 20:14:00,497 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 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-20 20:14:00,497 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:14:00,497 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-20 20:14:00,497 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76
[2024-06-20 20:14:00,497 INFO  L420      AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:14:00,497 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:14:00,497 INFO  L85        PathProgramCache]: Analyzing trace with hash -405073075, now seen corresponding path program 3 times
[2024-06-20 20:14:00,498 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:14:00,498 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261739759]
[2024-06-20 20:14:00,498 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:14:00,498 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:14:00,577 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:14:10,164 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:14:10,164 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:14:10,164 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261739759]
[2024-06-20 20:14:10,164 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261739759] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:14:10,164 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:14:10,165 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:14:10,165 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65759271]
[2024-06-20 20:14:10,165 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:14:10,165 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:14:10,165 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:14:10,165 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:14:10,165 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:14:10,394 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:14:10,395 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 322 transitions, 4200 flow. Second operand  has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 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-20 20:14:10,395 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:14:10,395 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:14:10,395 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:14:12,222 INFO  L124   PetriNetUnfolderBase]: 3202/5111 cut-off events.
[2024-06-20 20:14:12,223 INFO  L125   PetriNetUnfolderBase]: For 534968/534968 co-relation queries the response was YES.
[2024-06-20 20:14:12,250 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41866 conditions, 5111 events. 3202/5111 cut-off events. For 534968/534968 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 30485 event pairs, 748 based on Foata normal form. 4/5113 useless extension candidates. Maximal degree in co-relation 41747. Up to 4508 conditions per place. 
[2024-06-20 20:14:12,264 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 265 selfloop transitions, 82 changer transitions 0/352 dead transitions.
[2024-06-20 20:14:12,265 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 352 transitions, 5276 flow
[2024-06-20 20:14:12,265 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:14:12,265 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:14:12,266 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions.
[2024-06-20 20:14:12,266 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.430952380952381
[2024-06-20 20:14:12,266 INFO  L175             Difference]: Start difference. First operand has 250 places, 322 transitions, 4200 flow. Second operand 10 states and 181 transitions.
[2024-06-20 20:14:12,266 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 352 transitions, 5276 flow
[2024-06-20 20:14:12,931 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 352 transitions, 5046 flow, removed 92 selfloop flow, removed 4 redundant places.
[2024-06-20 20:14:12,935 INFO  L231             Difference]: Finished difference. Result has 256 places, 322 transitions, 4142 flow
[2024-06-20 20:14:12,935 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3970, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4142, PETRI_PLACES=256, PETRI_TRANSITIONS=322}
[2024-06-20 20:14:12,935 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 213 predicate places.
[2024-06-20 20:14:12,935 INFO  L495      AbstractCegarLoop]: Abstraction has has 256 places, 322 transitions, 4142 flow
[2024-06-20 20:14:12,935 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 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-20 20:14:12,936 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:14:12,936 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-20 20:14:12,936 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77
[2024-06-20 20:14:12,936 INFO  L420      AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:14:12,936 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:14:12,936 INFO  L85        PathProgramCache]: Analyzing trace with hash 869911183, now seen corresponding path program 1 times
[2024-06-20 20:14:12,936 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:14:12,936 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127151041]
[2024-06-20 20:14:12,937 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:14:12,937 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:14:12,975 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:14:21,930 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:14:21,930 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:14:21,930 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127151041]
[2024-06-20 20:14:21,930 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127151041] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:14:21,931 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:14:21,931 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:14:21,931 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540181901]
[2024-06-20 20:14:21,931 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:14:21,931 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:14:21,931 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:14:21,931 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:14:21,931 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:14:22,141 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:14:22,141 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 322 transitions, 4142 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:14:22,141 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:14:22,141 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:14:22,141 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:14:23,856 INFO  L124   PetriNetUnfolderBase]: 3234/5164 cut-off events.
[2024-06-20 20:14:23,857 INFO  L125   PetriNetUnfolderBase]: For 558208/558211 co-relation queries the response was YES.
[2024-06-20 20:14:23,883 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41859 conditions, 5164 events. 3234/5164 cut-off events. For 558208/558211 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 30860 event pairs, 837 based on Foata normal form. 10/5163 useless extension candidates. Maximal degree in co-relation 41738. Up to 4579 conditions per place. 
[2024-06-20 20:14:23,897 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 235 selfloop transitions, 101 changer transitions 0/341 dead transitions.
[2024-06-20 20:14:23,897 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 341 transitions, 4959 flow
[2024-06-20 20:14:23,898 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:14:23,898 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:14:23,898 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-20 20:14:23,898 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4226190476190476
[2024-06-20 20:14:23,898 INFO  L175             Difference]: Start difference. First operand has 256 places, 322 transitions, 4142 flow. Second operand 8 states and 142 transitions.
[2024-06-20 20:14:23,898 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 341 transitions, 4959 flow
[2024-06-20 20:14:24,698 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 341 transitions, 4671 flow, removed 20 selfloop flow, removed 11 redundant places.
[2024-06-20 20:14:24,702 INFO  L231             Difference]: Finished difference. Result has 253 places, 326 transitions, 4175 flow
[2024-06-20 20:14:24,702 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3854, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4175, PETRI_PLACES=253, PETRI_TRANSITIONS=326}
[2024-06-20 20:14:24,703 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 210 predicate places.
[2024-06-20 20:14:24,703 INFO  L495      AbstractCegarLoop]: Abstraction has has 253 places, 326 transitions, 4175 flow
[2024-06-20 20:14:24,703 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:14:24,703 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:14:24,703 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-20 20:14:24,703 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78
[2024-06-20 20:14:24,703 INFO  L420      AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:14:24,704 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:14:24,704 INFO  L85        PathProgramCache]: Analyzing trace with hash 764283259, now seen corresponding path program 4 times
[2024-06-20 20:14:24,704 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:14:24,704 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023200728]
[2024-06-20 20:14:24,704 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:14:24,704 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:14:24,764 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:14:34,577 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:14:34,577 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:14:34,577 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023200728]
[2024-06-20 20:14:34,577 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023200728] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:14:34,577 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:14:34,577 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:14:34,578 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954816045]
[2024-06-20 20:14:34,578 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:14:34,578 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:14:34,578 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:14:34,578 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:14:34,578 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:14:34,759 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 20:14:34,759 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 326 transitions, 4175 flow. Second operand  has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 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-20 20:14:34,759 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:14:34,759 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 20:14:34,759 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
Killed by 15