./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe024_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/safe024_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 bcb38a6f
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe024_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-bcb38a6-m
[2024-06-03 22:37:27,606 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-03 22:37:27,660 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-03 22:37:27,663 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-03 22:37:27,664 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-03 22:37:27,683 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-03 22:37:27,683 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-03 22:37:27,684 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-03 22:37:27,684 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-03 22:37:27,687 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-03 22:37:27,687 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-03 22:37:27,688 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-03 22:37:27,688 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-03 22:37:27,689 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-03 22:37:27,689 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-03 22:37:27,690 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-03 22:37:27,690 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-03 22:37:27,690 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-03 22:37:27,690 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-03 22:37:27,691 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-03 22:37:27,691 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-03 22:37:27,691 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-03 22:37:27,691 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-03 22:37:27,692 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-03 22:37:27,692 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-03 22:37:27,692 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-03 22:37:27,692 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-03 22:37:27,692 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-03 22:37:27,693 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-03 22:37:27,693 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-03 22:37:27,694 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-03 22:37:27,694 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-03 22:37:27,694 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-03 22:37:27,694 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-03 22:37:27,695 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-03 22:37:27,695 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-03 22:37:27,695 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-03 22:37:27,695 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-03 22:37:27,695 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-03 22:37:27,695 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-03 22:37:27,696 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-03 22:37:27,696 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-03 22:37:27,696 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-03 22:37:27,697 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-03 22:37:27,863 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-03 22:37:27,878 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-03 22:37:27,880 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-03 22:37:27,881 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-03 22:37:27,881 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-03 22:37:27,882 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-03 22:37:28,953 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-03 22:37:29,153 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-03 22:37:29,153 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-03 22:37:29,166 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bad268ba/6ccb2b1d121d4a3ea265742a599073c9/FLAG2f83214b5
[2024-06-03 22:37:29,177 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bad268ba/6ccb2b1d121d4a3ea265742a599073c9
[2024-06-03 22:37:29,179 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-03 22:37:29,180 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-03 22:37:29,180 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/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml
[2024-06-03 22:37:29,378 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-03 22:37:29,379 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-03 22:37:29,380 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-03 22:37:29,380 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-03 22:37:29,384 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-03 22:37:29,384 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:37:29" (1/2) ...
[2024-06-03 22:37:29,385 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e8eb999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:37:29, skipping insertion in model container
[2024-06-03 22:37:29,385 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:37:29" (1/2) ...
[2024-06-03 22:37:29,387 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@536d0244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:37:29, skipping insertion in model container
[2024-06-03 22:37:29,387 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:37:29" (2/2) ...
[2024-06-03 22:37:29,387 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e8eb999 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:29, skipping insertion in model container
[2024-06-03 22:37:29,387 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:37:29" (2/2) ...
[2024-06-03 22:37:29,388 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-03 22:37:29,468 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-03 22:37:29,470 INFO  L97    edCorrectnessWitness]: Location invariant before [L836-L836] (((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 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_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_thd0) + (long long )z >= 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_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 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_thd0) + (long long )z >= 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_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 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) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 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 )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 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 + (long long )z >= 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$flush_delayed + (long long )z >= 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$mem_tmp + (long long )z >= 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_thd0 + (long long )z >= 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_thd1 + (long long )z >= 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_thd2 + (long long )z >= 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_buff0_thd3 + (long long )z >= 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_thd0 + (long long )z >= 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_thd1 + (long long )z >= 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_thd2 + (long long )z >= 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$r_buff1_thd3 + (long long )z >= 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$read_delayed + (long long )z >= 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_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 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 )z >= 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) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)
[2024-06-03 22:37:29,470 INFO  L97    edCorrectnessWitness]: Location invariant before [L839-L839] (((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 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_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_thd0) + (long long )z >= 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_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 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_thd0) + (long long )z >= 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_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 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) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 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 )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 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 + (long long )z >= 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$flush_delayed + (long long )z >= 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$mem_tmp + (long long )z >= 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_thd0 + (long long )z >= 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_thd1 + (long long )z >= 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_thd2 + (long long )z >= 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_buff0_thd3 + (long long )z >= 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_thd0 + (long long )z >= 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_thd1 + (long long )z >= 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_thd2 + (long long )z >= 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$r_buff1_thd3 + (long long )z >= 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$read_delayed + (long long )z >= 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_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 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 )z >= 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) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)
[2024-06-03 22:37:29,471 INFO  L97    edCorrectnessWitness]: Location invariant before [L838-L838] (((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 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_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_thd0) + (long long )z >= 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_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 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_thd0) + (long long )z >= 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_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 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) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 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 )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 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 + (long long )z >= 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$flush_delayed + (long long )z >= 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$mem_tmp + (long long )z >= 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_thd0 + (long long )z >= 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_thd1 + (long long )z >= 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_thd2 + (long long )z >= 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_buff0_thd3 + (long long )z >= 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_thd0 + (long long )z >= 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_thd1 + (long long )z >= 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_thd2 + (long long )z >= 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$r_buff1_thd3 + (long long )z >= 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$read_delayed + (long long )z >= 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_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 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 )z >= 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) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)
[2024-06-03 22:37:29,472 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-03 22:37:29,472 INFO  L106   edCorrectnessWitness]: ghost_update [L834-L834] multithreaded = 1;
[2024-06-03 22:37:29,508 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-03 22:37:29,824 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-03 22:37:29,836 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-03 22:37:30,157 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-03 22:37:30,186 INFO  L206         MainTranslator]: Completed translation
[2024-06-03 22:37:30,187 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:30 WrapperNode
[2024-06-03 22:37:30,187 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-03 22:37:30,187 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-03 22:37:30,188 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-03 22:37:30,188 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-03 22:37:30,193 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 03.06 10:37:30" (1/1) ...
[2024-06-03 22:37:30,273 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 03.06 10:37:30" (1/1) ...
[2024-06-03 22:37:30,393 INFO  L138                Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 126
[2024-06-03 22:37:30,394 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-03 22:37:30,395 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-03 22:37:30,395 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-03 22:37:30,395 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-03 22:37:30,404 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:30" (1/1) ...
[2024-06-03 22:37:30,404 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:30" (1/1) ...
[2024-06-03 22:37:30,431 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:30" (1/1) ...
[2024-06-03 22:37:30,467 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-03 22:37:30,467 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:30" (1/1) ...
[2024-06-03 22:37:30,468 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:30" (1/1) ...
[2024-06-03 22:37:30,500 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:30" (1/1) ...
[2024-06-03 22:37:30,502 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:30" (1/1) ...
[2024-06-03 22:37:30,514 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:30" (1/1) ...
[2024-06-03 22:37:30,520 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:30" (1/1) ...
[2024-06-03 22:37:30,537 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-03 22:37:30,538 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-03 22:37:30,538 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-03 22:37:30,538 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-03 22:37:30,539 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:30" (1/1) ...
[2024-06-03 22:37:30,543 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-03 22:37:30,549 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-03 22:37:30,561 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-03 22:37:30,579 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-03 22:37:30,592 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-03 22:37:30,592 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-03 22:37:30,592 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-03 22:37:30,592 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-03 22:37:30,593 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-03 22:37:30,593 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-03 22:37:30,593 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-03 22:37:30,593 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-03 22:37:30,593 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-03 22:37:30,593 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-03 22:37:30,593 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-03 22:37:30,594 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-03 22:37:30,595 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-03 22:37:30,723 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-03 22:37:30,725 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-03 22:37:31,990 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-03 22:37:31,992 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-03 22:37:32,249 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-03 22:37:32,249 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-03 22:37:32,249 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:37:32 BoogieIcfgContainer
[2024-06-03 22:37:32,250 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-03 22:37:32,251 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-03 22:37:32,251 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-03 22:37:32,253 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-03 22:37:32,253 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 10:37:29" (1/4) ...
[2024-06-03 22:37:32,254 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3654b1ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:37:32, skipping insertion in model container
[2024-06-03 22:37:32,254 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:37:29" (2/4) ...
[2024-06-03 22:37:32,254 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3654b1ab and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:37:32, skipping insertion in model container
[2024-06-03 22:37:32,254 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:30" (3/4) ...
[2024-06-03 22:37:32,255 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3654b1ab and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:37:32, skipping insertion in model container
[2024-06-03 22:37:32,255 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:37:32" (4/4) ...
[2024-06-03 22:37:32,255 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-03 22:37:32,267 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-03 22:37:32,268 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-03 22:37:32,268 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-03 22:37:32,365 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-03 22:37:32,392 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow
[2024-06-03 22:37:32,438 INFO  L124   PetriNetUnfolderBase]: 0/39 cut-off events.
[2024-06-03 22:37:32,439 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-03 22:37:32,441 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 4. Compared 62 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-03 22:37:32,442 INFO  L82        GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow
[2024-06-03 22:37:32,444 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow
[2024-06-03 22:37:32,455 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-03 22:37:32,461 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;@6bdec7e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-03 22:37:32,461 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-03 22:37:32,469 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-03 22:37:32,469 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-03 22:37:32,470 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-03 22:37:32,470 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:37:32,470 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-03 22:37:32,471 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-03 22:37:32,475 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:37:32,475 INFO  L85        PathProgramCache]: Analyzing trace with hash -1623706950, now seen corresponding path program 1 times
[2024-06-03 22:37:32,483 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:37:32,483 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941419944]
[2024-06-03 22:37:32,483 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:37:32,484 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:37:32,915 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:37:39,192 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:37:39,193 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:37:39,193 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941419944]
[2024-06-03 22:37:39,194 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941419944] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:37:39,194 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:37:39,194 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-03 22:37:39,195 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207903151]
[2024-06-03 22:37:39,196 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:37:39,202 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-03 22:37:39,205 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:37:39,227 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-03 22:37:39,228 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-03 22:37:39,298 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42
[2024-06-03 22:37:39,301 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:37:39,301 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:37:39,301 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42
[2024-06-03 22:37:39,302 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:37:40,172 INFO  L124   PetriNetUnfolderBase]: 942/1466 cut-off events.
[2024-06-03 22:37:40,172 INFO  L125   PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES.
[2024-06-03 22:37:40,179 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2984 conditions, 1466 events. 942/1466 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7280 event pairs, 546 based on Foata normal form. 2/1428 useless extension candidates. Maximal degree in co-relation 2969. Up to 1428 conditions per place. 
[2024-06-03 22:37:40,186 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 33 selfloop transitions, 4 changer transitions 0/44 dead transitions.
[2024-06-03 22:37:40,187 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 44 transitions, 177 flow
[2024-06-03 22:37:40,188 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-03 22:37:40,190 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-03 22:37:40,195 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions.
[2024-06-03 22:37:40,196 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.626984126984127
[2024-06-03 22:37:40,197 INFO  L175             Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 79 transitions.
[2024-06-03 22:37:40,198 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 44 transitions, 177 flow
[2024-06-03 22:37:40,200 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-03 22:37:40,203 INFO  L231             Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow
[2024-06-03 22:37:40,205 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-03 22:37:40,207 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places.
[2024-06-03 22:37:40,207 INFO  L495      AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow
[2024-06-03 22:37:40,207 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:37:40,208 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:37:40,208 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:37:40,208 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-03 22:37:40,208 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-03 22:37:40,209 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:37:40,209 INFO  L85        PathProgramCache]: Analyzing trace with hash -1309217895, now seen corresponding path program 1 times
[2024-06-03 22:37:40,209 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:37:40,210 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761912673]
[2024-06-03 22:37:40,210 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:37:40,210 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:37:40,292 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:37:44,578 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:37:44,578 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:37:44,578 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761912673]
[2024-06-03 22:37:44,579 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761912673] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:37:44,579 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:37:44,579 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-03 22:37:44,579 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546132765]
[2024-06-03 22:37:44,579 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:37:44,581 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-03 22:37:44,581 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:37:44,581 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-03 22:37:44,582 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-03 22:37:44,694 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-03 22:37:44,695 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 102 flow. Second operand  has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:37:44,695 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:37:44,695 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-03 22:37:44,695 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:37:45,424 INFO  L124   PetriNetUnfolderBase]: 1140/1745 cut-off events.
[2024-06-03 22:37:45,424 INFO  L125   PetriNetUnfolderBase]: For 275/275 co-relation queries the response was YES.
[2024-06-03 22:37:45,427 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4038 conditions, 1745 events. 1140/1745 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8418 event pairs, 658 based on Foata normal form. 3/1746 useless extension candidates. Maximal degree in co-relation 4023. Up to 1700 conditions per place. 
[2024-06-03 22:37:45,433 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 43 selfloop transitions, 7 changer transitions 0/56 dead transitions.
[2024-06-03 22:37:45,433 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 258 flow
[2024-06-03 22:37:45,434 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-03 22:37:45,434 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-03 22:37:45,435 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions.
[2024-06-03 22:37:45,435 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5833333333333334
[2024-06-03 22:37:45,435 INFO  L175             Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 98 transitions.
[2024-06-03 22:37:45,435 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 258 flow
[2024-06-03 22:37:45,436 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-03 22:37:45,437 INFO  L231             Difference]: Finished difference. Result has 47 places, 42 transitions, 154 flow
[2024-06-03 22:37:45,437 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=47, PETRI_TRANSITIONS=42}
[2024-06-03 22:37:45,438 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places.
[2024-06-03 22:37:45,438 INFO  L495      AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 154 flow
[2024-06-03 22:37:45,438 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:37:45,438 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:37:45,438 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:37:45,439 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-03 22:37:45,439 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-03 22:37:45,439 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:37:45,439 INFO  L85        PathProgramCache]: Analyzing trace with hash 267055224, now seen corresponding path program 1 times
[2024-06-03 22:37:45,440 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:37:45,440 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111938732]
[2024-06-03 22:37:45,440 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:37:45,440 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:37:45,498 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:37:50,923 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:37:50,923 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:37:50,924 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111938732]
[2024-06-03 22:37:50,924 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111938732] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:37:50,924 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:37:50,924 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-03 22:37:50,924 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570366446]
[2024-06-03 22:37:50,925 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:37:50,925 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-03 22:37:50,925 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:37:50,926 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-03 22:37:50,926 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-03 22:37:51,036 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-03 22:37:51,037 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 154 flow. Second operand  has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:37:51,037 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:37:51,037 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-03 22:37:51,037 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:37:51,921 INFO  L124   PetriNetUnfolderBase]: 1134/1736 cut-off events.
[2024-06-03 22:37:51,922 INFO  L125   PetriNetUnfolderBase]: For 903/911 co-relation queries the response was YES.
[2024-06-03 22:37:51,924 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4500 conditions, 1736 events. 1134/1736 cut-off events. For 903/911 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8378 event pairs, 533 based on Foata normal form. 9/1743 useless extension candidates. Maximal degree in co-relation 4482. Up to 1676 conditions per place. 
[2024-06-03 22:37:51,929 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 50 selfloop transitions, 10 changer transitions 0/66 dead transitions.
[2024-06-03 22:37:51,929 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 340 flow
[2024-06-03 22:37:51,931 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 22:37:51,931 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 22:37:51,931 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions.
[2024-06-03 22:37:51,932 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5714285714285714
[2024-06-03 22:37:51,932 INFO  L175             Difference]: Start difference. First operand has 47 places, 42 transitions, 154 flow. Second operand 5 states and 120 transitions.
[2024-06-03 22:37:51,932 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 340 flow
[2024-06-03 22:37:51,933 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 338 flow, removed 1 selfloop flow, removed 0 redundant places.
[2024-06-03 22:37:51,934 INFO  L231             Difference]: Finished difference. Result has 52 places, 45 transitions, 200 flow
[2024-06-03 22:37:51,934 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=52, PETRI_TRANSITIONS=45}
[2024-06-03 22:37:51,935 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places.
[2024-06-03 22:37:51,935 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 200 flow
[2024-06-03 22:37:51,935 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:37:51,936 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:37:51,936 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:37:51,936 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-03 22:37:51,936 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-03 22:37:51,936 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:37:51,936 INFO  L85        PathProgramCache]: Analyzing trace with hash -894743445, now seen corresponding path program 1 times
[2024-06-03 22:37:51,937 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:37:51,937 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078547358]
[2024-06-03 22:37:51,937 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:37:51,937 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:37:52,001 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:38:01,196 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:38:01,197 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:38:01,200 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078547358]
[2024-06-03 22:38:01,200 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078547358] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:38:01,201 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:38:01,201 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-03 22:38:01,201 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550866743]
[2024-06-03 22:38:01,201 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:38:01,201 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-03 22:38:01,202 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:38:01,203 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-03 22:38:01,204 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-03 22:38:01,471 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-03 22:38:01,471 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 200 flow. Second operand  has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:38:01,471 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:38:01,471 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-03 22:38:01,471 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:38:02,272 INFO  L124   PetriNetUnfolderBase]: 1038/1612 cut-off events.
[2024-06-03 22:38:02,272 INFO  L125   PetriNetUnfolderBase]: For 1709/1709 co-relation queries the response was YES.
[2024-06-03 22:38:02,275 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4584 conditions, 1612 events. 1038/1612 cut-off events. For 1709/1709 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7825 event pairs, 474 based on Foata normal form. 4/1562 useless extension candidates. Maximal degree in co-relation 4563. Up to 1525 conditions per place. 
[2024-06-03 22:38:02,281 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 42 selfloop transitions, 12 changer transitions 0/64 dead transitions.
[2024-06-03 22:38:02,281 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 64 transitions, 372 flow
[2024-06-03 22:38:02,282 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:38:02,282 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:38:02,284 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions.
[2024-06-03 22:38:02,285 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4722222222222222
[2024-06-03 22:38:02,285 INFO  L175             Difference]: Start difference. First operand has 52 places, 45 transitions, 200 flow. Second operand 6 states and 119 transitions.
[2024-06-03 22:38:02,285 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 64 transitions, 372 flow
[2024-06-03 22:38:02,289 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 348 flow, removed 3 selfloop flow, removed 3 redundant places.
[2024-06-03 22:38:02,290 INFO  L231             Difference]: Finished difference. Result has 57 places, 53 transitions, 268 flow
[2024-06-03 22:38:02,291 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=57, PETRI_TRANSITIONS=53}
[2024-06-03 22:38:02,292 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places.
[2024-06-03 22:38:02,292 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 268 flow
[2024-06-03 22:38:02,292 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:38:02,292 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:38:02,292 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:38:02,293 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-03 22:38:02,293 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-03 22:38:02,293 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:38:02,293 INFO  L85        PathProgramCache]: Analyzing trace with hash -1057930921, now seen corresponding path program 1 times
[2024-06-03 22:38:02,293 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:38:02,293 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788387188]
[2024-06-03 22:38:02,294 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:38:02,294 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:38:02,357 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:38:07,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-03 22:38:07,264 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:38:07,265 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788387188]
[2024-06-03 22:38:07,265 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788387188] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:38:07,265 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:38:07,265 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-03 22:38:07,265 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723648024]
[2024-06-03 22:38:07,265 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:38:07,266 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-03 22:38:07,266 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:38:07,266 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-03 22:38:07,266 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-03 22:38:07,379 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-03 22:38:07,379 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 268 flow. Second operand  has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:38:07,380 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:38:07,382 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-03 22:38:07,382 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:38:08,391 INFO  L124   PetriNetUnfolderBase]: 1122/1717 cut-off events.
[2024-06-03 22:38:08,392 INFO  L125   PetriNetUnfolderBase]: For 2416/2424 co-relation queries the response was YES.
[2024-06-03 22:38:08,394 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5463 conditions, 1717 events. 1122/1717 cut-off events. For 2416/2424 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8116 event pairs, 380 based on Foata normal form. 12/1727 useless extension candidates. Maximal degree in co-relation 5438. Up to 1627 conditions per place. 
[2024-06-03 22:38:08,401 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 60 selfloop transitions, 13 changer transitions 0/79 dead transitions.
[2024-06-03 22:38:08,401 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 79 transitions, 488 flow
[2024-06-03 22:38:08,403 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:38:08,403 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:38:08,403 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions.
[2024-06-03 22:38:08,404 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5476190476190477
[2024-06-03 22:38:08,404 INFO  L175             Difference]: Start difference. First operand has 57 places, 53 transitions, 268 flow. Second operand 6 states and 138 transitions.
[2024-06-03 22:38:08,404 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 79 transitions, 488 flow
[2024-06-03 22:38:08,406 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 79 transitions, 474 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-03 22:38:08,407 INFO  L231             Difference]: Finished difference. Result has 60 places, 54 transitions, 297 flow
[2024-06-03 22:38:08,407 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=297, PETRI_PLACES=60, PETRI_TRANSITIONS=54}
[2024-06-03 22:38:08,407 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 17 predicate places.
[2024-06-03 22:38:08,407 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 297 flow
[2024-06-03 22:38:08,408 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:38:08,408 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:38:08,408 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:38:08,408 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-03 22:38:08,408 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-03 22:38:08,409 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:38:08,409 INFO  L85        PathProgramCache]: Analyzing trace with hash -1967242322, now seen corresponding path program 1 times
[2024-06-03 22:38:08,409 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:38:08,409 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693108419]
[2024-06-03 22:38:08,409 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:38:08,409 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:38:08,445 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:38:17,872 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:38:17,872 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:38:17,872 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693108419]
[2024-06-03 22:38:17,873 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693108419] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:38:17,873 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:38:17,873 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:38:17,873 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288127115]
[2024-06-03 22:38:17,873 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:38:17,873 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:38:17,874 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:38:17,874 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:38:17,874 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:38:17,992 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 22:38:17,992 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 297 flow. Second operand  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:38:17,992 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:38:17,992 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 22:38:17,993 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:38:18,959 INFO  L124   PetriNetUnfolderBase]: 1229/1899 cut-off events.
[2024-06-03 22:38:18,960 INFO  L125   PetriNetUnfolderBase]: For 4097/4113 co-relation queries the response was YES.
[2024-06-03 22:38:18,963 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6279 conditions, 1899 events. 1229/1899 cut-off events. For 4097/4113 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9301 event pairs, 529 based on Foata normal form. 2/1876 useless extension candidates. Maximal degree in co-relation 6253. Up to 1790 conditions per place. 
[2024-06-03 22:38:18,970 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 55 selfloop transitions, 12 changer transitions 0/77 dead transitions.
[2024-06-03 22:38:18,970 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 77 transitions, 514 flow
[2024-06-03 22:38:18,971 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:38:18,971 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:38:18,971 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions.
[2024-06-03 22:38:18,971 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46825396825396826
[2024-06-03 22:38:18,972 INFO  L175             Difference]: Start difference. First operand has 60 places, 54 transitions, 297 flow. Second operand 6 states and 118 transitions.
[2024-06-03 22:38:18,972 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 77 transitions, 514 flow
[2024-06-03 22:38:18,974 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 77 transitions, 477 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-06-03 22:38:18,975 INFO  L231             Difference]: Finished difference. Result has 64 places, 63 transitions, 362 flow
[2024-06-03 22:38:18,975 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=362, PETRI_PLACES=64, PETRI_TRANSITIONS=63}
[2024-06-03 22:38:18,975 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places.
[2024-06-03 22:38:18,975 INFO  L495      AbstractCegarLoop]: Abstraction has has 64 places, 63 transitions, 362 flow
[2024-06-03 22:38:18,976 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:38:18,976 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:38:18,976 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:38:18,976 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-03 22:38:18,976 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-03 22:38:18,976 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:38:18,977 INFO  L85        PathProgramCache]: Analyzing trace with hash -855215188, now seen corresponding path program 1 times
[2024-06-03 22:38:18,977 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:38:18,977 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322891660]
[2024-06-03 22:38:18,977 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:38:18,977 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:38:19,013 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:38:27,782 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:38:27,783 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:38:27,783 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322891660]
[2024-06-03 22:38:27,783 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322891660] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:38:27,783 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:38:27,783 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:38:27,783 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678158582]
[2024-06-03 22:38:27,783 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:38:27,784 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:38:27,784 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:38:27,784 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:38:27,784 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:38:27,877 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 22:38:27,877 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 362 flow. Second operand  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:38:27,877 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:38:27,877 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 22:38:27,877 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:38:28,822 INFO  L124   PetriNetUnfolderBase]: 1263/1942 cut-off events.
[2024-06-03 22:38:28,822 INFO  L125   PetriNetUnfolderBase]: For 5088/5114 co-relation queries the response was YES.
[2024-06-03 22:38:28,826 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6917 conditions, 1942 events. 1263/1942 cut-off events. For 5088/5114 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9367 event pairs, 500 based on Foata normal form. 16/1950 useless extension candidates. Maximal degree in co-relation 6887. Up to 1853 conditions per place. 
[2024-06-03 22:38:28,833 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 61 selfloop transitions, 14 changer transitions 0/84 dead transitions.
[2024-06-03 22:38:28,833 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 84 transitions, 578 flow
[2024-06-03 22:38:28,848 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:38:28,848 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:38:28,849 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions.
[2024-06-03 22:38:28,849 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48412698412698413
[2024-06-03 22:38:28,849 INFO  L175             Difference]: Start difference. First operand has 64 places, 63 transitions, 362 flow. Second operand 6 states and 122 transitions.
[2024-06-03 22:38:28,849 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 84 transitions, 578 flow
[2024-06-03 22:38:28,852 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 84 transitions, 572 flow, removed 2 selfloop flow, removed 1 redundant places.
[2024-06-03 22:38:28,853 INFO  L231             Difference]: Finished difference. Result has 69 places, 66 transitions, 414 flow
[2024-06-03 22:38:28,853 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=414, PETRI_PLACES=69, PETRI_TRANSITIONS=66}
[2024-06-03 22:38:28,854 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places.
[2024-06-03 22:38:28,854 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 414 flow
[2024-06-03 22:38:28,854 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:38:28,854 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:38:28,855 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:38:28,855 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-03 22:38:28,855 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-03 22:38:28,855 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:38:28,855 INFO  L85        PathProgramCache]: Analyzing trace with hash 603720696, now seen corresponding path program 2 times
[2024-06-03 22:38:28,855 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:38:28,856 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31228783]
[2024-06-03 22:38:28,856 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:38:28,856 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:38:28,927 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:38:37,503 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:38:37,503 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:38:37,503 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31228783]
[2024-06-03 22:38:37,503 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31228783] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:38:37,503 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:38:37,503 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:38:37,504 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945838976]
[2024-06-03 22:38:37,504 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:38:37,504 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:38:37,504 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:38:37,504 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:38:37,504 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:38:37,626 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 22:38:37,626 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 414 flow. Second operand  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:38:37,626 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:38:37,626 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 22:38:37,626 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:38:38,511 INFO  L124   PetriNetUnfolderBase]: 1293/1989 cut-off events.
[2024-06-03 22:38:38,511 INFO  L125   PetriNetUnfolderBase]: For 6899/6926 co-relation queries the response was YES.
[2024-06-03 22:38:38,515 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7687 conditions, 1989 events. 1293/1989 cut-off events. For 6899/6926 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9738 event pairs, 498 based on Foata normal form. 13/1990 useless extension candidates. Maximal degree in co-relation 7654. Up to 1865 conditions per place. 
[2024-06-03 22:38:38,523 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 61 selfloop transitions, 19 changer transitions 0/89 dead transitions.
[2024-06-03 22:38:38,523 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 89 transitions, 666 flow
[2024-06-03 22:38:38,526 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:38:38,526 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:38:38,527 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions.
[2024-06-03 22:38:38,527 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48412698412698413
[2024-06-03 22:38:38,527 INFO  L175             Difference]: Start difference. First operand has 69 places, 66 transitions, 414 flow. Second operand 6 states and 122 transitions.
[2024-06-03 22:38:38,527 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 89 transitions, 666 flow
[2024-06-03 22:38:38,531 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 89 transitions, 632 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-06-03 22:38:38,532 INFO  L231             Difference]: Finished difference. Result has 72 places, 72 transitions, 492 flow
[2024-06-03 22:38:38,532 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=492, PETRI_PLACES=72, PETRI_TRANSITIONS=72}
[2024-06-03 22:38:38,532 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places.
[2024-06-03 22:38:38,533 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 72 transitions, 492 flow
[2024-06-03 22:38:38,533 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:38:38,533 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:38:38,533 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:38:38,533 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-03 22:38:38,533 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:38:38,534 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:38:38,534 INFO  L85        PathProgramCache]: Analyzing trace with hash -854969110, now seen corresponding path program 1 times
[2024-06-03 22:38:38,534 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:38:38,534 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540200805]
[2024-06-03 22:38:38,534 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:38:38,534 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:38:38,571 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:38:48,837 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:38:48,837 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:38:48,837 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540200805]
[2024-06-03 22:38:48,837 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540200805] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:38:48,838 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:38:48,838 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:38:48,838 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362031970]
[2024-06-03 22:38:48,838 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:38:48,839 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:38:48,839 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:38:48,840 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:38:48,840 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:38:49,030 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 22:38:49,030 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 72 transitions, 492 flow. Second operand  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:38:49,030 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:38:49,030 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 22:38:49,030 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:38:49,946 INFO  L124   PetriNetUnfolderBase]: 1265/1960 cut-off events.
[2024-06-03 22:38:49,946 INFO  L125   PetriNetUnfolderBase]: For 8851/8893 co-relation queries the response was YES.
[2024-06-03 22:38:49,950 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7905 conditions, 1960 events. 1265/1960 cut-off events. For 8851/8893 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9679 event pairs, 504 based on Foata normal form. 2/1932 useless extension candidates. Maximal degree in co-relation 7870. Up to 1824 conditions per place. 
[2024-06-03 22:38:49,961 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 65 selfloop transitions, 15 changer transitions 0/93 dead transitions.
[2024-06-03 22:38:49,961 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 93 transitions, 712 flow
[2024-06-03 22:38:49,962 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:38:49,962 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:38:49,962 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions.
[2024-06-03 22:38:49,962 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46258503401360546
[2024-06-03 22:38:49,962 INFO  L175             Difference]: Start difference. First operand has 72 places, 72 transitions, 492 flow. Second operand 7 states and 136 transitions.
[2024-06-03 22:38:49,963 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 93 transitions, 712 flow
[2024-06-03 22:38:49,975 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 93 transitions, 668 flow, removed 14 selfloop flow, removed 3 redundant places.
[2024-06-03 22:38:49,976 INFO  L231             Difference]: Finished difference. Result has 76 places, 75 transitions, 506 flow
[2024-06-03 22:38:49,976 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=506, PETRI_PLACES=76, PETRI_TRANSITIONS=75}
[2024-06-03 22:38:49,977 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places.
[2024-06-03 22:38:49,977 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 75 transitions, 506 flow
[2024-06-03 22:38:49,977 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:38:49,977 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:38:49,977 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:38:49,977 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-03 22:38:49,977 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-03 22:38:49,978 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:38:49,978 INFO  L85        PathProgramCache]: Analyzing trace with hash -658749465, now seen corresponding path program 1 times
[2024-06-03 22:38:49,978 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:38:49,978 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670548114]
[2024-06-03 22:38:49,978 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:38:49,978 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:38:50,023 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:39:00,326 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:39:00,326 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:39:00,326 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670548114]
[2024-06-03 22:39:00,326 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670548114] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:39:00,326 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:39:00,326 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:39:00,327 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634003837]
[2024-06-03 22:39:00,327 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:39:00,327 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:39:00,327 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:39:00,327 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:39:00,327 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:39:00,441 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:39:00,442 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 506 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:39:00,442 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:39:00,442 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:39:00,442 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:39:01,489 INFO  L124   PetriNetUnfolderBase]: 1364/2086 cut-off events.
[2024-06-03 22:39:01,489 INFO  L125   PetriNetUnfolderBase]: For 9718/9718 co-relation queries the response was YES.
[2024-06-03 22:39:01,493 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8716 conditions, 2086 events. 1364/2086 cut-off events. For 9718/9718 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9993 event pairs, 518 based on Foata normal form. 4/2088 useless extension candidates. Maximal degree in co-relation 8680. Up to 1981 conditions per place. 
[2024-06-03 22:39:01,498 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 87 selfloop transitions, 15 changer transitions 0/107 dead transitions.
[2024-06-03 22:39:01,499 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 107 transitions, 833 flow
[2024-06-03 22:39:01,500 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:39:01,500 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:39:01,501 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions.
[2024-06-03 22:39:01,501 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45918367346938777
[2024-06-03 22:39:01,502 INFO  L175             Difference]: Start difference. First operand has 76 places, 75 transitions, 506 flow. Second operand 7 states and 135 transitions.
[2024-06-03 22:39:01,502 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 107 transitions, 833 flow
[2024-06-03 22:39:01,506 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 107 transitions, 799 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-06-03 22:39:01,507 INFO  L231             Difference]: Finished difference. Result has 80 places, 84 transitions, 592 flow
[2024-06-03 22:39:01,508 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=592, PETRI_PLACES=80, PETRI_TRANSITIONS=84}
[2024-06-03 22:39:01,510 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places.
[2024-06-03 22:39:01,512 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 84 transitions, 592 flow
[2024-06-03 22:39:01,513 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:39:01,513 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:39:01,513 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:39:01,513 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-03 22:39:01,513 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-03 22:39:01,514 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:39:01,514 INFO  L85        PathProgramCache]: Analyzing trace with hash -734247795, now seen corresponding path program 2 times
[2024-06-03 22:39:01,514 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:39:01,515 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341138355]
[2024-06-03 22:39:01,515 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:39:01,515 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:39:01,552 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:39:12,100 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:39:12,100 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:39:12,101 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341138355]
[2024-06-03 22:39:12,101 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341138355] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:39:12,101 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:39:12,101 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:39:12,101 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657837905]
[2024-06-03 22:39:12,101 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:39:12,101 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:39:12,101 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:39:12,102 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:39:12,102 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:39:12,263 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:39:12,264 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 84 transitions, 592 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:39:12,264 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:39:12,264 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:39:12,264 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:39:13,235 INFO  L124   PetriNetUnfolderBase]: 1402/2142 cut-off events.
[2024-06-03 22:39:13,235 INFO  L125   PetriNetUnfolderBase]: For 12377/12377 co-relation queries the response was YES.
[2024-06-03 22:39:13,240 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9512 conditions, 2142 events. 1402/2142 cut-off events. For 12377/12377 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10357 event pairs, 522 based on Foata normal form. 4/2141 useless extension candidates. Maximal degree in co-relation 9473. Up to 1953 conditions per place. 
[2024-06-03 22:39:13,247 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 85 selfloop transitions, 27 changer transitions 0/117 dead transitions.
[2024-06-03 22:39:13,247 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 117 transitions, 988 flow
[2024-06-03 22:39:13,249 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:39:13,250 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:39:13,250 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions.
[2024-06-03 22:39:13,250 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46938775510204084
[2024-06-03 22:39:13,250 INFO  L175             Difference]: Start difference. First operand has 80 places, 84 transitions, 592 flow. Second operand 7 states and 138 transitions.
[2024-06-03 22:39:13,250 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 117 transitions, 988 flow
[2024-06-03 22:39:13,257 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 117 transitions, 961 flow, removed 10 selfloop flow, removed 2 redundant places.
[2024-06-03 22:39:13,258 INFO  L231             Difference]: Finished difference. Result has 86 places, 93 transitions, 713 flow
[2024-06-03 22:39:13,259 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=713, PETRI_PLACES=86, PETRI_TRANSITIONS=93}
[2024-06-03 22:39:13,259 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places.
[2024-06-03 22:39:13,259 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 93 transitions, 713 flow
[2024-06-03 22:39:13,260 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:39:13,260 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:39:13,260 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:39:13,260 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-03 22:39:13,260 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-03 22:39:13,260 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:39:13,260 INFO  L85        PathProgramCache]: Analyzing trace with hash -734514705, now seen corresponding path program 3 times
[2024-06-03 22:39:13,261 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:39:13,261 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794563257]
[2024-06-03 22:39:13,261 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:39:13,261 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:39:13,306 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:39:22,970 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:39:22,970 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:39:22,970 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794563257]
[2024-06-03 22:39:22,971 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794563257] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:39:22,971 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:39:22,971 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:39:22,971 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837603943]
[2024-06-03 22:39:22,971 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:39:22,971 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:39:22,972 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:39:22,972 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:39:22,972 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:39:23,138 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:39:23,138 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 93 transitions, 713 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:39:23,138 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:39:23,138 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:39:23,139 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:39:24,100 INFO  L124   PetriNetUnfolderBase]: 1392/2133 cut-off events.
[2024-06-03 22:39:24,100 INFO  L125   PetriNetUnfolderBase]: For 15028/15028 co-relation queries the response was YES.
[2024-06-03 22:39:24,105 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10053 conditions, 2133 events. 1392/2133 cut-off events. For 15028/15028 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10382 event pairs, 527 based on Foata normal form. 4/2133 useless extension candidates. Maximal degree in co-relation 10011. Up to 1945 conditions per place. 
[2024-06-03 22:39:24,112 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 84 selfloop transitions, 26 changer transitions 0/115 dead transitions.
[2024-06-03 22:39:24,113 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 115 transitions, 995 flow
[2024-06-03 22:39:24,115 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:39:24,115 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:39:24,115 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions.
[2024-06-03 22:39:24,115 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46598639455782315
[2024-06-03 22:39:24,115 INFO  L175             Difference]: Start difference. First operand has 86 places, 93 transitions, 713 flow. Second operand 7 states and 137 transitions.
[2024-06-03 22:39:24,116 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 115 transitions, 995 flow
[2024-06-03 22:39:24,154 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 115 transitions, 955 flow, removed 16 selfloop flow, removed 2 redundant places.
[2024-06-03 22:39:24,155 INFO  L231             Difference]: Finished difference. Result has 91 places, 93 transitions, 733 flow
[2024-06-03 22:39:24,156 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=733, PETRI_PLACES=91, PETRI_TRANSITIONS=93}
[2024-06-03 22:39:24,156 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 48 predicate places.
[2024-06-03 22:39:24,156 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 93 transitions, 733 flow
[2024-06-03 22:39:24,156 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:39:24,156 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:39:24,156 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:39:24,157 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-03 22:39:24,157 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-03 22:39:24,157 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:39:24,157 INFO  L85        PathProgramCache]: Analyzing trace with hash -733048583, now seen corresponding path program 1 times
[2024-06-03 22:39:24,157 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:39:24,157 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271947731]
[2024-06-03 22:39:24,157 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:39:24,157 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:39:24,197 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:39:34,660 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:39:34,660 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:39:34,660 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271947731]
[2024-06-03 22:39:34,660 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271947731] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:39:34,660 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:39:34,660 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:39:34,661 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952222054]
[2024-06-03 22:39:34,661 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:39:34,661 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:39:34,661 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:39:34,662 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:39:34,662 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:39:34,967 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 22:39:34,968 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 93 transitions, 733 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:39:34,968 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:39:34,968 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 22:39:34,968 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:39:35,905 INFO  L124   PetriNetUnfolderBase]: 1298/2035 cut-off events.
[2024-06-03 22:39:35,905 INFO  L125   PetriNetUnfolderBase]: For 16832/16832 co-relation queries the response was YES.
[2024-06-03 22:39:35,910 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9737 conditions, 2035 events. 1298/2035 cut-off events. For 16832/16832 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 10077 event pairs, 476 based on Foata normal form. 4/2023 useless extension candidates. Maximal degree in co-relation 9693. Up to 1850 conditions per place. 
[2024-06-03 22:39:35,917 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 88 selfloop transitions, 17 changer transitions 0/118 dead transitions.
[2024-06-03 22:39:35,917 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 118 transitions, 1017 flow
[2024-06-03 22:39:35,919 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:39:35,919 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:39:35,919 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions.
[2024-06-03 22:39:35,919 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4583333333333333
[2024-06-03 22:39:35,920 INFO  L175             Difference]: Start difference. First operand has 91 places, 93 transitions, 733 flow. Second operand 8 states and 154 transitions.
[2024-06-03 22:39:35,920 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 118 transitions, 1017 flow
[2024-06-03 22:39:35,929 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 118 transitions, 932 flow, removed 7 selfloop flow, removed 7 redundant places.
[2024-06-03 22:39:35,930 INFO  L231             Difference]: Finished difference. Result has 92 places, 95 transitions, 709 flow
[2024-06-03 22:39:35,930 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=709, PETRI_PLACES=92, PETRI_TRANSITIONS=95}
[2024-06-03 22:39:35,931 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 49 predicate places.
[2024-06-03 22:39:35,931 INFO  L495      AbstractCegarLoop]: Abstraction has has 92 places, 95 transitions, 709 flow
[2024-06-03 22:39:35,931 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:39:35,931 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:39:35,931 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:39:35,932 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-03 22:39:35,932 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-03 22:39:35,932 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:39:35,932 INFO  L85        PathProgramCache]: Analyzing trace with hash 920658813, now seen corresponding path program 1 times
[2024-06-03 22:39:35,932 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:39:35,932 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411462730]
[2024-06-03 22:39:35,932 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:39:35,933 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:39:36,016 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:39:45,043 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:39:45,043 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:39:45,043 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411462730]
[2024-06-03 22:39:45,044 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411462730] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:39:45,044 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:39:45,044 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:39:45,044 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781424534]
[2024-06-03 22:39:45,044 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:39:45,044 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:39:45,045 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:39:45,045 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:39:45,045 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:39:45,274 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 22:39:45,274 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 95 transitions, 709 flow. Second operand  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:39:45,274 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:39:45,274 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 22:39:45,274 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:39:46,322 INFO  L124   PetriNetUnfolderBase]: 1332/2061 cut-off events.
[2024-06-03 22:39:46,323 INFO  L125   PetriNetUnfolderBase]: For 19790/19830 co-relation queries the response was YES.
[2024-06-03 22:39:46,327 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10098 conditions, 2061 events. 1332/2061 cut-off events. For 19790/19830 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10136 event pairs, 466 based on Foata normal form. 21/2033 useless extension candidates. Maximal degree in co-relation 10055. Up to 1897 conditions per place. 
[2024-06-03 22:39:46,333 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 86 selfloop transitions, 19 changer transitions 0/122 dead transitions.
[2024-06-03 22:39:46,333 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 122 transitions, 1015 flow
[2024-06-03 22:39:46,335 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:39:46,335 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:39:46,335 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions.
[2024-06-03 22:39:46,336 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48299319727891155
[2024-06-03 22:39:46,336 INFO  L175             Difference]: Start difference. First operand has 92 places, 95 transitions, 709 flow. Second operand 7 states and 142 transitions.
[2024-06-03 22:39:46,336 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 122 transitions, 1015 flow
[2024-06-03 22:39:46,344 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 122 transitions, 972 flow, removed 6 selfloop flow, removed 6 redundant places.
[2024-06-03 22:39:46,345 INFO  L231             Difference]: Finished difference. Result has 93 places, 98 transitions, 748 flow
[2024-06-03 22:39:46,345 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=748, PETRI_PLACES=93, PETRI_TRANSITIONS=98}
[2024-06-03 22:39:46,346 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places.
[2024-06-03 22:39:46,346 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 98 transitions, 748 flow
[2024-06-03 22:39:46,346 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:39:46,346 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:39:46,346 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:39:46,346 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-03 22:39:46,347 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-03 22:39:46,347 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:39:46,347 INFO  L85        PathProgramCache]: Analyzing trace with hash -1486151745, now seen corresponding path program 1 times
[2024-06-03 22:39:46,347 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:39:46,347 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363315530]
[2024-06-03 22:39:46,347 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:39:46,347 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:39:46,396 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:39:59,808 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:39:59,809 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:39:59,809 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363315530]
[2024-06-03 22:39:59,809 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363315530] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:39:59,809 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:39:59,809 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:39:59,809 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494201704]
[2024-06-03 22:39:59,809 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:39:59,810 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:39:59,810 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:39:59,810 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:39:59,810 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:39:59,931 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:39:59,931 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 98 transitions, 748 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:39:59,932 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:39:59,932 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:39:59,932 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:40:01,097 INFO  L124   PetriNetUnfolderBase]: 1398/2141 cut-off events.
[2024-06-03 22:40:01,097 INFO  L125   PetriNetUnfolderBase]: For 21092/21092 co-relation queries the response was YES.
[2024-06-03 22:40:01,103 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10666 conditions, 2141 events. 1398/2141 cut-off events. For 21092/21092 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10301 event pairs, 484 based on Foata normal form. 4/2143 useless extension candidates. Maximal degree in co-relation 10622. Up to 2013 conditions per place. 
[2024-06-03 22:40:01,108 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 105 selfloop transitions, 19 changer transitions 0/129 dead transitions.
[2024-06-03 22:40:01,108 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 129 transitions, 1100 flow
[2024-06-03 22:40:01,110 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:40:01,110 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:40:01,124 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-03 22:40:01,125 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45535714285714285
[2024-06-03 22:40:01,125 INFO  L175             Difference]: Start difference. First operand has 93 places, 98 transitions, 748 flow. Second operand 8 states and 153 transitions.
[2024-06-03 22:40:01,125 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 129 transitions, 1100 flow
[2024-06-03 22:40:01,139 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 129 transitions, 1044 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-06-03 22:40:01,157 INFO  L231             Difference]: Finished difference. Result has 96 places, 102 transitions, 777 flow
[2024-06-03 22:40:01,158 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=777, PETRI_PLACES=96, PETRI_TRANSITIONS=102}
[2024-06-03 22:40:01,159 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 53 predicate places.
[2024-06-03 22:40:01,159 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 102 transitions, 777 flow
[2024-06-03 22:40:01,159 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:40:01,159 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:40:01,159 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:40:01,159 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-03 22:40:01,160 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-03 22:40:01,160 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:40:01,160 INFO  L85        PathProgramCache]: Analyzing trace with hash -1258250595, now seen corresponding path program 2 times
[2024-06-03 22:40:01,160 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:40:01,160 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54668864]
[2024-06-03 22:40:01,160 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:40:01,160 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:40:01,278 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:40:14,666 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:40:14,666 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:40:14,667 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54668864]
[2024-06-03 22:40:14,667 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54668864] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:40:14,669 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:40:14,670 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:40:14,670 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353725790]
[2024-06-03 22:40:14,670 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:40:14,671 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:40:14,671 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:40:14,671 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:40:14,671 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:40:14,802 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:40:14,802 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 102 transitions, 777 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:40:14,802 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:40:14,802 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:40:14,802 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:40:15,880 INFO  L124   PetriNetUnfolderBase]: 1420/2174 cut-off events.
[2024-06-03 22:40:15,880 INFO  L125   PetriNetUnfolderBase]: For 24489/24489 co-relation queries the response was YES.
[2024-06-03 22:40:15,885 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11391 conditions, 2174 events. 1420/2174 cut-off events. For 24489/24489 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10561 event pairs, 488 based on Foata normal form. 4/2174 useless extension candidates. Maximal degree in co-relation 11346. Up to 1968 conditions per place. 
[2024-06-03 22:40:15,891 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 97 selfloop transitions, 30 changer transitions 0/132 dead transitions.
[2024-06-03 22:40:15,892 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 132 transitions, 1147 flow
[2024-06-03 22:40:15,894 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:40:15,894 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:40:15,894 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-03 22:40:15,895 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46130952380952384
[2024-06-03 22:40:15,895 INFO  L175             Difference]: Start difference. First operand has 96 places, 102 transitions, 777 flow. Second operand 8 states and 155 transitions.
[2024-06-03 22:40:15,895 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 132 transitions, 1147 flow
[2024-06-03 22:40:15,906 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 132 transitions, 1092 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-06-03 22:40:15,907 INFO  L231             Difference]: Finished difference. Result has 98 places, 106 transitions, 837 flow
[2024-06-03 22:40:15,908 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=837, PETRI_PLACES=98, PETRI_TRANSITIONS=106}
[2024-06-03 22:40:15,908 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 55 predicate places.
[2024-06-03 22:40:15,908 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 106 transitions, 837 flow
[2024-06-03 22:40:15,908 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:40:15,908 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:40:15,909 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:40:15,909 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-03 22:40:15,909 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:40:15,909 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:40:15,909 INFO  L85        PathProgramCache]: Analyzing trace with hash -1249976385, now seen corresponding path program 3 times
[2024-06-03 22:40:15,909 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:40:15,910 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947714234]
[2024-06-03 22:40:15,910 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:40:15,910 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:40:15,965 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:40:29,412 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:40:29,412 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:40:29,412 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947714234]
[2024-06-03 22:40:29,412 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947714234] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:40:29,412 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:40:29,413 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:40:29,413 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144565735]
[2024-06-03 22:40:29,413 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:40:29,414 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:40:29,415 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:40:29,415 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:40:29,415 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:40:29,606 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:40:29,606 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 106 transitions, 837 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:40:29,606 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:40:29,606 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:40:29,606 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:40:30,623 INFO  L124   PetriNetUnfolderBase]: 1442/2206 cut-off events.
[2024-06-03 22:40:30,624 INFO  L125   PetriNetUnfolderBase]: For 28340/28340 co-relation queries the response was YES.
[2024-06-03 22:40:30,629 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12181 conditions, 2206 events. 1442/2206 cut-off events. For 28340/28340 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10652 event pairs, 483 based on Foata normal form. 4/2206 useless extension candidates. Maximal degree in co-relation 12135. Up to 2000 conditions per place. 
[2024-06-03 22:40:30,637 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 100 selfloop transitions, 31 changer transitions 0/136 dead transitions.
[2024-06-03 22:40:30,637 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 136 transitions, 1229 flow
[2024-06-03 22:40:30,639 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:40:30,639 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:40:30,640 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions.
[2024-06-03 22:40:30,640 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4583333333333333
[2024-06-03 22:40:30,640 INFO  L175             Difference]: Start difference. First operand has 98 places, 106 transitions, 837 flow. Second operand 8 states and 154 transitions.
[2024-06-03 22:40:30,640 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 136 transitions, 1229 flow
[2024-06-03 22:40:30,652 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 136 transitions, 1144 flow, removed 15 selfloop flow, removed 6 redundant places.
[2024-06-03 22:40:30,654 INFO  L231             Difference]: Finished difference. Result has 100 places, 110 transitions, 877 flow
[2024-06-03 22:40:30,654 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=877, PETRI_PLACES=100, PETRI_TRANSITIONS=110}
[2024-06-03 22:40:30,655 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places.
[2024-06-03 22:40:30,655 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 110 transitions, 877 flow
[2024-06-03 22:40:30,655 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:40:30,655 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:40:30,655 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:40:30,655 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-03 22:40:30,656 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:40:30,656 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:40:30,656 INFO  L85        PathProgramCache]: Analyzing trace with hash -1249679715, now seen corresponding path program 4 times
[2024-06-03 22:40:30,656 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:40:30,656 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410141953]
[2024-06-03 22:40:30,656 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:40:30,657 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:40:30,705 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:40:41,060 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:40:41,060 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:40:41,060 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410141953]
[2024-06-03 22:40:41,060 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410141953] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:40:41,061 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:40:41,061 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:40:41,061 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077153398]
[2024-06-03 22:40:41,061 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:40:41,061 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:40:41,061 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:40:41,061 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:40:41,062 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:40:41,248 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:40:41,248 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 110 transitions, 877 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:40:41,248 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:40:41,248 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:40:41,248 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:40:42,327 INFO  L124   PetriNetUnfolderBase]: 1437/2204 cut-off events.
[2024-06-03 22:40:42,328 INFO  L125   PetriNetUnfolderBase]: For 32007/32007 co-relation queries the response was YES.
[2024-06-03 22:40:42,333 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12661 conditions, 2204 events. 1437/2204 cut-off events. For 32007/32007 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10709 event pairs, 483 based on Foata normal form. 2/2202 useless extension candidates. Maximal degree in co-relation 12614. Up to 2021 conditions per place. 
[2024-06-03 22:40:42,341 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 111 selfloop transitions, 38 changer transitions 0/154 dead transitions.
[2024-06-03 22:40:42,341 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 154 transitions, 1424 flow
[2024-06-03 22:40:42,343 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:40:42,344 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:40:42,344 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions.
[2024-06-03 22:40:42,344 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4494047619047619
[2024-06-03 22:40:42,345 INFO  L175             Difference]: Start difference. First operand has 100 places, 110 transitions, 877 flow. Second operand 8 states and 151 transitions.
[2024-06-03 22:40:42,345 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 154 transitions, 1424 flow
[2024-06-03 22:40:42,364 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 154 transitions, 1292 flow, removed 27 selfloop flow, removed 6 redundant places.
[2024-06-03 22:40:42,366 INFO  L231             Difference]: Finished difference. Result has 105 places, 131 transitions, 1093 flow
[2024-06-03 22:40:42,366 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1093, PETRI_PLACES=105, PETRI_TRANSITIONS=131}
[2024-06-03 22:40:42,367 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 62 predicate places.
[2024-06-03 22:40:42,367 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 131 transitions, 1093 flow
[2024-06-03 22:40:42,367 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:40:42,368 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:40:42,368 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:40:42,368 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-03 22:40:42,368 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:40:42,368 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:40:42,369 INFO  L85        PathProgramCache]: Analyzing trace with hash -21877288, now seen corresponding path program 1 times
[2024-06-03 22:40:42,369 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:40:42,369 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197187161]
[2024-06-03 22:40:42,369 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:40:42,369 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:40:42,436 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:40:52,885 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:40:52,885 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:40:52,886 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197187161]
[2024-06-03 22:40:52,886 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197187161] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:40:52,886 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:40:52,886 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:40:52,886 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215498031]
[2024-06-03 22:40:52,886 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:40:52,888 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:40:52,889 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:40:52,889 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:40:52,890 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:40:53,009 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:40:53,009 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 131 transitions, 1093 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:40:53,010 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:40:53,010 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:40:53,010 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:40:54,131 INFO  L124   PetriNetUnfolderBase]: 1432/2201 cut-off events.
[2024-06-03 22:40:54,131 INFO  L125   PetriNetUnfolderBase]: For 34305/34305 co-relation queries the response was YES.
[2024-06-03 22:40:54,137 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13104 conditions, 2201 events. 1432/2201 cut-off events. For 34305/34305 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10638 event pairs, 453 based on Foata normal form. 2/2201 useless extension candidates. Maximal degree in co-relation 13053. Up to 2089 conditions per place. 
[2024-06-03 22:40:54,144 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 145 selfloop transitions, 18 changer transitions 0/168 dead transitions.
[2024-06-03 22:40:54,144 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 168 transitions, 1593 flow
[2024-06-03 22:40:54,146 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:40:54,146 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:40:54,147 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-03 22:40:54,147 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45535714285714285
[2024-06-03 22:40:54,147 INFO  L175             Difference]: Start difference. First operand has 105 places, 131 transitions, 1093 flow. Second operand 8 states and 153 transitions.
[2024-06-03 22:40:54,147 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 168 transitions, 1593 flow
[2024-06-03 22:40:54,163 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 168 transitions, 1541 flow, removed 22 selfloop flow, removed 2 redundant places.
[2024-06-03 22:40:54,165 INFO  L231             Difference]: Finished difference. Result has 113 places, 140 transitions, 1205 flow
[2024-06-03 22:40:54,166 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1205, PETRI_PLACES=113, PETRI_TRANSITIONS=140}
[2024-06-03 22:40:54,166 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 70 predicate places.
[2024-06-03 22:40:54,166 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 140 transitions, 1205 flow
[2024-06-03 22:40:54,166 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:40:54,166 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:40:54,166 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:40:54,167 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-03 22:40:54,167 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:40:54,167 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:40:54,167 INFO  L85        PathProgramCache]: Analyzing trace with hash -1376522246, now seen corresponding path program 1 times
[2024-06-03 22:40:54,167 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:40:54,168 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714198704]
[2024-06-03 22:40:54,168 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:40:54,168 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:40:54,204 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:41:04,728 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:41:04,728 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:41:04,728 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714198704]
[2024-06-03 22:41:04,729 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714198704] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:41:04,729 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:41:04,729 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:41:04,729 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204467760]
[2024-06-03 22:41:04,729 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:41:04,730 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:41:04,732 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:41:04,733 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:41:04,733 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:41:04,914 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:41:04,915 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 140 transitions, 1205 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:41:04,915 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:41:04,915 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:41:04,915 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:41:06,077 INFO  L124   PetriNetUnfolderBase]: 1449/2233 cut-off events.
[2024-06-03 22:41:06,077 INFO  L125   PetriNetUnfolderBase]: For 38778/38778 co-relation queries the response was YES.
[2024-06-03 22:41:06,083 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13629 conditions, 2233 events. 1449/2233 cut-off events. For 38778/38778 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10849 event pairs, 449 based on Foata normal form. 4/2235 useless extension candidates. Maximal degree in co-relation 13574. Up to 2104 conditions per place. 
[2024-06-03 22:41:06,090 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 149 selfloop transitions, 20 changer transitions 0/174 dead transitions.
[2024-06-03 22:41:06,091 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 174 transitions, 1661 flow
[2024-06-03 22:41:06,093 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:41:06,093 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:41:06,093 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions.
[2024-06-03 22:41:06,094 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4417989417989418
[2024-06-03 22:41:06,094 INFO  L175             Difference]: Start difference. First operand has 113 places, 140 transitions, 1205 flow. Second operand 9 states and 167 transitions.
[2024-06-03 22:41:06,094 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 174 transitions, 1661 flow
[2024-06-03 22:41:06,116 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 174 transitions, 1581 flow, removed 34 selfloop flow, removed 3 redundant places.
[2024-06-03 22:41:06,118 INFO  L231             Difference]: Finished difference. Result has 121 places, 144 transitions, 1228 flow
[2024-06-03 22:41:06,118 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1228, PETRI_PLACES=121, PETRI_TRANSITIONS=144}
[2024-06-03 22:41:06,119 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 78 predicate places.
[2024-06-03 22:41:06,119 INFO  L495      AbstractCegarLoop]: Abstraction has has 121 places, 144 transitions, 1228 flow
[2024-06-03 22:41:06,119 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:41:06,119 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:41:06,119 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:41:06,119 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-03 22:41:06,120 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:41:06,120 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:41:06,120 INFO  L85        PathProgramCache]: Analyzing trace with hash -1493971634, now seen corresponding path program 2 times
[2024-06-03 22:41:06,120 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:41:06,120 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096856447]
[2024-06-03 22:41:06,120 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:41:06,121 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:41:06,159 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:41:18,236 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:41:18,236 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:41:18,237 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096856447]
[2024-06-03 22:41:18,237 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096856447] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:41:18,237 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:41:18,237 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:41:18,237 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540168762]
[2024-06-03 22:41:18,237 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:41:18,238 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:41:18,238 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:41:18,238 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:41:18,239 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:41:18,443 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:41:18,444 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 144 transitions, 1228 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:41:18,444 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:41:18,444 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:41:18,444 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:41:19,586 INFO  L124   PetriNetUnfolderBase]: 1541/2376 cut-off events.
[2024-06-03 22:41:19,586 INFO  L125   PetriNetUnfolderBase]: For 47940/47940 co-relation queries the response was YES.
[2024-06-03 22:41:19,594 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14756 conditions, 2376 events. 1541/2376 cut-off events. For 47940/47940 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11757 event pairs, 467 based on Foata normal form. 24/2396 useless extension candidates. Maximal degree in co-relation 14697. Up to 2027 conditions per place. 
[2024-06-03 22:41:19,605 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 131 selfloop transitions, 43 changer transitions 0/179 dead transitions.
[2024-06-03 22:41:19,605 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 179 transitions, 1735 flow
[2024-06-03 22:41:19,607 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:41:19,607 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:41:19,607 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-03 22:41:19,609 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4656084656084656
[2024-06-03 22:41:19,609 INFO  L175             Difference]: Start difference. First operand has 121 places, 144 transitions, 1228 flow. Second operand 9 states and 176 transitions.
[2024-06-03 22:41:19,609 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 179 transitions, 1735 flow
[2024-06-03 22:41:19,633 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 179 transitions, 1682 flow, removed 14 selfloop flow, removed 4 redundant places.
[2024-06-03 22:41:19,639 INFO  L231             Difference]: Finished difference. Result has 126 places, 146 transitions, 1309 flow
[2024-06-03 22:41:19,640 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1175, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1309, PETRI_PLACES=126, PETRI_TRANSITIONS=146}
[2024-06-03 22:41:19,640 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 83 predicate places.
[2024-06-03 22:41:19,641 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 146 transitions, 1309 flow
[2024-06-03 22:41:19,641 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:41:19,641 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:41:19,641 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:41:19,641 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-03 22:41:19,641 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:41:19,642 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:41:19,642 INFO  L85        PathProgramCache]: Analyzing trace with hash -1228274354, now seen corresponding path program 3 times
[2024-06-03 22:41:19,642 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:41:19,642 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560549641]
[2024-06-03 22:41:19,642 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:41:19,642 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:41:19,686 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:41:30,650 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:41:30,650 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:41:30,650 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560549641]
[2024-06-03 22:41:30,650 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560549641] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:41:30,650 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:41:30,650 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:41:30,650 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108882618]
[2024-06-03 22:41:30,650 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:41:30,651 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:41:30,651 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:41:30,651 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:41:30,651 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:41:30,828 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:41:30,828 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 146 transitions, 1309 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:41:30,828 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:41:30,828 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:41:30,828 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:41:31,980 INFO  L124   PetriNetUnfolderBase]: 1558/2403 cut-off events.
[2024-06-03 22:41:31,980 INFO  L125   PetriNetUnfolderBase]: For 48984/48984 co-relation queries the response was YES.
[2024-06-03 22:41:31,988 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15319 conditions, 2403 events. 1558/2403 cut-off events. For 48984/48984 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11948 event pairs, 467 based on Foata normal form. 4/2402 useless extension candidates. Maximal degree in co-relation 15259. Up to 2120 conditions per place. 
[2024-06-03 22:41:31,996 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 109 selfloop transitions, 62 changer transitions 0/176 dead transitions.
[2024-06-03 22:41:31,997 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 176 transitions, 1761 flow
[2024-06-03 22:41:31,999 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:41:31,999 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:41:31,999 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-03 22:41:31,999 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-03 22:41:31,999 INFO  L175             Difference]: Start difference. First operand has 126 places, 146 transitions, 1309 flow. Second operand 9 states and 171 transitions.
[2024-06-03 22:41:31,999 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 176 transitions, 1761 flow
[2024-06-03 22:41:32,033 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 176 transitions, 1669 flow, removed 6 selfloop flow, removed 7 redundant places.
[2024-06-03 22:41:32,035 INFO  L231             Difference]: Finished difference. Result has 128 places, 148 transitions, 1390 flow
[2024-06-03 22:41:32,035 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1217, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1390, PETRI_PLACES=128, PETRI_TRANSITIONS=148}
[2024-06-03 22:41:32,036 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 85 predicate places.
[2024-06-03 22:41:32,036 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 148 transitions, 1390 flow
[2024-06-03 22:41:32,036 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:41:32,036 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:41:32,036 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:41:32,036 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-03 22:41:32,037 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:41:32,037 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:41:32,037 INFO  L85        PathProgramCache]: Analyzing trace with hash -1237471124, now seen corresponding path program 4 times
[2024-06-03 22:41:32,037 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:41:32,037 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512822088]
[2024-06-03 22:41:32,037 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:41:32,037 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:41:32,075 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:41:43,839 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:41:43,840 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:41:43,840 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512822088]
[2024-06-03 22:41:43,840 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512822088] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:41:43,840 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:41:43,840 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:41:43,840 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032634893]
[2024-06-03 22:41:43,840 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:41:43,841 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:41:43,841 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:41:43,841 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:41:43,841 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:41:43,997 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:41:43,997 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 148 transitions, 1390 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:41:43,997 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:41:43,997 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:41:43,997 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:41:45,255 INFO  L124   PetriNetUnfolderBase]: 1650/2565 cut-off events.
[2024-06-03 22:41:45,255 INFO  L125   PetriNetUnfolderBase]: For 59513/59513 co-relation queries the response was YES.
[2024-06-03 22:41:45,263 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16501 conditions, 2565 events. 1650/2565 cut-off events. For 59513/59513 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 13007 event pairs, 482 based on Foata normal form. 24/2584 useless extension candidates. Maximal degree in co-relation 16440. Up to 2206 conditions per place. 
[2024-06-03 22:41:45,273 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 133 selfloop transitions, 45 changer transitions 0/183 dead transitions.
[2024-06-03 22:41:45,274 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 183 transitions, 1913 flow
[2024-06-03 22:41:45,276 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:41:45,276 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:41:45,277 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions.
[2024-06-03 22:41:45,277 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46296296296296297
[2024-06-03 22:41:45,277 INFO  L175             Difference]: Start difference. First operand has 128 places, 148 transitions, 1390 flow. Second operand 9 states and 175 transitions.
[2024-06-03 22:41:45,277 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 183 transitions, 1913 flow
[2024-06-03 22:41:45,304 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 183 transitions, 1758 flow, removed 17 selfloop flow, removed 7 redundant places.
[2024-06-03 22:41:45,306 INFO  L231             Difference]: Finished difference. Result has 130 places, 150 transitions, 1381 flow
[2024-06-03 22:41:45,306 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1235, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1381, PETRI_PLACES=130, PETRI_TRANSITIONS=150}
[2024-06-03 22:41:45,307 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 87 predicate places.
[2024-06-03 22:41:45,307 INFO  L495      AbstractCegarLoop]: Abstraction has has 130 places, 150 transitions, 1381 flow
[2024-06-03 22:41:45,307 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:41:45,307 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:41:45,307 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:41:45,307 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-03 22:41:45,307 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-03 22:41:45,308 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:41:45,308 INFO  L85        PathProgramCache]: Analyzing trace with hash -1227947924, now seen corresponding path program 5 times
[2024-06-03 22:41:45,308 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:41:45,308 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93243530]
[2024-06-03 22:41:45,308 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:41:45,308 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:41:45,364 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:41:56,316 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:41:56,316 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:41:56,316 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93243530]
[2024-06-03 22:41:56,317 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93243530] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:41:56,317 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:41:56,317 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:41:56,317 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855443397]
[2024-06-03 22:41:56,317 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:41:56,317 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:41:56,317 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:41:56,317 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:41:56,318 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:41:56,579 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:41:56,579 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 150 transitions, 1381 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:41:56,580 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:41:56,580 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:41:56,580 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:41:57,929 INFO  L124   PetriNetUnfolderBase]: 1810/2837 cut-off events.
[2024-06-03 22:41:57,929 INFO  L125   PetriNetUnfolderBase]: For 64888/64888 co-relation queries the response was YES.
[2024-06-03 22:41:57,939 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18342 conditions, 2837 events. 1810/2837 cut-off events. For 64888/64888 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 14944 event pairs, 501 based on Foata normal form. 4/2836 useless extension candidates. Maximal degree in co-relation 18280. Up to 2137 conditions per place. 
[2024-06-03 22:41:57,949 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 112 selfloop transitions, 72 changer transitions 0/189 dead transitions.
[2024-06-03 22:41:57,949 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 189 transitions, 2070 flow
[2024-06-03 22:41:57,951 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:41:57,951 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:41:57,951 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions.
[2024-06-03 22:41:57,952 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46825396825396826
[2024-06-03 22:41:57,952 INFO  L175             Difference]: Start difference. First operand has 130 places, 150 transitions, 1381 flow. Second operand 9 states and 177 transitions.
[2024-06-03 22:41:57,952 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 189 transitions, 2070 flow
[2024-06-03 22:41:57,992 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 189 transitions, 1955 flow, removed 15 selfloop flow, removed 7 redundant places.
[2024-06-03 22:41:57,995 INFO  L231             Difference]: Finished difference. Result has 133 places, 155 transitions, 1562 flow
[2024-06-03 22:41:57,995 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1277, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1562, PETRI_PLACES=133, PETRI_TRANSITIONS=155}
[2024-06-03 22:41:57,995 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 90 predicate places.
[2024-06-03 22:41:57,995 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 155 transitions, 1562 flow
[2024-06-03 22:41:57,996 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:41:57,996 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:41:57,996 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:41:57,996 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-03 22:41:57,996 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-03 22:41:57,996 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:41:57,996 INFO  L85        PathProgramCache]: Analyzing trace with hash 609593884, now seen corresponding path program 1 times
[2024-06-03 22:41:57,997 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:41:57,997 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160921873]
[2024-06-03 22:41:57,997 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:41:57,997 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:41:58,052 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:42:09,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-03 22:42:09,048 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:42:09,049 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160921873]
[2024-06-03 22:42:09,049 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160921873] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:42:09,049 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:42:09,049 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:42:09,049 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387949946]
[2024-06-03 22:42:09,049 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:42:09,049 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:42:09,050 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:42:09,050 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:42:09,050 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:42:09,206 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 22:42:09,206 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 155 transitions, 1562 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:42:09,206 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:42:09,206 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 22:42:09,206 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:42:10,539 INFO  L124   PetriNetUnfolderBase]: 1742/2778 cut-off events.
[2024-06-03 22:42:10,539 INFO  L125   PetriNetUnfolderBase]: For 69505/69567 co-relation queries the response was YES.
[2024-06-03 22:42:10,549 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18213 conditions, 2778 events. 1742/2778 cut-off events. For 69505/69567 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 14959 event pairs, 359 based on Foata normal form. 10/2752 useless extension candidates. Maximal degree in co-relation 18149. Up to 2469 conditions per place. 
[2024-06-03 22:42:10,558 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 125 selfloop transitions, 22 changer transitions 0/187 dead transitions.
[2024-06-03 22:42:10,558 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 187 transitions, 1958 flow
[2024-06-03 22:42:10,560 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:42:10,560 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:42:10,560 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions.
[2024-06-03 22:42:10,561 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-03 22:42:10,561 INFO  L175             Difference]: Start difference. First operand has 133 places, 155 transitions, 1562 flow. Second operand 8 states and 160 transitions.
[2024-06-03 22:42:10,561 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 187 transitions, 1958 flow
[2024-06-03 22:42:10,600 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 187 transitions, 1840 flow, removed 22 selfloop flow, removed 5 redundant places.
[2024-06-03 22:42:10,603 INFO  L231             Difference]: Finished difference. Result has 136 places, 157 transitions, 1521 flow
[2024-06-03 22:42:10,603 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1444, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1521, PETRI_PLACES=136, PETRI_TRANSITIONS=157}
[2024-06-03 22:42:10,604 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 93 predicate places.
[2024-06-03 22:42:10,604 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 157 transitions, 1521 flow
[2024-06-03 22:42:10,604 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:42:10,604 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:42:10,605 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:42:10,605 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-03 22:42:10,605 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-03 22:42:10,606 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:42:10,606 INFO  L85        PathProgramCache]: Analyzing trace with hash 176291554, now seen corresponding path program 2 times
[2024-06-03 22:42:10,606 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:42:10,607 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706492104]
[2024-06-03 22:42:10,607 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:42:10,607 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:42:10,667 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:42:20,884 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:42:20,884 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:42:20,884 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706492104]
[2024-06-03 22:42:20,884 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706492104] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:42:20,885 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:42:20,885 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:42:20,885 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078649678]
[2024-06-03 22:42:20,885 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:42:20,886 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:42:20,886 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:42:20,887 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:42:20,887 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:42:21,049 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 22:42:21,050 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 157 transitions, 1521 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:42:21,050 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:42:21,050 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 22:42:21,050 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:42:22,483 INFO  L124   PetriNetUnfolderBase]: 1759/2807 cut-off events.
[2024-06-03 22:42:22,483 INFO  L125   PetriNetUnfolderBase]: For 73629/73680 co-relation queries the response was YES.
[2024-06-03 22:42:22,494 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18587 conditions, 2807 events. 1759/2807 cut-off events. For 73629/73680 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 15146 event pairs, 466 based on Foata normal form. 8/2777 useless extension candidates. Maximal degree in co-relation 18521. Up to 2520 conditions per place. 
[2024-06-03 22:42:22,504 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 123 selfloop transitions, 25 changer transitions 0/188 dead transitions.
[2024-06-03 22:42:22,505 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 188 transitions, 1921 flow
[2024-06-03 22:42:22,505 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:42:22,505 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:42:22,506 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions.
[2024-06-03 22:42:22,507 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-03 22:42:22,507 INFO  L175             Difference]: Start difference. First operand has 136 places, 157 transitions, 1521 flow. Second operand 8 states and 160 transitions.
[2024-06-03 22:42:22,507 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 188 transitions, 1921 flow
[2024-06-03 22:42:22,553 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 188 transitions, 1862 flow, removed 9 selfloop flow, removed 6 redundant places.
[2024-06-03 22:42:22,555 INFO  L231             Difference]: Finished difference. Result has 138 places, 159 transitions, 1550 flow
[2024-06-03 22:42:22,556 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1550, PETRI_PLACES=138, PETRI_TRANSITIONS=159}
[2024-06-03 22:42:22,556 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 95 predicate places.
[2024-06-03 22:42:22,556 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 159 transitions, 1550 flow
[2024-06-03 22:42:22,556 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:42:22,557 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:42:22,557 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:42:22,557 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-03 22:42:22,557 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-03 22:42:22,557 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:42:22,557 INFO  L85        PathProgramCache]: Analyzing trace with hash 179093024, now seen corresponding path program 1 times
[2024-06-03 22:42:22,558 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:42:22,558 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615389880]
[2024-06-03 22:42:22,558 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:42:22,558 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:42:22,625 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:42:34,738 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:42:34,738 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:42:34,738 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615389880]
[2024-06-03 22:42:34,738 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615389880] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:42:34,738 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:42:34,739 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:42:34,739 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787120559]
[2024-06-03 22:42:34,739 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:42:34,739 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:42:34,739 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:42:34,739 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:42:34,739 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:42:35,017 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:42:35,018 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 159 transitions, 1550 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:42:35,018 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:42:35,018 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:42:35,018 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:42:36,506 INFO  L124   PetriNetUnfolderBase]: 1871/2940 cut-off events.
[2024-06-03 22:42:36,507 INFO  L125   PetriNetUnfolderBase]: For 78028/78028 co-relation queries the response was YES.
[2024-06-03 22:42:36,517 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19840 conditions, 2940 events. 1871/2940 cut-off events. For 78028/78028 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 15506 event pairs, 484 based on Foata normal form. 2/2940 useless extension candidates. Maximal degree in co-relation 19773. Up to 2804 conditions per place. 
[2024-06-03 22:42:36,528 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 168 selfloop transitions, 21 changer transitions 0/194 dead transitions.
[2024-06-03 22:42:36,528 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 194 transitions, 2076 flow
[2024-06-03 22:42:36,530 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:42:36,531 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:42:36,531 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-03 22:42:36,531 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4497354497354497
[2024-06-03 22:42:36,531 INFO  L175             Difference]: Start difference. First operand has 138 places, 159 transitions, 1550 flow. Second operand 9 states and 170 transitions.
[2024-06-03 22:42:36,531 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 194 transitions, 2076 flow
[2024-06-03 22:42:36,587 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 194 transitions, 2008 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-06-03 22:42:36,589 INFO  L231             Difference]: Finished difference. Result has 141 places, 162 transitions, 1600 flow
[2024-06-03 22:42:36,590 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1600, PETRI_PLACES=141, PETRI_TRANSITIONS=162}
[2024-06-03 22:42:36,591 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 98 predicate places.
[2024-06-03 22:42:36,591 INFO  L495      AbstractCegarLoop]: Abstraction has has 141 places, 162 transitions, 1600 flow
[2024-06-03 22:42:36,591 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:42:36,591 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:42:36,591 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:42:36,591 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-03 22:42:36,592 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-03 22:42:36,592 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:42:36,592 INFO  L85        PathProgramCache]: Analyzing trace with hash 460018368, now seen corresponding path program 3 times
[2024-06-03 22:42:36,592 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:42:36,592 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010157767]
[2024-06-03 22:42:36,592 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:42:36,593 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:42:36,670 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:42:47,173 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:42:47,173 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:42:47,173 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010157767]
[2024-06-03 22:42:47,173 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010157767] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:42:47,173 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:42:47,173 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:42:47,173 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135971834]
[2024-06-03 22:42:47,173 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:42:47,174 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:42:47,174 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:42:47,174 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:42:47,174 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:42:47,349 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 22:42:47,349 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 162 transitions, 1600 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:42:47,349 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:42:47,349 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 22:42:47,349 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:42:48,806 INFO  L124   PetriNetUnfolderBase]: 1787/2857 cut-off events.
[2024-06-03 22:42:48,807 INFO  L125   PetriNetUnfolderBase]: For 86542/86597 co-relation queries the response was YES.
[2024-06-03 22:42:48,816 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19653 conditions, 2857 events. 1787/2857 cut-off events. For 86542/86597 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15518 event pairs, 448 based on Foata normal form. 8/2825 useless extension candidates. Maximal degree in co-relation 19585. Up to 2567 conditions per place. 
[2024-06-03 22:42:48,825 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 127 selfloop transitions, 25 changer transitions 0/193 dead transitions.
[2024-06-03 22:42:48,825 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 193 transitions, 2040 flow
[2024-06-03 22:42:48,826 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:42:48,826 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:42:48,826 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-03 22:42:48,826 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46726190476190477
[2024-06-03 22:42:48,826 INFO  L175             Difference]: Start difference. First operand has 141 places, 162 transitions, 1600 flow. Second operand 8 states and 157 transitions.
[2024-06-03 22:42:48,826 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 193 transitions, 2040 flow
[2024-06-03 22:42:48,870 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 193 transitions, 1946 flow, removed 28 selfloop flow, removed 7 redundant places.
[2024-06-03 22:42:48,872 INFO  L231             Difference]: Finished difference. Result has 143 places, 167 transitions, 1645 flow
[2024-06-03 22:42:48,872 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1645, PETRI_PLACES=143, PETRI_TRANSITIONS=167}
[2024-06-03 22:42:48,873 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 100 predicate places.
[2024-06-03 22:42:48,873 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 167 transitions, 1645 flow
[2024-06-03 22:42:48,873 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:42:48,873 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:42:48,873 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:42:48,873 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-03 22:42:48,873 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-03 22:42:48,874 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:42:48,874 INFO  L85        PathProgramCache]: Analyzing trace with hash 961838410, now seen corresponding path program 2 times
[2024-06-03 22:42:48,874 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:42:48,874 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160900766]
[2024-06-03 22:42:48,874 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:42:48,874 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:42:48,929 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:43:01,020 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:43:01,020 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:43:01,020 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160900766]
[2024-06-03 22:43:01,020 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160900766] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:43:01,021 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:43:01,021 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:43:01,021 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030974067]
[2024-06-03 22:43:01,021 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:43:01,030 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:43:01,030 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:43:01,030 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:43:01,031 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:43:01,325 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:43:01,326 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 167 transitions, 1645 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:43:01,326 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:43:01,326 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:43:01,326 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:43:02,853 INFO  L124   PetriNetUnfolderBase]: 1907/3000 cut-off events.
[2024-06-03 22:43:02,854 INFO  L125   PetriNetUnfolderBase]: For 91554/91554 co-relation queries the response was YES.
[2024-06-03 22:43:02,863 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21036 conditions, 3000 events. 1907/3000 cut-off events. For 91554/91554 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 15895 event pairs, 486 based on Foata normal form. 2/3000 useless extension candidates. Maximal degree in co-relation 20966. Up to 2791 conditions per place. 
[2024-06-03 22:43:02,873 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 161 selfloop transitions, 40 changer transitions 0/206 dead transitions.
[2024-06-03 22:43:02,873 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 206 transitions, 2211 flow
[2024-06-03 22:43:02,875 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:43:02,875 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:43:02,875 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-03 22:43:02,875 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-03 22:43:02,876 INFO  L175             Difference]: Start difference. First operand has 143 places, 167 transitions, 1645 flow. Second operand 10 states and 190 transitions.
[2024-06-03 22:43:02,876 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 206 transitions, 2211 flow
[2024-06-03 22:43:02,929 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 206 transitions, 2125 flow, removed 22 selfloop flow, removed 5 redundant places.
[2024-06-03 22:43:02,933 INFO  L231             Difference]: Finished difference. Result has 148 places, 170 transitions, 1721 flow
[2024-06-03 22:43:02,933 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1559, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1721, PETRI_PLACES=148, PETRI_TRANSITIONS=170}
[2024-06-03 22:43:02,935 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 105 predicate places.
[2024-06-03 22:43:02,935 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 170 transitions, 1721 flow
[2024-06-03 22:43:02,935 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:43:02,935 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:43:02,935 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:43:02,935 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-03 22:43:02,935 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:43:02,936 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:43:02,936 INFO  L85        PathProgramCache]: Analyzing trace with hash -1711060988, now seen corresponding path program 1 times
[2024-06-03 22:43:02,936 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:43:02,936 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207864271]
[2024-06-03 22:43:02,936 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:43:02,936 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:43:02,969 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:43:19,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-03 22:43:19,964 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:43:19,964 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207864271]
[2024-06-03 22:43:19,964 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207864271] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:43:19,964 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:43:19,964 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:43:19,965 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974998761]
[2024-06-03 22:43:19,965 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:43:19,965 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:43:19,965 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:43:19,965 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:43:19,966 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:43:20,111 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:43:20,111 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 170 transitions, 1721 flow. Second operand  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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-03 22:43:20,112 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:43:20,113 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:43:20,113 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:43:21,463 INFO  L124   PetriNetUnfolderBase]: 1927/3036 cut-off events.
[2024-06-03 22:43:21,464 INFO  L125   PetriNetUnfolderBase]: For 98588/98588 co-relation queries the response was YES.
[2024-06-03 22:43:21,474 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21725 conditions, 3036 events. 1927/3036 cut-off events. For 98588/98588 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 16152 event pairs, 487 based on Foata normal form. 4/3038 useless extension candidates. Maximal degree in co-relation 21654. Up to 2855 conditions per place. 
[2024-06-03 22:43:21,484 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 164 selfloop transitions, 26 changer transitions 0/195 dead transitions.
[2024-06-03 22:43:21,484 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 195 transitions, 2339 flow
[2024-06-03 22:43:21,485 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:43:21,485 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:43:21,485 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions.
[2024-06-03 22:43:21,486 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48412698412698413
[2024-06-03 22:43:21,486 INFO  L175             Difference]: Start difference. First operand has 148 places, 170 transitions, 1721 flow. Second operand 6 states and 122 transitions.
[2024-06-03 22:43:21,486 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 195 transitions, 2339 flow
[2024-06-03 22:43:21,537 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 195 transitions, 2201 flow, removed 31 selfloop flow, removed 8 redundant places.
[2024-06-03 22:43:21,540 INFO  L231             Difference]: Finished difference. Result has 146 places, 176 transitions, 1732 flow
[2024-06-03 22:43:21,540 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1583, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1732, PETRI_PLACES=146, PETRI_TRANSITIONS=176}
[2024-06-03 22:43:21,541 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 103 predicate places.
[2024-06-03 22:43:21,541 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 176 transitions, 1732 flow
[2024-06-03 22:43:21,541 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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-03 22:43:21,541 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:43:21,541 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:43:21,541 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-03 22:43:21,541 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-03 22:43:21,542 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:43:21,542 INFO  L85        PathProgramCache]: Analyzing trace with hash 924840264, now seen corresponding path program 4 times
[2024-06-03 22:43:21,542 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:43:21,542 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840627967]
[2024-06-03 22:43:21,542 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:43:21,542 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:43:21,597 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:43:30,905 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:43:30,905 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:43:30,905 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840627967]
[2024-06-03 22:43:30,905 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840627967] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:43:30,905 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:43:30,905 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:43:30,905 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838001907]
[2024-06-03 22:43:30,905 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:43:30,905 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:43:30,906 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:43:30,906 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:43:30,906 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:43:31,036 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 22:43:31,037 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 176 transitions, 1732 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:43:31,037 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:43:31,037 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 22:43:31,037 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:43:32,342 INFO  L124   PetriNetUnfolderBase]: 1808/2891 cut-off events.
[2024-06-03 22:43:32,342 INFO  L125   PetriNetUnfolderBase]: For 104515/104574 co-relation queries the response was YES.
[2024-06-03 22:43:32,353 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20856 conditions, 2891 events. 1808/2891 cut-off events. For 104515/104574 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 15814 event pairs, 451 based on Foata normal form. 8/2856 useless extension candidates. Maximal degree in co-relation 20784. Up to 2562 conditions per place. 
[2024-06-03 22:43:32,363 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 128 selfloop transitions, 35 changer transitions 0/205 dead transitions.
[2024-06-03 22:43:32,364 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 205 transitions, 2190 flow
[2024-06-03 22:43:32,364 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:43:32,364 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:43:32,365 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-03 22:43:32,365 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46726190476190477
[2024-06-03 22:43:32,365 INFO  L175             Difference]: Start difference. First operand has 146 places, 176 transitions, 1732 flow. Second operand 8 states and 157 transitions.
[2024-06-03 22:43:32,365 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 205 transitions, 2190 flow
[2024-06-03 22:43:32,425 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 205 transitions, 2149 flow, removed 14 selfloop flow, removed 2 redundant places.
[2024-06-03 22:43:32,428 INFO  L231             Difference]: Finished difference. Result has 153 places, 181 transitions, 1852 flow
[2024-06-03 22:43:32,428 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1691, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1852, PETRI_PLACES=153, PETRI_TRANSITIONS=181}
[2024-06-03 22:43:32,428 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 110 predicate places.
[2024-06-03 22:43:32,428 INFO  L495      AbstractCegarLoop]: Abstraction has has 153 places, 181 transitions, 1852 flow
[2024-06-03 22:43:32,429 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:43:32,429 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:43:32,429 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:43:32,429 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-03 22:43:32,429 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-03 22:43:32,430 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:43:32,430 INFO  L85        PathProgramCache]: Analyzing trace with hash 931511464, now seen corresponding path program 3 times
[2024-06-03 22:43:32,430 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:43:32,430 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268535624]
[2024-06-03 22:43:32,430 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:43:32,444 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:43:32,549 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:43:44,874 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:43:44,874 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:43:44,875 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268535624]
[2024-06-03 22:43:44,875 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268535624] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:43:44,875 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:43:44,875 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:43:44,875 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240058487]
[2024-06-03 22:43:44,875 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:43:44,875 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:43:44,876 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:43:44,876 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:43:44,876 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:43:45,115 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:43:45,116 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 181 transitions, 1852 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:43:45,116 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:43:45,116 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:43:45,116 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:43:46,563 INFO  L124   PetriNetUnfolderBase]: 1925/3034 cut-off events.
[2024-06-03 22:43:46,563 INFO  L125   PetriNetUnfolderBase]: For 108243/108243 co-relation queries the response was YES.
[2024-06-03 22:43:46,575 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22319 conditions, 3034 events. 1925/3034 cut-off events. For 108243/108243 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 16284 event pairs, 485 based on Foata normal form. 2/3032 useless extension candidates. Maximal degree in co-relation 22244. Up to 2781 conditions per place. 
[2024-06-03 22:43:46,586 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 163 selfloop transitions, 44 changer transitions 0/212 dead transitions.
[2024-06-03 22:43:46,587 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 212 transitions, 2419 flow
[2024-06-03 22:43:46,589 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:43:46,589 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:43:46,589 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-03 22:43:46,590 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.455026455026455
[2024-06-03 22:43:46,590 INFO  L175             Difference]: Start difference. First operand has 153 places, 181 transitions, 1852 flow. Second operand 9 states and 172 transitions.
[2024-06-03 22:43:46,590 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 212 transitions, 2419 flow
[2024-06-03 22:43:46,654 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 212 transitions, 2301 flow, removed 26 selfloop flow, removed 6 redundant places.
[2024-06-03 22:43:46,656 INFO  L231             Difference]: Finished difference. Result has 156 places, 184 transitions, 1912 flow
[2024-06-03 22:43:46,656 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1734, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1912, PETRI_PLACES=156, PETRI_TRANSITIONS=184}
[2024-06-03 22:43:46,657 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 113 predicate places.
[2024-06-03 22:43:46,657 INFO  L495      AbstractCegarLoop]: Abstraction has has 156 places, 184 transitions, 1912 flow
[2024-06-03 22:43:46,657 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:43:46,657 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:43:46,657 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:43:46,657 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-03 22:43:46,657 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-03 22:43:46,658 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:43:46,658 INFO  L85        PathProgramCache]: Analyzing trace with hash 578192552, now seen corresponding path program 4 times
[2024-06-03 22:43:46,658 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:43:46,658 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230425161]
[2024-06-03 22:43:46,658 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:43:46,658 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:43:46,741 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:43:58,597 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:43:58,597 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:43:58,597 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230425161]
[2024-06-03 22:43:58,597 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230425161] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:43:58,597 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:43:58,597 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:43:58,597 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498117155]
[2024-06-03 22:43:58,597 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:43:58,598 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:43:58,598 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:43:58,598 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:43:58,598 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:43:58,763 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:43:58,763 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 184 transitions, 1912 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:43:58,763 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:43:58,764 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:43:58,764 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:44:00,287 INFO  L124   PetriNetUnfolderBase]: 1920/3027 cut-off events.
[2024-06-03 22:44:00,287 INFO  L125   PetriNetUnfolderBase]: For 115974/115974 co-relation queries the response was YES.
[2024-06-03 22:44:00,298 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22595 conditions, 3027 events. 1920/3027 cut-off events. For 115974/115974 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 16251 event pairs, 485 based on Foata normal form. 2/3025 useless extension candidates. Maximal degree in co-relation 22520. Up to 2697 conditions per place. 
[2024-06-03 22:44:00,309 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 149 selfloop transitions, 69 changer transitions 0/223 dead transitions.
[2024-06-03 22:44:00,309 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 223 transitions, 2527 flow
[2024-06-03 22:44:00,312 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:44:00,312 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:44:00,312 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 206 transitions.
[2024-06-03 22:44:00,312 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4458874458874459
[2024-06-03 22:44:00,312 INFO  L175             Difference]: Start difference. First operand has 156 places, 184 transitions, 1912 flow. Second operand 11 states and 206 transitions.
[2024-06-03 22:44:00,313 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 223 transitions, 2527 flow
[2024-06-03 22:44:00,379 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 223 transitions, 2373 flow, removed 35 selfloop flow, removed 7 redundant places.
[2024-06-03 22:44:00,382 INFO  L231             Difference]: Finished difference. Result has 161 places, 188 transitions, 2006 flow
[2024-06-03 22:44:00,382 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1758, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2006, PETRI_PLACES=161, PETRI_TRANSITIONS=188}
[2024-06-03 22:44:00,382 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 118 predicate places.
[2024-06-03 22:44:00,382 INFO  L495      AbstractCegarLoop]: Abstraction has has 161 places, 188 transitions, 2006 flow
[2024-06-03 22:44:00,383 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:44:00,383 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:44:00,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-03 22:44:00,383 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-03 22:44:00,383 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:44:00,383 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:44:00,384 INFO  L85        PathProgramCache]: Analyzing trace with hash -1487501922, now seen corresponding path program 2 times
[2024-06-03 22:44:00,384 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:44:00,384 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416387776]
[2024-06-03 22:44:00,384 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:44:00,384 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:44:00,415 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:44:18,289 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:44:18,289 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:44:18,289 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416387776]
[2024-06-03 22:44:18,289 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416387776] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:44:18,289 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:44:18,290 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:44:18,290 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154107206]
[2024-06-03 22:44:18,290 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:44:18,290 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:44:18,291 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:44:18,291 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:44:18,291 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:44:18,465 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:44:18,465 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 188 transitions, 2006 flow. Second operand  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:44:18,465 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:44:18,465 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:44:18,465 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:44:19,761 INFO  L124   PetriNetUnfolderBase]: 1908/3015 cut-off events.
[2024-06-03 22:44:19,762 INFO  L125   PetriNetUnfolderBase]: For 121009/121009 co-relation queries the response was YES.
[2024-06-03 22:44:19,772 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22856 conditions, 3015 events. 1908/3015 cut-off events. For 121009/121009 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 16175 event pairs, 480 based on Foata normal form. 4/3017 useless extension candidates. Maximal degree in co-relation 22779. Up to 2853 conditions per place. 
[2024-06-03 22:44:19,782 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 175 selfloop transitions, 23 changer transitions 0/203 dead transitions.
[2024-06-03 22:44:19,782 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 203 transitions, 2468 flow
[2024-06-03 22:44:19,783 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 22:44:19,783 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 22:44:19,783 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions.
[2024-06-03 22:44:19,784 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-03 22:44:19,784 INFO  L175             Difference]: Start difference. First operand has 161 places, 188 transitions, 2006 flow. Second operand 5 states and 105 transitions.
[2024-06-03 22:44:19,784 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 203 transitions, 2468 flow
[2024-06-03 22:44:19,865 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 203 transitions, 2233 flow, removed 52 selfloop flow, removed 8 redundant places.
[2024-06-03 22:44:19,867 INFO  L231             Difference]: Finished difference. Result has 158 places, 188 transitions, 1835 flow
[2024-06-03 22:44:19,867 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1771, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1835, PETRI_PLACES=158, PETRI_TRANSITIONS=188}
[2024-06-03 22:44:19,868 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 115 predicate places.
[2024-06-03 22:44:19,868 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 188 transitions, 1835 flow
[2024-06-03 22:44:19,868 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:44:19,868 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:44:19,868 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:44:19,868 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-03 22:44:19,869 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:44:19,869 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:44:19,869 INFO  L85        PathProgramCache]: Analyzing trace with hash 1563297470, now seen corresponding path program 1 times
[2024-06-03 22:44:19,869 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:44:19,869 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307031216]
[2024-06-03 22:44:19,869 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:44:19,869 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:44:19,909 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:44:33,365 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:44:33,366 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:44:33,366 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307031216]
[2024-06-03 22:44:33,366 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307031216] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:44:33,366 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:44:33,366 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:44:33,367 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116327141]
[2024-06-03 22:44:33,367 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:44:33,367 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:44:33,367 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:44:33,367 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:44:33,367 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:44:33,479 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 22:44:33,479 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 188 transitions, 1835 flow. Second operand  has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 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-03 22:44:33,480 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:44:33,480 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 22:44:33,480 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:44:34,843 INFO  L124   PetriNetUnfolderBase]: 1859/2971 cut-off events.
[2024-06-03 22:44:34,843 INFO  L125   PetriNetUnfolderBase]: For 123812/123868 co-relation queries the response was YES.
[2024-06-03 22:44:34,855 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22449 conditions, 2971 events. 1859/2971 cut-off events. For 123812/123868 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 16108 event pairs, 451 based on Foata normal form. 3/2968 useless extension candidates. Maximal degree in co-relation 22371. Up to 2734 conditions per place. 
[2024-06-03 22:44:34,866 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 167 selfloop transitions, 27 changer transitions 0/214 dead transitions.
[2024-06-03 22:44:34,866 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 214 transitions, 2405 flow
[2024-06-03 22:44:34,867 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:44:34,867 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:44:34,869 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-03 22:44:34,871 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45535714285714285
[2024-06-03 22:44:34,871 INFO  L175             Difference]: Start difference. First operand has 158 places, 188 transitions, 1835 flow. Second operand 8 states and 153 transitions.
[2024-06-03 22:44:34,872 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 214 transitions, 2405 flow
[2024-06-03 22:44:34,952 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 214 transitions, 2359 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-06-03 22:44:34,954 INFO  L231             Difference]: Finished difference. Result has 162 places, 194 transitions, 1915 flow
[2024-06-03 22:44:34,954 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1789, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1915, PETRI_PLACES=162, PETRI_TRANSITIONS=194}
[2024-06-03 22:44:34,955 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 119 predicate places.
[2024-06-03 22:44:34,955 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 194 transitions, 1915 flow
[2024-06-03 22:44:34,955 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 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-03 22:44:34,955 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:44:34,955 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:44:34,955 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-03 22:44:34,955 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:44:34,956 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:44:34,956 INFO  L85        PathProgramCache]: Analyzing trace with hash -1664863834, now seen corresponding path program 2 times
[2024-06-03 22:44:34,956 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:44:34,956 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999124019]
[2024-06-03 22:44:34,956 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:44:34,956 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:44:34,997 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:44:48,479 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:44:48,479 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:44:48,479 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999124019]
[2024-06-03 22:44:48,479 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999124019] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:44:48,480 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:44:48,480 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:44:48,480 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910999997]
[2024-06-03 22:44:48,480 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:44:48,480 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:44:48,480 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:44:48,481 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:44:48,481 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:44:48,663 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 22:44:48,663 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 194 transitions, 1915 flow. Second operand  has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 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-03 22:44:48,664 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:44:48,664 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 22:44:48,664 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:44:49,952 INFO  L124   PetriNetUnfolderBase]: 1850/2958 cut-off events.
[2024-06-03 22:44:49,953 INFO  L125   PetriNetUnfolderBase]: For 127943/127999 co-relation queries the response was YES.
[2024-06-03 22:44:49,967 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22698 conditions, 2958 events. 1850/2958 cut-off events. For 127943/127999 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 16060 event pairs, 452 based on Foata normal form. 3/2952 useless extension candidates. Maximal degree in co-relation 22619. Up to 2733 conditions per place. 
[2024-06-03 22:44:49,978 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 167 selfloop transitions, 23 changer transitions 0/210 dead transitions.
[2024-06-03 22:44:49,979 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 210 transitions, 2339 flow
[2024-06-03 22:44:49,979 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:44:49,979 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:44:49,980 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions.
[2024-06-03 22:44:49,980 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48412698412698413
[2024-06-03 22:44:49,980 INFO  L175             Difference]: Start difference. First operand has 162 places, 194 transitions, 1915 flow. Second operand 6 states and 122 transitions.
[2024-06-03 22:44:49,980 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 210 transitions, 2339 flow
[2024-06-03 22:44:50,076 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 210 transitions, 2271 flow, removed 23 selfloop flow, removed 4 redundant places.
[2024-06-03 22:44:50,079 INFO  L231             Difference]: Finished difference. Result has 164 places, 194 transitions, 1904 flow
[2024-06-03 22:44:50,079 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1847, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1904, PETRI_PLACES=164, PETRI_TRANSITIONS=194}
[2024-06-03 22:44:50,079 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 121 predicate places.
[2024-06-03 22:44:50,079 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 194 transitions, 1904 flow
[2024-06-03 22:44:50,080 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 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-03 22:44:50,080 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:44:50,080 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:44:50,080 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-03 22:44:50,080 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:44:50,080 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:44:50,081 INFO  L85        PathProgramCache]: Analyzing trace with hash 392334268, now seen corresponding path program 1 times
[2024-06-03 22:44:50,081 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:44:50,081 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90213663]
[2024-06-03 22:44:50,081 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:44:50,081 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:44:50,117 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:45:06,038 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:45:06,038 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:45:06,038 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90213663]
[2024-06-03 22:45:06,039 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90213663] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:45:06,039 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:45:06,039 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:45:06,039 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683374399]
[2024-06-03 22:45:06,039 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:45:06,039 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:45:06,039 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:45:06,041 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:45:06,041 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:45:06,216 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:45:06,216 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 194 transitions, 1904 flow. Second operand  has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:45:06,216 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:45:06,217 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:45:06,217 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:45:07,390 INFO  L124   PetriNetUnfolderBase]: 1917/3024 cut-off events.
[2024-06-03 22:45:07,390 INFO  L125   PetriNetUnfolderBase]: For 129823/129823 co-relation queries the response was YES.
[2024-06-03 22:45:07,402 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23159 conditions, 3024 events. 1917/3024 cut-off events. For 129823/129823 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 16124 event pairs, 481 based on Foata normal form. 2/3024 useless extension candidates. Maximal degree in co-relation 23079. Up to 2916 conditions per place. 
[2024-06-03 22:45:07,413 INFO  L140   encePairwiseOnDemand]: 36/42 looper letters, 185 selfloop transitions, 14 changer transitions 0/204 dead transitions.
[2024-06-03 22:45:07,414 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 204 transitions, 2348 flow
[2024-06-03 22:45:07,416 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 22:45:07,416 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 22:45:07,416 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions.
[2024-06-03 22:45:07,416 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-03 22:45:07,417 INFO  L175             Difference]: Start difference. First operand has 164 places, 194 transitions, 1904 flow. Second operand 5 states and 95 transitions.
[2024-06-03 22:45:07,417 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 204 transitions, 2348 flow
[2024-06-03 22:45:07,513 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 204 transitions, 2302 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-06-03 22:45:07,516 INFO  L231             Difference]: Finished difference. Result has 164 places, 196 transitions, 1921 flow
[2024-06-03 22:45:07,516 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1858, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1921, PETRI_PLACES=164, PETRI_TRANSITIONS=196}
[2024-06-03 22:45:07,517 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 121 predicate places.
[2024-06-03 22:45:07,517 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 196 transitions, 1921 flow
[2024-06-03 22:45:07,517 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:45:07,517 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:45:07,517 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:45:07,517 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-03 22:45:07,517 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:45:07,518 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:45:07,518 INFO  L85        PathProgramCache]: Analyzing trace with hash 375198773, now seen corresponding path program 1 times
[2024-06-03 22:45:07,518 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:45:07,518 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24728188]
[2024-06-03 22:45:07,518 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:45:07,518 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:45:07,579 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:45:17,607 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:45:17,607 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:45:17,608 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24728188]
[2024-06-03 22:45:17,608 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24728188] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:45:17,608 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:45:17,608 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:45:17,608 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768435874]
[2024-06-03 22:45:17,608 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:45:17,624 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:45:17,624 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:45:17,625 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:45:17,625 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:45:17,918 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:45:17,918 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 196 transitions, 1921 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:45:17,918 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:45:17,918 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:45:17,918 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:45:19,414 INFO  L124   PetriNetUnfolderBase]: 1934/3051 cut-off events.
[2024-06-03 22:45:19,415 INFO  L125   PetriNetUnfolderBase]: For 137468/137468 co-relation queries the response was YES.
[2024-06-03 22:45:19,426 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23552 conditions, 3051 events. 1934/3051 cut-off events. For 137468/137468 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 16376 event pairs, 315 based on Foata normal form. 4/3053 useless extension candidates. Maximal degree in co-relation 23471. Up to 2852 conditions per place. 
[2024-06-03 22:45:19,437 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 214 selfloop transitions, 18 changer transitions 0/237 dead transitions.
[2024-06-03 22:45:19,437 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 237 transitions, 2607 flow
[2024-06-03 22:45:19,439 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:45:19,439 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:45:19,444 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-03 22:45:19,445 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4497354497354497
[2024-06-03 22:45:19,445 INFO  L175             Difference]: Start difference. First operand has 164 places, 196 transitions, 1921 flow. Second operand 9 states and 170 transitions.
[2024-06-03 22:45:19,445 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 237 transitions, 2607 flow
[2024-06-03 22:45:19,533 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 237 transitions, 2560 flow, removed 11 selfloop flow, removed 3 redundant places.
[2024-06-03 22:45:19,536 INFO  L231             Difference]: Finished difference. Result has 172 places, 202 transitions, 2061 flow
[2024-06-03 22:45:19,536 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1874, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2061, PETRI_PLACES=172, PETRI_TRANSITIONS=202}
[2024-06-03 22:45:19,537 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 129 predicate places.
[2024-06-03 22:45:19,537 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 202 transitions, 2061 flow
[2024-06-03 22:45:19,537 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:45:19,537 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:45:19,537 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:45:19,537 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-03 22:45:19,538 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:45:19,538 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:45:19,538 INFO  L85        PathProgramCache]: Analyzing trace with hash 379008053, now seen corresponding path program 2 times
[2024-06-03 22:45:19,538 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:45:19,538 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510094679]
[2024-06-03 22:45:19,538 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:45:19,538 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:45:19,591 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:45:30,546 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:45:30,547 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:45:30,547 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510094679]
[2024-06-03 22:45:30,547 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510094679] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:45:30,547 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:45:30,547 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:45:30,547 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645362947]
[2024-06-03 22:45:30,548 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:45:30,548 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:45:30,548 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:45:30,548 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:45:30,548 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:45:30,661 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:45:30,662 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 202 transitions, 2061 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:45:30,662 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:45:30,662 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:45:30,662 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:45:32,267 INFO  L124   PetriNetUnfolderBase]: 1951/3078 cut-off events.
[2024-06-03 22:45:32,268 INFO  L125   PetriNetUnfolderBase]: For 144888/144888 co-relation queries the response was YES.
[2024-06-03 22:45:32,281 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24115 conditions, 3078 events. 1951/3078 cut-off events. For 144888/144888 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 16502 event pairs, 439 based on Foata normal form. 4/3080 useless extension candidates. Maximal degree in co-relation 24031. Up to 2919 conditions per place. 
[2024-06-03 22:45:32,292 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 212 selfloop transitions, 20 changer transitions 0/237 dead transitions.
[2024-06-03 22:45:32,293 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 237 transitions, 2665 flow
[2024-06-03 22:45:32,295 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:45:32,295 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:45:32,295 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-03 22:45:32,296 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4497354497354497
[2024-06-03 22:45:32,296 INFO  L175             Difference]: Start difference. First operand has 172 places, 202 transitions, 2061 flow. Second operand 9 states and 170 transitions.
[2024-06-03 22:45:32,296 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 237 transitions, 2665 flow
[2024-06-03 22:45:32,409 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 237 transitions, 2537 flow, removed 56 selfloop flow, removed 4 redundant places.
[2024-06-03 22:45:32,412 INFO  L231             Difference]: Finished difference. Result has 177 places, 204 transitions, 2036 flow
[2024-06-03 22:45:32,412 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1933, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2036, PETRI_PLACES=177, PETRI_TRANSITIONS=204}
[2024-06-03 22:45:32,413 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 134 predicate places.
[2024-06-03 22:45:32,413 INFO  L495      AbstractCegarLoop]: Abstraction has has 177 places, 204 transitions, 2036 flow
[2024-06-03 22:45:32,414 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:45:32,414 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:45:32,414 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:45:32,414 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-03 22:45:32,414 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:45:32,415 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:45:32,415 INFO  L85        PathProgramCache]: Analyzing trace with hash -313914851, now seen corresponding path program 3 times
[2024-06-03 22:45:32,415 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:45:32,415 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044539748]
[2024-06-03 22:45:32,415 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:45:32,415 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:45:32,474 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:45:44,462 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:45:44,462 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:45:44,462 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044539748]
[2024-06-03 22:45:44,462 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044539748] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:45:44,462 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:45:44,463 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:45:44,463 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082556842]
[2024-06-03 22:45:44,463 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:45:44,463 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:45:44,463 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:45:44,464 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:45:44,464 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:45:44,591 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:45:44,591 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 204 transitions, 2036 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:45:44,591 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:45:44,591 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:45:44,592 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:45:46,159 INFO  L124   PetriNetUnfolderBase]: 1968/3105 cut-off events.
[2024-06-03 22:45:46,159 INFO  L125   PetriNetUnfolderBase]: For 152182/152182 co-relation queries the response was YES.
[2024-06-03 22:45:46,171 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24458 conditions, 3105 events. 1968/3105 cut-off events. For 152182/152182 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 16681 event pairs, 432 based on Foata normal form. 4/3107 useless extension candidates. Maximal degree in co-relation 24372. Up to 2905 conditions per place. 
[2024-06-03 22:45:46,181 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 214 selfloop transitions, 23 changer transitions 0/242 dead transitions.
[2024-06-03 22:45:46,182 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 242 transitions, 2700 flow
[2024-06-03 22:45:46,184 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:45:46,184 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:45:46,184 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-03 22:45:46,184 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.455026455026455
[2024-06-03 22:45:46,184 INFO  L175             Difference]: Start difference. First operand has 177 places, 204 transitions, 2036 flow. Second operand 9 states and 172 transitions.
[2024-06-03 22:45:46,185 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 242 transitions, 2700 flow
[2024-06-03 22:45:46,280 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 242 transitions, 2615 flow, removed 24 selfloop flow, removed 7 redundant places.
[2024-06-03 22:45:46,283 INFO  L231             Difference]: Finished difference. Result has 180 places, 208 transitions, 2116 flow
[2024-06-03 22:45:46,283 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1951, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2116, PETRI_PLACES=180, PETRI_TRANSITIONS=208}
[2024-06-03 22:45:46,283 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 137 predicate places.
[2024-06-03 22:45:46,284 INFO  L495      AbstractCegarLoop]: Abstraction has has 180 places, 208 transitions, 2116 flow
[2024-06-03 22:45:46,284 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:45:46,284 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:45:46,284 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:45:46,284 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-03 22:45:46,284 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:45:46,284 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:45:46,285 INFO  L85        PathProgramCache]: Analyzing trace with hash -313761029, now seen corresponding path program 1 times
[2024-06-03 22:45:46,285 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:45:46,285 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915583361]
[2024-06-03 22:45:46,285 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:45:46,285 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:45:46,353 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:45:57,150 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:45:57,151 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:45:57,151 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915583361]
[2024-06-03 22:45:57,151 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915583361] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:45:57,151 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:45:57,151 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:45:57,151 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117012312]
[2024-06-03 22:45:57,152 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:45:57,152 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:45:57,152 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:45:57,152 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:45:57,153 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:45:57,339 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:45:57,339 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 208 transitions, 2116 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:45:57,340 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:45:57,340 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:45:57,340 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:45:58,967 INFO  L124   PetriNetUnfolderBase]: 2026/3203 cut-off events.
[2024-06-03 22:45:58,967 INFO  L125   PetriNetUnfolderBase]: For 170233/170233 co-relation queries the response was YES.
[2024-06-03 22:45:58,981 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25480 conditions, 3203 events. 2026/3203 cut-off events. For 170233/170233 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 17419 event pairs, 445 based on Foata normal form. 16/3217 useless extension candidates. Maximal degree in co-relation 25392. Up to 2961 conditions per place. 
[2024-06-03 22:45:58,992 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 222 selfloop transitions, 22 changer transitions 0/249 dead transitions.
[2024-06-03 22:45:58,992 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 249 transitions, 2798 flow
[2024-06-03 22:45:58,994 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:45:58,994 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:45:58,995 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions.
[2024-06-03 22:45:58,995 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-03 22:45:58,995 INFO  L175             Difference]: Start difference. First operand has 180 places, 208 transitions, 2116 flow. Second operand 10 states and 189 transitions.
[2024-06-03 22:45:58,995 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 249 transitions, 2798 flow
[2024-06-03 22:45:59,132 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 249 transitions, 2672 flow, removed 46 selfloop flow, removed 6 redundant places.
[2024-06-03 22:45:59,134 INFO  L231             Difference]: Finished difference. Result has 184 places, 209 transitions, 2085 flow
[2024-06-03 22:45:59,135 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1992, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2085, PETRI_PLACES=184, PETRI_TRANSITIONS=209}
[2024-06-03 22:45:59,135 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 141 predicate places.
[2024-06-03 22:45:59,135 INFO  L495      AbstractCegarLoop]: Abstraction has has 184 places, 209 transitions, 2085 flow
[2024-06-03 22:45:59,135 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:45:59,136 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:45:59,136 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:45:59,136 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-03 22:45:59,136 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:45:59,136 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:45:59,136 INFO  L85        PathProgramCache]: Analyzing trace with hash -454438995, now seen corresponding path program 4 times
[2024-06-03 22:45:59,136 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:45:59,137 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351908837]
[2024-06-03 22:45:59,137 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:45:59,137 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:45:59,190 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:46:11,218 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:46:11,219 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:46:11,219 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351908837]
[2024-06-03 22:46:11,219 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351908837] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:46:11,219 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:46:11,219 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:46:11,219 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860781377]
[2024-06-03 22:46:11,219 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:46:11,219 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:46:11,219 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:46:11,220 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:46:11,220 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:46:11,388 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:46:11,388 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 209 transitions, 2085 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:46:11,388 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:46:11,389 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:46:11,389 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:46:12,890 INFO  L124   PetriNetUnfolderBase]: 2054/3251 cut-off events.
[2024-06-03 22:46:12,890 INFO  L125   PetriNetUnfolderBase]: For 167546/167546 co-relation queries the response was YES.
[2024-06-03 22:46:12,906 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25761 conditions, 3251 events. 2054/3251 cut-off events. For 167546/167546 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 17706 event pairs, 452 based on Foata normal form. 4/3253 useless extension candidates. Maximal degree in co-relation 25672. Up to 3075 conditions per place. 
[2024-06-03 22:46:12,918 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 214 selfloop transitions, 25 changer transitions 0/244 dead transitions.
[2024-06-03 22:46:12,918 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 244 transitions, 2724 flow
[2024-06-03 22:46:12,920 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:46:12,920 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:46:12,921 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions.
[2024-06-03 22:46:12,921 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4470899470899471
[2024-06-03 22:46:12,921 INFO  L175             Difference]: Start difference. First operand has 184 places, 209 transitions, 2085 flow. Second operand 9 states and 169 transitions.
[2024-06-03 22:46:12,921 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 244 transitions, 2724 flow
[2024-06-03 22:46:13,060 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 244 transitions, 2665 flow, removed 9 selfloop flow, removed 8 redundant places.
[2024-06-03 22:46:13,063 INFO  L231             Difference]: Finished difference. Result has 185 places, 214 transitions, 2170 flow
[2024-06-03 22:46:13,063 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2026, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2170, PETRI_PLACES=185, PETRI_TRANSITIONS=214}
[2024-06-03 22:46:13,064 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 142 predicate places.
[2024-06-03 22:46:13,064 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 214 transitions, 2170 flow
[2024-06-03 22:46:13,064 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:46:13,064 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:46:13,064 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:46:13,065 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-03 22:46:13,065 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:46:13,065 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:46:13,065 INFO  L85        PathProgramCache]: Analyzing trace with hash -195010019, now seen corresponding path program 5 times
[2024-06-03 22:46:13,065 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:46:13,065 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148352390]
[2024-06-03 22:46:13,065 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:46:13,066 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:46:13,124 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:46:23,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-03 22:46:23,766 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:46:23,766 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148352390]
[2024-06-03 22:46:23,766 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148352390] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:46:23,766 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:46:23,766 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:46:23,766 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316838032]
[2024-06-03 22:46:23,766 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:46:23,767 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:46:23,767 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:46:23,767 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:46:23,767 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:46:24,098 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:46:24,098 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 214 transitions, 2170 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:46:24,098 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:46:24,098 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:46:24,099 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:46:25,682 INFO  L124   PetriNetUnfolderBase]: 2096/3317 cut-off events.
[2024-06-03 22:46:25,683 INFO  L125   PetriNetUnfolderBase]: For 179198/179198 co-relation queries the response was YES.
[2024-06-03 22:46:25,698 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26674 conditions, 3317 events. 2096/3317 cut-off events. For 179198/179198 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 18168 event pairs, 452 based on Foata normal form. 4/3319 useless extension candidates. Maximal degree in co-relation 26584. Up to 3043 conditions per place. 
[2024-06-03 22:46:25,711 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 211 selfloop transitions, 36 changer transitions 0/252 dead transitions.
[2024-06-03 22:46:25,711 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 252 transitions, 3038 flow
[2024-06-03 22:46:25,713 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:46:25,714 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:46:25,714 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions.
[2024-06-03 22:46:25,714 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4603174603174603
[2024-06-03 22:46:25,714 INFO  L175             Difference]: Start difference. First operand has 185 places, 214 transitions, 2170 flow. Second operand 9 states and 174 transitions.
[2024-06-03 22:46:25,714 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 252 transitions, 3038 flow
[2024-06-03 22:46:25,853 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 252 transitions, 2935 flow, removed 34 selfloop flow, removed 5 redundant places.
[2024-06-03 22:46:25,856 INFO  L231             Difference]: Finished difference. Result has 190 places, 219 transitions, 2292 flow
[2024-06-03 22:46:25,857 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2067, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2292, PETRI_PLACES=190, PETRI_TRANSITIONS=219}
[2024-06-03 22:46:25,857 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 147 predicate places.
[2024-06-03 22:46:25,857 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 219 transitions, 2292 flow
[2024-06-03 22:46:25,857 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:46:25,857 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:46:25,858 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:46:25,858 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-03 22:46:25,858 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:46:25,858 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:46:25,858 INFO  L85        PathProgramCache]: Analyzing trace with hash 4439641, now seen corresponding path program 6 times
[2024-06-03 22:46:25,858 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:46:25,859 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702844109]
[2024-06-03 22:46:25,859 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:46:25,859 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:46:25,916 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:46:37,539 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:46:37,539 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:46:37,539 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702844109]
[2024-06-03 22:46:37,539 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702844109] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:46:37,539 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:46:37,539 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:46:37,539 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372123845]
[2024-06-03 22:46:37,539 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:46:37,539 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:46:37,540 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:46:37,540 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:46:37,540 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:46:37,797 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:46:37,797 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 219 transitions, 2292 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:46:37,797 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:46:37,798 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:46:37,798 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:46:39,402 INFO  L124   PetriNetUnfolderBase]: 2088/3305 cut-off events.
[2024-06-03 22:46:39,402 INFO  L125   PetriNetUnfolderBase]: For 183374/183374 co-relation queries the response was YES.
[2024-06-03 22:46:39,420 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26680 conditions, 3305 events. 2088/3305 cut-off events. For 183374/183374 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 18079 event pairs, 457 based on Foata normal form. 4/3307 useless extension candidates. Maximal degree in co-relation 26588. Up to 3096 conditions per place. 
[2024-06-03 22:46:39,434 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 212 selfloop transitions, 33 changer transitions 0/250 dead transitions.
[2024-06-03 22:46:39,434 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 250 transitions, 2907 flow
[2024-06-03 22:46:39,436 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:46:39,436 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:46:39,437 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-03 22:46:39,437 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4497354497354497
[2024-06-03 22:46:39,437 INFO  L175             Difference]: Start difference. First operand has 190 places, 219 transitions, 2292 flow. Second operand 9 states and 170 transitions.
[2024-06-03 22:46:39,437 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 250 transitions, 2907 flow
[2024-06-03 22:46:39,596 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 250 transitions, 2715 flow, removed 78 selfloop flow, removed 5 redundant places.
[2024-06-03 22:46:39,599 INFO  L231             Difference]: Finished difference. Result has 194 places, 220 transitions, 2222 flow
[2024-06-03 22:46:39,599 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2140, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2222, PETRI_PLACES=194, PETRI_TRANSITIONS=220}
[2024-06-03 22:46:39,599 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 151 predicate places.
[2024-06-03 22:46:39,600 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 220 transitions, 2222 flow
[2024-06-03 22:46:39,600 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:46:39,600 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:46:39,600 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:46:39,600 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-03 22:46:39,600 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:46:39,601 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:46:39,601 INFO  L85        PathProgramCache]: Analyzing trace with hash -454433043, now seen corresponding path program 2 times
[2024-06-03 22:46:39,601 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:46:39,601 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195755379]
[2024-06-03 22:46:39,601 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:46:39,601 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:46:39,672 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:46:51,213 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:46:51,213 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:46:51,213 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195755379]
[2024-06-03 22:46:51,213 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195755379] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:46:51,214 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:46:51,214 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:46:51,214 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031930916]
[2024-06-03 22:46:51,214 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:46:51,214 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:46:51,214 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:46:51,215 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:46:51,215 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:46:51,536 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:46:51,537 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 220 transitions, 2222 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:46:51,537 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:46:51,537 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:46:51,537 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:46:53,391 INFO  L124   PetriNetUnfolderBase]: 2157/3419 cut-off events.
[2024-06-03 22:46:53,391 INFO  L125   PetriNetUnfolderBase]: For 198544/198544 co-relation queries the response was YES.
[2024-06-03 22:46:53,407 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27278 conditions, 3419 events. 2157/3419 cut-off events. For 198544/198544 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 18919 event pairs, 467 based on Foata normal form. 16/3433 useless extension candidates. Maximal degree in co-relation 27184. Up to 3160 conditions per place. 
[2024-06-03 22:46:53,421 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 229 selfloop transitions, 27 changer transitions 0/261 dead transitions.
[2024-06-03 22:46:53,421 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 261 transitions, 2924 flow
[2024-06-03 22:46:53,430 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:46:53,430 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:46:53,430 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-03 22:46:53,430 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44761904761904764
[2024-06-03 22:46:53,430 INFO  L175             Difference]: Start difference. First operand has 194 places, 220 transitions, 2222 flow. Second operand 10 states and 188 transitions.
[2024-06-03 22:46:53,430 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 261 transitions, 2924 flow
[2024-06-03 22:46:53,573 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 261 transitions, 2851 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-06-03 22:46:53,576 INFO  L231             Difference]: Finished difference. Result has 198 places, 224 transitions, 2270 flow
[2024-06-03 22:46:53,577 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2149, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2270, PETRI_PLACES=198, PETRI_TRANSITIONS=224}
[2024-06-03 22:46:53,578 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 155 predicate places.
[2024-06-03 22:46:53,578 INFO  L495      AbstractCegarLoop]: Abstraction has has 198 places, 224 transitions, 2270 flow
[2024-06-03 22:46:53,579 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:46:53,579 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:46:53,579 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:46:53,579 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-03 22:46:53,579 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:46:53,579 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:46:53,579 INFO  L85        PathProgramCache]: Analyzing trace with hash -247779603, now seen corresponding path program 3 times
[2024-06-03 22:46:53,580 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:46:53,580 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121206144]
[2024-06-03 22:46:53,580 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:46:53,580 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:46:53,670 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:47:08,983 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:47:08,983 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:47:08,983 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121206144]
[2024-06-03 22:47:08,984 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121206144] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:47:08,984 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:47:08,984 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:47:08,984 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149244088]
[2024-06-03 22:47:08,984 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:47:08,984 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:47:08,984 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:47:08,984 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:47:08,985 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:47:09,360 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:47:09,360 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 224 transitions, 2270 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-03 22:47:09,360 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:47:09,360 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:47:09,361 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:47:11,206 INFO  L124   PetriNetUnfolderBase]: 2215/3527 cut-off events.
[2024-06-03 22:47:11,206 INFO  L125   PetriNetUnfolderBase]: For 210132/210132 co-relation queries the response was YES.
[2024-06-03 22:47:11,223 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28292 conditions, 3527 events. 2215/3527 cut-off events. For 210132/210132 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 19730 event pairs, 482 based on Foata normal form. 16/3541 useless extension candidates. Maximal degree in co-relation 28196. Up to 3171 conditions per place. 
[2024-06-03 22:47:11,236 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 212 selfloop transitions, 49 changer transitions 0/266 dead transitions.
[2024-06-03 22:47:11,237 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 266 transitions, 2990 flow
[2024-06-03 22:47:11,239 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:47:11,239 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:47:11,240 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions.
[2024-06-03 22:47:11,240 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4264069264069264
[2024-06-03 22:47:11,240 INFO  L175             Difference]: Start difference. First operand has 198 places, 224 transitions, 2270 flow. Second operand 11 states and 197 transitions.
[2024-06-03 22:47:11,240 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 266 transitions, 2990 flow
[2024-06-03 22:47:11,401 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 266 transitions, 2929 flow, removed 7 selfloop flow, removed 7 redundant places.
[2024-06-03 22:47:11,404 INFO  L231             Difference]: Finished difference. Result has 202 places, 225 transitions, 2365 flow
[2024-06-03 22:47:11,404 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2209, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2365, PETRI_PLACES=202, PETRI_TRANSITIONS=225}
[2024-06-03 22:47:11,405 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 159 predicate places.
[2024-06-03 22:47:11,405 INFO  L495      AbstractCegarLoop]: Abstraction has has 202 places, 225 transitions, 2365 flow
[2024-06-03 22:47:11,405 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-03 22:47:11,405 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:47:11,405 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:47:11,410 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-03 22:47:11,410 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:47:11,410 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:47:11,411 INFO  L85        PathProgramCache]: Analyzing trace with hash 1582742389, now seen corresponding path program 4 times
[2024-06-03 22:47:11,411 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:47:11,411 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401120718]
[2024-06-03 22:47:11,411 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:47:11,411 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:47:11,572 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:47:25,482 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:47:25,482 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:47:25,482 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401120718]
[2024-06-03 22:47:25,482 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401120718] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:47:25,482 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:47:25,482 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:47:25,483 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430696412]
[2024-06-03 22:47:25,483 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:47:25,483 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:47:25,483 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:47:25,483 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:47:25,484 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:47:25,768 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:47:25,768 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 225 transitions, 2365 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:47:25,768 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:47:25,768 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:47:25,768 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:47:27,642 INFO  L124   PetriNetUnfolderBase]: 2317/3711 cut-off events.
[2024-06-03 22:47:27,642 INFO  L125   PetriNetUnfolderBase]: For 231852/231852 co-relation queries the response was YES.
[2024-06-03 22:47:27,659 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30413 conditions, 3711 events. 2317/3711 cut-off events. For 231852/231852 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 21178 event pairs, 507 based on Foata normal form. 12/3721 useless extension candidates. Maximal degree in co-relation 30316. Up to 2795 conditions per place. 
[2024-06-03 22:47:27,673 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 209 selfloop transitions, 55 changer transitions 0/269 dead transitions.
[2024-06-03 22:47:27,673 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 269 transitions, 3345 flow
[2024-06-03 22:47:27,675 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:47:27,675 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:47:27,676 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions.
[2024-06-03 22:47:27,676 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-03 22:47:27,676 INFO  L175             Difference]: Start difference. First operand has 202 places, 225 transitions, 2365 flow. Second operand 10 states and 195 transitions.
[2024-06-03 22:47:27,676 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 269 transitions, 3345 flow
[2024-06-03 22:47:27,849 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 269 transitions, 3231 flow, removed 11 selfloop flow, removed 9 redundant places.
[2024-06-03 22:47:27,853 INFO  L231             Difference]: Finished difference. Result has 203 places, 227 transitions, 2465 flow
[2024-06-03 22:47:27,853 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2251, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2465, PETRI_PLACES=203, PETRI_TRANSITIONS=227}
[2024-06-03 22:47:27,853 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 160 predicate places.
[2024-06-03 22:47:27,853 INFO  L495      AbstractCegarLoop]: Abstraction has has 203 places, 227 transitions, 2465 flow
[2024-06-03 22:47:27,854 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:47:27,854 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:47:27,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-03 22:47:27,854 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-03 22:47:27,854 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:47:27,854 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:47:27,854 INFO  L85        PathProgramCache]: Analyzing trace with hash 1575123829, now seen corresponding path program 5 times
[2024-06-03 22:47:27,855 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:47:27,855 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413160032]
[2024-06-03 22:47:27,855 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:47:27,855 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:47:27,985 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:47:39,624 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:47:39,625 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:47:39,625 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413160032]
[2024-06-03 22:47:39,625 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413160032] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:47:39,625 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:47:39,625 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:47:39,625 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194948901]
[2024-06-03 22:47:39,625 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:47:39,625 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:47:39,626 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:47:39,626 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:47:39,626 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:47:39,931 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:47:39,932 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 227 transitions, 2465 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:47:39,932 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:47:39,932 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:47:39,932 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:47:41,767 INFO  L124   PetriNetUnfolderBase]: 2289/3667 cut-off events.
[2024-06-03 22:47:41,767 INFO  L125   PetriNetUnfolderBase]: For 228160/228160 co-relation queries the response was YES.
[2024-06-03 22:47:41,785 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29548 conditions, 3667 events. 2289/3667 cut-off events. For 228160/228160 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 20945 event pairs, 510 based on Foata normal form. 16/3681 useless extension candidates. Maximal degree in co-relation 29450. Up to 3355 conditions per place. 
[2024-06-03 22:47:41,798 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 224 selfloop transitions, 35 changer transitions 0/264 dead transitions.
[2024-06-03 22:47:41,799 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 264 transitions, 3125 flow
[2024-06-03 22:47:41,801 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:47:41,801 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:47:41,808 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions.
[2024-06-03 22:47:41,808 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-03 22:47:41,809 INFO  L175             Difference]: Start difference. First operand has 203 places, 227 transitions, 2465 flow. Second operand 10 states and 189 transitions.
[2024-06-03 22:47:41,809 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 264 transitions, 3125 flow
[2024-06-03 22:47:42,028 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 264 transitions, 3037 flow, removed 16 selfloop flow, removed 6 redundant places.
[2024-06-03 22:47:42,032 INFO  L231             Difference]: Finished difference. Result has 207 places, 227 transitions, 2454 flow
[2024-06-03 22:47:42,032 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2377, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2454, PETRI_PLACES=207, PETRI_TRANSITIONS=227}
[2024-06-03 22:47:42,032 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 164 predicate places.
[2024-06-03 22:47:42,032 INFO  L495      AbstractCegarLoop]: Abstraction has has 207 places, 227 transitions, 2454 flow
[2024-06-03 22:47:42,033 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:47:42,033 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:47:42,033 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:47:42,033 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-03 22:47:42,033 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:47:42,033 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:47:42,033 INFO  L85        PathProgramCache]: Analyzing trace with hash -1394722191, now seen corresponding path program 7 times
[2024-06-03 22:47:42,034 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:47:42,034 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370056371]
[2024-06-03 22:47:42,034 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:47:42,034 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:47:42,097 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:47:53,248 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:47:53,249 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:47:53,249 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370056371]
[2024-06-03 22:47:53,249 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370056371] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:47:53,249 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:47:53,249 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:47:53,249 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326236252]
[2024-06-03 22:47:53,249 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:47:53,249 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:47:53,250 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:47:53,250 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:47:53,250 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:47:53,481 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:47:53,481 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 227 transitions, 2454 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:47:53,481 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:47:53,481 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:47:53,482 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:47:55,044 INFO  L124   PetriNetUnfolderBase]: 2281/3651 cut-off events.
[2024-06-03 22:47:55,045 INFO  L125   PetriNetUnfolderBase]: For 218503/218503 co-relation queries the response was YES.
[2024-06-03 22:47:55,064 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29322 conditions, 3651 events. 2281/3651 cut-off events. For 218503/218503 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 20867 event pairs, 497 based on Foata normal form. 4/3651 useless extension candidates. Maximal degree in co-relation 29222. Up to 3323 conditions per place. 
[2024-06-03 22:47:55,079 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 212 selfloop transitions, 46 changer transitions 0/263 dead transitions.
[2024-06-03 22:47:55,079 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 263 transitions, 3228 flow
[2024-06-03 22:47:55,082 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:47:55,082 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:47:55,083 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-03 22:47:55,084 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-03 22:47:55,084 INFO  L175             Difference]: Start difference. First operand has 207 places, 227 transitions, 2454 flow. Second operand 9 states and 171 transitions.
[2024-06-03 22:47:55,084 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 263 transitions, 3228 flow
[2024-06-03 22:47:55,270 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 263 transitions, 3127 flow, removed 11 selfloop flow, removed 9 redundant places.
[2024-06-03 22:47:55,273 INFO  L231             Difference]: Finished difference. Result has 208 places, 234 transitions, 2654 flow
[2024-06-03 22:47:55,274 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2353, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2654, PETRI_PLACES=208, PETRI_TRANSITIONS=234}
[2024-06-03 22:47:55,274 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 165 predicate places.
[2024-06-03 22:47:55,274 INFO  L495      AbstractCegarLoop]: Abstraction has has 208 places, 234 transitions, 2654 flow
[2024-06-03 22:47:55,274 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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-03 22:47:55,274 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:47:55,275 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:47:55,275 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-03 22:47:55,275 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:47:55,275 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:47:55,275 INFO  L85        PathProgramCache]: Analyzing trace with hash 1058066827, now seen corresponding path program 6 times
[2024-06-03 22:47:55,275 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:47:55,275 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646064079]
[2024-06-03 22:47:55,276 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:47:55,276 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:47:55,364 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:48:07,690 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:48:07,691 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:48:07,691 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646064079]
[2024-06-03 22:48:07,691 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646064079] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:48:07,691 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:48:07,691 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:48:07,691 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275553855]
[2024-06-03 22:48:07,691 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:48:07,691 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:48:07,691 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:48:07,692 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:48:07,692 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:48:08,024 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:48:08,025 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 234 transitions, 2654 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:48:08,025 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:48:08,025 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:48:08,025 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:48:09,873 INFO  L124   PetriNetUnfolderBase]: 2383/3825 cut-off events.
[2024-06-03 22:48:09,874 INFO  L125   PetriNetUnfolderBase]: For 252095/252095 co-relation queries the response was YES.
[2024-06-03 22:48:09,894 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31541 conditions, 3825 events. 2383/3825 cut-off events. For 252095/252095 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 22019 event pairs, 498 based on Foata normal form. 12/3833 useless extension candidates. Maximal degree in co-relation 31440. Up to 2582 conditions per place. 
[2024-06-03 22:48:09,909 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 188 selfloop transitions, 84 changer transitions 0/277 dead transitions.
[2024-06-03 22:48:09,909 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 277 transitions, 3666 flow
[2024-06-03 22:48:09,911 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:48:09,911 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:48:09,912 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions.
[2024-06-03 22:48:09,912 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-03 22:48:09,912 INFO  L175             Difference]: Start difference. First operand has 208 places, 234 transitions, 2654 flow. Second operand 10 states and 195 transitions.
[2024-06-03 22:48:09,912 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 277 transitions, 3666 flow
[2024-06-03 22:48:10,223 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 277 transitions, 3456 flow, removed 83 selfloop flow, removed 5 redundant places.
[2024-06-03 22:48:10,228 INFO  L231             Difference]: Finished difference. Result has 213 places, 236 transitions, 2724 flow
[2024-06-03 22:48:10,228 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2444, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2724, PETRI_PLACES=213, PETRI_TRANSITIONS=236}
[2024-06-03 22:48:10,228 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 170 predicate places.
[2024-06-03 22:48:10,228 INFO  L495      AbstractCegarLoop]: Abstraction has has 213 places, 236 transitions, 2724 flow
[2024-06-03 22:48:10,229 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:48:10,229 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:48:10,229 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:48:10,229 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-03 22:48:10,229 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:48:10,230 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:48:10,230 INFO  L85        PathProgramCache]: Analyzing trace with hash -1187914929, now seen corresponding path program 7 times
[2024-06-03 22:48:10,230 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:48:10,230 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956601970]
[2024-06-03 22:48:10,230 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:48:10,230 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:48:10,290 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:48:22,259 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:48:22,260 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:48:22,260 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956601970]
[2024-06-03 22:48:22,260 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956601970] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:48:22,260 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:48:22,260 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:48:22,260 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194524392]
[2024-06-03 22:48:22,260 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:48:22,261 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:48:22,261 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:48:22,261 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:48:22,261 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:48:22,518 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:48:22,519 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 236 transitions, 2724 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:48:22,520 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:48:22,520 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:48:22,520 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:48:24,469 INFO  L124   PetriNetUnfolderBase]: 2441/3923 cut-off events.
[2024-06-03 22:48:24,470 INFO  L125   PetriNetUnfolderBase]: For 269305/269305 co-relation queries the response was YES.
[2024-06-03 22:48:24,489 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32425 conditions, 3923 events. 2441/3923 cut-off events. For 269305/269305 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 22821 event pairs, 563 based on Foata normal form. 16/3935 useless extension candidates. Maximal degree in co-relation 32324. Up to 3553 conditions per place. 
[2024-06-03 22:48:24,503 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 219 selfloop transitions, 48 changer transitions 0/272 dead transitions.
[2024-06-03 22:48:24,504 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 272 transitions, 3448 flow
[2024-06-03 22:48:24,506 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:48:24,506 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:48:24,506 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions.
[2024-06-03 22:48:24,506 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45476190476190476
[2024-06-03 22:48:24,506 INFO  L175             Difference]: Start difference. First operand has 213 places, 236 transitions, 2724 flow. Second operand 10 states and 191 transitions.
[2024-06-03 22:48:24,507 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 272 transitions, 3448 flow
[2024-06-03 22:48:24,766 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 272 transitions, 3307 flow, removed 26 selfloop flow, removed 6 redundant places.
[2024-06-03 22:48:24,769 INFO  L231             Difference]: Finished difference. Result has 217 places, 237 transitions, 2742 flow
[2024-06-03 22:48:24,770 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2591, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2742, PETRI_PLACES=217, PETRI_TRANSITIONS=237}
[2024-06-03 22:48:24,770 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 174 predicate places.
[2024-06-03 22:48:24,770 INFO  L495      AbstractCegarLoop]: Abstraction has has 217 places, 237 transitions, 2742 flow
[2024-06-03 22:48:24,770 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:48:24,770 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:48:24,770 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:48:24,770 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-03 22:48:24,771 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:48:24,771 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:48:24,771 INFO  L85        PathProgramCache]: Analyzing trace with hash 744367597, now seen corresponding path program 8 times
[2024-06-03 22:48:24,771 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:48:24,771 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072272568]
[2024-06-03 22:48:24,771 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:48:24,771 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:48:24,841 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:48:36,946 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:48:36,947 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:48:36,947 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072272568]
[2024-06-03 22:48:36,947 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072272568] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:48:36,947 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:48:36,947 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:48:36,947 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311091226]
[2024-06-03 22:48:36,947 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:48:36,948 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:48:36,948 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:48:36,948 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:48:36,948 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:48:37,147 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:48:37,147 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 237 transitions, 2742 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:48:37,148 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:48:37,148 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:48:37,148 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:48:39,179 INFO  L124   PetriNetUnfolderBase]: 2579/4167 cut-off events.
[2024-06-03 22:48:39,179 INFO  L125   PetriNetUnfolderBase]: For 292276/292276 co-relation queries the response was YES.
[2024-06-03 22:48:39,202 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34978 conditions, 4167 events. 2579/4167 cut-off events. For 292276/292276 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 24723 event pairs, 589 based on Foata normal form. 12/4175 useless extension candidates. Maximal degree in co-relation 34875. Up to 3527 conditions per place. 
[2024-06-03 22:48:39,218 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 194 selfloop transitions, 90 changer transitions 0/289 dead transitions.
[2024-06-03 22:48:39,218 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 289 transitions, 3811 flow
[2024-06-03 22:48:39,220 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:48:39,220 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:48:39,221 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 215 transitions.
[2024-06-03 22:48:39,221 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4653679653679654
[2024-06-03 22:48:39,221 INFO  L175             Difference]: Start difference. First operand has 217 places, 237 transitions, 2742 flow. Second operand 11 states and 215 transitions.
[2024-06-03 22:48:39,221 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 289 transitions, 3811 flow
[2024-06-03 22:48:39,512 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 289 transitions, 3696 flow, removed 11 selfloop flow, removed 8 redundant places.
[2024-06-03 22:48:39,515 INFO  L231             Difference]: Finished difference. Result has 220 places, 242 transitions, 2926 flow
[2024-06-03 22:48:39,516 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2627, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2926, PETRI_PLACES=220, PETRI_TRANSITIONS=242}
[2024-06-03 22:48:39,516 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 177 predicate places.
[2024-06-03 22:48:39,516 INFO  L495      AbstractCegarLoop]: Abstraction has has 220 places, 242 transitions, 2926 flow
[2024-06-03 22:48:39,516 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:48:39,516 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:48:39,517 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:48:39,517 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-03 22:48:39,517 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:48:39,517 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:48:39,517 INFO  L85        PathProgramCache]: Analyzing trace with hash -1388996739, now seen corresponding path program 9 times
[2024-06-03 22:48:39,517 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:48:39,517 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379173279]
[2024-06-03 22:48:39,518 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:48:39,518 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:48:39,602 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:48:51,285 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:48:51,286 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:48:51,286 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379173279]
[2024-06-03 22:48:51,286 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379173279] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:48:51,286 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:48:51,286 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:48:51,286 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720102282]
[2024-06-03 22:48:51,286 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:48:51,287 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:48:51,288 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:48:51,288 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:48:51,288 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:48:51,568 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:48:51,568 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 242 transitions, 2926 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:48:51,568 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:48:51,569 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:48:51,569 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:48:53,516 INFO  L124   PetriNetUnfolderBase]: 2620/4238 cut-off events.
[2024-06-03 22:48:53,517 INFO  L125   PetriNetUnfolderBase]: For 303966/303966 co-relation queries the response was YES.
[2024-06-03 22:48:53,536 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35816 conditions, 4238 events. 2620/4238 cut-off events. For 303966/303966 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 25358 event pairs, 599 based on Foata normal form. 12/4246 useless extension candidates. Maximal degree in co-relation 35712. Up to 3674 conditions per place. 
[2024-06-03 22:48:53,550 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 226 selfloop transitions, 50 changer transitions 0/281 dead transitions.
[2024-06-03 22:48:53,551 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 281 transitions, 3700 flow
[2024-06-03 22:48:53,553 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:48:53,553 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:48:53,553 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions.
[2024-06-03 22:48:53,553 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4595238095238095
[2024-06-03 22:48:53,554 INFO  L175             Difference]: Start difference. First operand has 220 places, 242 transitions, 2926 flow. Second operand 10 states and 193 transitions.
[2024-06-03 22:48:53,554 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 281 transitions, 3700 flow
[2024-06-03 22:48:53,848 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 281 transitions, 3611 flow, removed 15 selfloop flow, removed 5 redundant places.
[2024-06-03 22:48:53,852 INFO  L231             Difference]: Finished difference. Result has 225 places, 243 transitions, 2995 flow
[2024-06-03 22:48:53,852 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2837, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2995, PETRI_PLACES=225, PETRI_TRANSITIONS=243}
[2024-06-03 22:48:53,852 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 182 predicate places.
[2024-06-03 22:48:53,852 INFO  L495      AbstractCegarLoop]: Abstraction has has 225 places, 243 transitions, 2995 flow
[2024-06-03 22:48:53,853 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:48:53,853 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:48:53,853 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:48:53,853 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-03 22:48:53,853 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:48:53,853 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:48:53,853 INFO  L85        PathProgramCache]: Analyzing trace with hash 744100687, now seen corresponding path program 10 times
[2024-06-03 22:48:53,854 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:48:53,854 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817232275]
[2024-06-03 22:48:53,854 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:48:53,854 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:48:53,930 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:49:06,353 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:49:06,353 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:49:06,353 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817232275]
[2024-06-03 22:49:06,353 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817232275] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:49:06,354 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:49:06,354 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:49:06,354 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887622350]
[2024-06-03 22:49:06,354 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:49:06,354 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:49:06,354 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:49:06,355 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:49:06,355 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:49:06,665 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:49:06,665 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 243 transitions, 2995 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:49:06,666 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:49:06,666 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:49:06,666 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:49:08,663 INFO  L124   PetriNetUnfolderBase]: 2592/4194 cut-off events.
[2024-06-03 22:49:08,664 INFO  L125   PetriNetUnfolderBase]: For 299172/299172 co-relation queries the response was YES.
[2024-06-03 22:49:08,686 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34845 conditions, 4194 events. 2592/4194 cut-off events. For 299172/299172 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 25035 event pairs, 598 based on Foata normal form. 16/4206 useless extension candidates. Maximal degree in co-relation 34739. Up to 3719 conditions per place. 
[2024-06-03 22:49:08,702 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 197 selfloop transitions, 76 changer transitions 0/278 dead transitions.
[2024-06-03 22:49:08,702 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 278 transitions, 3677 flow
[2024-06-03 22:49:08,705 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:49:08,705 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:49:08,705 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-03 22:49:08,705 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-03 22:49:08,705 INFO  L175             Difference]: Start difference. First operand has 225 places, 243 transitions, 2995 flow. Second operand 10 states and 190 transitions.
[2024-06-03 22:49:08,705 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 278 transitions, 3677 flow
[2024-06-03 22:49:09,082 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 278 transitions, 3539 flow, removed 24 selfloop flow, removed 7 redundant places.
[2024-06-03 22:49:09,085 INFO  L231             Difference]: Finished difference. Result has 228 places, 243 transitions, 3016 flow
[2024-06-03 22:49:09,086 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2857, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3016, PETRI_PLACES=228, PETRI_TRANSITIONS=243}
[2024-06-03 22:49:09,086 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 185 predicate places.
[2024-06-03 22:49:09,086 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 243 transitions, 3016 flow
[2024-06-03 22:49:09,086 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:49:09,087 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:49:09,087 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:49:09,087 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-03 22:49:09,087 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:49:09,087 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:49:09,087 INFO  L85        PathProgramCache]: Analyzing trace with hash -679551335, now seen corresponding path program 11 times
[2024-06-03 22:49:09,087 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:49:09,088 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730142873]
[2024-06-03 22:49:09,088 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:49:09,088 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:49:09,159 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:49:21,469 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:49:21,470 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:49:21,470 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730142873]
[2024-06-03 22:49:21,470 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730142873] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:49:21,470 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:49:21,470 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:49:21,470 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673212198]
[2024-06-03 22:49:21,470 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:49:21,471 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:49:21,471 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:49:21,471 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:49:21,471 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:49:21,625 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:49:21,625 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 243 transitions, 3016 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:49:21,625 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:49:21,625 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:49:21,625 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:49:23,654 INFO  L124   PetriNetUnfolderBase]: 2625/4263 cut-off events.
[2024-06-03 22:49:23,655 INFO  L125   PetriNetUnfolderBase]: For 301998/301998 co-relation queries the response was YES.
[2024-06-03 22:49:23,675 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35113 conditions, 4263 events. 2625/4263 cut-off events. For 301998/301998 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 25693 event pairs, 611 based on Foata normal form. 16/4275 useless extension candidates. Maximal degree in co-relation 35006. Up to 3868 conditions per place. 
[2024-06-03 22:49:23,690 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 224 selfloop transitions, 50 changer transitions 0/279 dead transitions.
[2024-06-03 22:49:23,690 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 279 transitions, 3752 flow
[2024-06-03 22:49:23,692 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:49:23,692 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:49:23,693 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-03 22:49:23,693 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-03 22:49:23,693 INFO  L175             Difference]: Start difference. First operand has 228 places, 243 transitions, 3016 flow. Second operand 10 states and 190 transitions.
[2024-06-03 22:49:23,693 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 279 transitions, 3752 flow
[2024-06-03 22:49:24,019 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 279 transitions, 3587 flow, removed 2 selfloop flow, removed 9 redundant places.
[2024-06-03 22:49:24,023 INFO  L231             Difference]: Finished difference. Result has 229 places, 244 transitions, 3012 flow
[2024-06-03 22:49:24,023 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2851, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3012, PETRI_PLACES=229, PETRI_TRANSITIONS=244}
[2024-06-03 22:49:24,023 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 186 predicate places.
[2024-06-03 22:49:24,023 INFO  L495      AbstractCegarLoop]: Abstraction has has 229 places, 244 transitions, 3012 flow
[2024-06-03 22:49:24,024 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:49:24,024 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:49:24,024 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:49:24,024 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-03 22:49:24,024 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-03 22:49:24,024 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:49:24,024 INFO  L85        PathProgramCache]: Analyzing trace with hash -679543895, now seen corresponding path program 12 times
[2024-06-03 22:49:24,025 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:49:24,025 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907155910]
[2024-06-03 22:49:24,025 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:49:24,025 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:49:24,094 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:49:34,757 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:49:34,758 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:49:34,758 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907155910]
[2024-06-03 22:49:34,758 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907155910] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:49:34,758 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:49:34,758 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:49:34,758 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350911611]
[2024-06-03 22:49:34,759 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:49:34,759 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:49:34,759 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:49:34,759 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:49:34,759 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:49:35,061 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:49:35,062 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 244 transitions, 3012 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:49:35,062 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:49:35,062 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:49:35,062 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:49:37,083 INFO  L124   PetriNetUnfolderBase]: 2605/4231 cut-off events.
[2024-06-03 22:49:37,084 INFO  L125   PetriNetUnfolderBase]: For 291128/291128 co-relation queries the response was YES.
[2024-06-03 22:49:37,103 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34261 conditions, 4231 events. 2605/4231 cut-off events. For 291128/291128 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 25452 event pairs, 582 based on Foata normal form. 12/4239 useless extension candidates. Maximal degree in co-relation 34153. Up to 3624 conditions per place. 
[2024-06-03 22:49:37,117 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 223 selfloop transitions, 61 changer transitions 0/289 dead transitions.
[2024-06-03 22:49:37,117 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 289 transitions, 3772 flow
[2024-06-03 22:49:37,119 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:49:37,119 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:49:37,120 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions.
[2024-06-03 22:49:37,120 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4588744588744589
[2024-06-03 22:49:37,120 INFO  L175             Difference]: Start difference. First operand has 229 places, 244 transitions, 3012 flow. Second operand 11 states and 212 transitions.
[2024-06-03 22:49:37,120 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 289 transitions, 3772 flow
[2024-06-03 22:49:37,485 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 289 transitions, 3599 flow, removed 17 selfloop flow, removed 9 redundant places.
[2024-06-03 22:49:37,489 INFO  L231             Difference]: Finished difference. Result has 231 places, 244 transitions, 2967 flow
[2024-06-03 22:49:37,489 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2839, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2967, PETRI_PLACES=231, PETRI_TRANSITIONS=244}
[2024-06-03 22:49:37,489 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 188 predicate places.
[2024-06-03 22:49:37,490 INFO  L495      AbstractCegarLoop]: Abstraction has has 231 places, 244 transitions, 2967 flow
[2024-06-03 22:49:37,490 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:49:37,490 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:49:37,490 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:49:37,490 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-03 22:49:37,490 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:49:37,491 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:49:37,491 INFO  L85        PathProgramCache]: Analyzing trace with hash 1217491922, now seen corresponding path program 1 times
[2024-06-03 22:49:37,491 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:49:37,493 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224335514]
[2024-06-03 22:49:37,493 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:49:37,493 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:49:37,536 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:49:51,736 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:49:51,737 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:49:51,737 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224335514]
[2024-06-03 22:49:51,737 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224335514] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:49:51,737 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:49:51,737 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:49:51,737 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690015243]
[2024-06-03 22:49:51,737 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:49:51,737 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:49:51,738 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:49:51,739 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:49:51,739 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:49:52,015 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 22:49:52,015 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 244 transitions, 2967 flow. Second operand  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:49:52,015 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:49:52,015 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 22:49:52,016 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:49:53,891 INFO  L124   PetriNetUnfolderBase]: 2524/4160 cut-off events.
[2024-06-03 22:49:53,892 INFO  L125   PetriNetUnfolderBase]: For 291354/291355 co-relation queries the response was YES.
[2024-06-03 22:49:53,912 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33769 conditions, 4160 events. 2524/4160 cut-off events. For 291354/291355 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 25528 event pairs, 554 based on Foata normal form. 4/4162 useless extension candidates. Maximal degree in co-relation 33660. Up to 3818 conditions per place. 
[2024-06-03 22:49:53,928 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 220 selfloop transitions, 43 changer transitions 0/283 dead transitions.
[2024-06-03 22:49:53,929 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 283 transitions, 4087 flow
[2024-06-03 22:49:53,929 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:49:53,929 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:49:53,930 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-03 22:49:53,930 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4656084656084656
[2024-06-03 22:49:53,930 INFO  L175             Difference]: Start difference. First operand has 231 places, 244 transitions, 2967 flow. Second operand 9 states and 176 transitions.
[2024-06-03 22:49:53,930 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 283 transitions, 4087 flow
[2024-06-03 22:49:54,292 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 283 transitions, 3882 flow, removed 14 selfloop flow, removed 9 redundant places.
[2024-06-03 22:49:54,295 INFO  L231             Difference]: Finished difference. Result has 233 places, 256 transitions, 3079 flow
[2024-06-03 22:49:54,296 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2762, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3079, PETRI_PLACES=233, PETRI_TRANSITIONS=256}
[2024-06-03 22:49:54,296 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 190 predicate places.
[2024-06-03 22:49:54,296 INFO  L495      AbstractCegarLoop]: Abstraction has has 233 places, 256 transitions, 3079 flow
[2024-06-03 22:49:54,296 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:49:54,296 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:49:54,296 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:49:54,297 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-03 22:49:54,297 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:49:54,297 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:49:54,297 INFO  L85        PathProgramCache]: Analyzing trace with hash -74889554, now seen corresponding path program 2 times
[2024-06-03 22:49:54,297 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:49:54,297 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354755045]
[2024-06-03 22:49:54,297 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:49:54,298 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:49:54,340 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:50:10,108 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:50:10,109 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:50:10,109 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354755045]
[2024-06-03 22:50:10,109 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354755045] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:50:10,109 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:50:10,109 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:50:10,109 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328627595]
[2024-06-03 22:50:10,109 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:50:10,110 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:50:10,110 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:50:10,110 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:50:10,110 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:50:10,297 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 22:50:10,298 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 256 transitions, 3079 flow. Second operand  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:50:10,298 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:50:10,298 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 22:50:10,298 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:50:12,094 INFO  L124   PetriNetUnfolderBase]: 2533/4177 cut-off events.
[2024-06-03 22:50:12,094 INFO  L125   PetriNetUnfolderBase]: For 298142/298156 co-relation queries the response was YES.
[2024-06-03 22:50:12,118 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33987 conditions, 4177 events. 2533/4177 cut-off events. For 298142/298156 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 25664 event pairs, 551 based on Foata normal form. 2/4177 useless extension candidates. Maximal degree in co-relation 33876. Up to 3863 conditions per place. 
[2024-06-03 22:50:12,137 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 224 selfloop transitions, 38 changer transitions 0/282 dead transitions.
[2024-06-03 22:50:12,137 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 282 transitions, 3945 flow
[2024-06-03 22:50:12,139 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:50:12,139 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:50:12,140 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-03 22:50:12,140 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-03 22:50:12,140 INFO  L175             Difference]: Start difference. First operand has 233 places, 256 transitions, 3079 flow. Second operand 9 states and 171 transitions.
[2024-06-03 22:50:12,140 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 282 transitions, 3945 flow
[2024-06-03 22:50:12,653 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 282 transitions, 3869 flow, removed 29 selfloop flow, removed 3 redundant places.
[2024-06-03 22:50:12,657 INFO  L231             Difference]: Finished difference. Result has 239 places, 259 transitions, 3143 flow
[2024-06-03 22:50:12,657 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3009, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3143, PETRI_PLACES=239, PETRI_TRANSITIONS=259}
[2024-06-03 22:50:12,657 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 196 predicate places.
[2024-06-03 22:50:12,657 INFO  L495      AbstractCegarLoop]: Abstraction has has 239 places, 259 transitions, 3143 flow
[2024-06-03 22:50:12,658 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:50:12,658 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:50:12,658 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:50:12,658 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-03 22:50:12,658 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:50:12,660 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:50:12,660 INFO  L85        PathProgramCache]: Analyzing trace with hash 1221301202, now seen corresponding path program 3 times
[2024-06-03 22:50:12,660 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:50:12,660 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695301383]
[2024-06-03 22:50:12,660 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:50:12,660 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:50:12,705 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:50:27,771 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:50:27,771 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:50:27,771 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695301383]
[2024-06-03 22:50:27,771 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695301383] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:50:27,772 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:50:27,772 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:50:27,772 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527074497]
[2024-06-03 22:50:27,772 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:50:27,772 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:50:27,772 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:50:27,772 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:50:27,772 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:50:28,045 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 22:50:28,046 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 259 transitions, 3143 flow. Second operand  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:50:28,046 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:50:28,046 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 22:50:28,046 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:50:29,928 INFO  L124   PetriNetUnfolderBase]: 2526/4163 cut-off events.
[2024-06-03 22:50:29,929 INFO  L125   PetriNetUnfolderBase]: For 300876/300876 co-relation queries the response was YES.
[2024-06-03 22:50:29,951 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33927 conditions, 4163 events. 2526/4163 cut-off events. For 300876/300876 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 25553 event pairs, 556 based on Foata normal form. 3/4161 useless extension candidates. Maximal degree in co-relation 33815. Up to 3846 conditions per place. 
[2024-06-03 22:50:29,968 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 225 selfloop transitions, 37 changer transitions 0/282 dead transitions.
[2024-06-03 22:50:29,968 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 282 transitions, 3961 flow
[2024-06-03 22:50:29,969 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:50:29,969 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:50:29,969 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions.
[2024-06-03 22:50:29,969 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4931972789115646
[2024-06-03 22:50:29,969 INFO  L175             Difference]: Start difference. First operand has 239 places, 259 transitions, 3143 flow. Second operand 7 states and 145 transitions.
[2024-06-03 22:50:29,969 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 282 transitions, 3961 flow
[2024-06-03 22:50:30,411 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 282 transitions, 3823 flow, removed 32 selfloop flow, removed 7 redundant places.
[2024-06-03 22:50:30,415 INFO  L231             Difference]: Finished difference. Result has 239 places, 259 transitions, 3090 flow
[2024-06-03 22:50:30,415 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3005, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3090, PETRI_PLACES=239, PETRI_TRANSITIONS=259}
[2024-06-03 22:50:30,415 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 196 predicate places.
[2024-06-03 22:50:30,415 INFO  L495      AbstractCegarLoop]: Abstraction has has 239 places, 259 transitions, 3090 flow
[2024-06-03 22:50:30,415 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:50:30,416 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:50:30,416 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:50:30,416 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-03 22:50:30,416 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:50:30,416 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:50:30,416 INFO  L85        PathProgramCache]: Analyzing trace with hash 365985876, now seen corresponding path program 1 times
[2024-06-03 22:50:30,416 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:50:30,417 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942946586]
[2024-06-03 22:50:30,417 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:50:30,417 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:50:30,464 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:50:45,233 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:50:45,233 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:50:45,233 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942946586]
[2024-06-03 22:50:45,233 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942946586] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:50:45,234 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:50:45,234 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:50:45,234 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741616838]
[2024-06-03 22:50:45,234 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:50:45,234 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:50:45,234 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:50:45,235 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:50:45,235 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:50:45,382 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:50:45,382 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 259 transitions, 3090 flow. Second operand  has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:50:45,382 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:50:45,382 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:50:45,382 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:50:47,013 INFO  L124   PetriNetUnfolderBase]: 2625/4268 cut-off events.
[2024-06-03 22:50:47,013 INFO  L125   PetriNetUnfolderBase]: For 303634/303634 co-relation queries the response was YES.
[2024-06-03 22:50:47,038 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34558 conditions, 4268 events. 2625/4268 cut-off events. For 303634/303634 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 25786 event pairs, 592 based on Foata normal form. 1/4267 useless extension candidates. Maximal degree in co-relation 34445. Up to 4087 conditions per place. 
[2024-06-03 22:50:47,056 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 243 selfloop transitions, 22 changer transitions 0/270 dead transitions.
[2024-06-03 22:50:47,056 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 270 transitions, 3650 flow
[2024-06-03 22:50:47,057 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 22:50:47,057 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 22:50:47,057 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions.
[2024-06-03 22:50:47,057 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48095238095238096
[2024-06-03 22:50:47,058 INFO  L175             Difference]: Start difference. First operand has 239 places, 259 transitions, 3090 flow. Second operand 5 states and 101 transitions.
[2024-06-03 22:50:47,058 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 270 transitions, 3650 flow
[2024-06-03 22:50:47,508 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 270 transitions, 3542 flow, removed 15 selfloop flow, removed 6 redundant places.
[2024-06-03 22:50:47,511 INFO  L231             Difference]: Finished difference. Result has 238 places, 259 transitions, 3042 flow
[2024-06-03 22:50:47,511 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2982, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3042, PETRI_PLACES=238, PETRI_TRANSITIONS=259}
[2024-06-03 22:50:47,512 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 195 predicate places.
[2024-06-03 22:50:47,512 INFO  L495      AbstractCegarLoop]: Abstraction has has 238 places, 259 transitions, 3042 flow
[2024-06-03 22:50:47,512 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:50:47,512 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:50:47,512 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:50:47,512 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-03 22:50:47,513 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-03 22:50:47,513 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:50:47,513 INFO  L85        PathProgramCache]: Analyzing trace with hash 1854388735, now seen corresponding path program 1 times
[2024-06-03 22:50:47,513 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:50:47,513 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950685193]
[2024-06-03 22:50:47,513 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:50:47,513 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:50:47,571 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:50:59,290 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:50:59,290 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:50:59,290 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950685193]
[2024-06-03 22:50:59,290 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950685193] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:50:59,291 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:50:59,291 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:50:59,291 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083949003]
[2024-06-03 22:50:59,291 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:50:59,291 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:50:59,291 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:50:59,292 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:50:59,292 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:50:59,516 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:50:59,517 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 259 transitions, 3042 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:50:59,517 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:50:59,517 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:50:59,517 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:51:01,620 INFO  L124   PetriNetUnfolderBase]: 2642/4291 cut-off events.
[2024-06-03 22:51:01,620 INFO  L125   PetriNetUnfolderBase]: For 317377/317377 co-relation queries the response was YES.
[2024-06-03 22:51:01,643 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34873 conditions, 4291 events. 2642/4291 cut-off events. For 317377/317377 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 25804 event pairs, 445 based on Foata normal form. 4/4293 useless extension candidates. Maximal degree in co-relation 34759. Up to 4019 conditions per place. 
[2024-06-03 22:51:01,661 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 276 selfloop transitions, 20 changer transitions 0/301 dead transitions.
[2024-06-03 22:51:01,661 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 301 transitions, 3814 flow
[2024-06-03 22:51:01,663 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:51:01,664 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:51:01,664 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions.
[2024-06-03 22:51:01,664 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4452380952380952
[2024-06-03 22:51:01,664 INFO  L175             Difference]: Start difference. First operand has 238 places, 259 transitions, 3042 flow. Second operand 10 states and 187 transitions.
[2024-06-03 22:51:01,664 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 301 transitions, 3814 flow
[2024-06-03 22:51:02,024 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 301 transitions, 3770 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-06-03 22:51:02,027 INFO  L231             Difference]: Finished difference. Result has 244 places, 261 transitions, 3125 flow
[2024-06-03 22:51:02,028 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2998, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3125, PETRI_PLACES=244, PETRI_TRANSITIONS=261}
[2024-06-03 22:51:02,028 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 201 predicate places.
[2024-06-03 22:51:02,028 INFO  L495      AbstractCegarLoop]: Abstraction has has 244 places, 261 transitions, 3125 flow
[2024-06-03 22:51:02,029 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:51:02,029 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:51:02,029 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:51:02,029 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-03 22:51:02,029 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-03 22:51:02,029 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:51:02,030 INFO  L85        PathProgramCache]: Analyzing trace with hash -2038984211, now seen corresponding path program 2 times
[2024-06-03 22:51:02,030 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:51:02,030 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467349111]
[2024-06-03 22:51:02,030 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:51:02,030 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:51:02,100 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:51:13,647 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:51:13,648 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:51:13,648 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467349111]
[2024-06-03 22:51:13,648 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467349111] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:51:13,648 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:51:13,648 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:51:13,648 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280711279]
[2024-06-03 22:51:13,648 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:51:13,648 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:51:13,648 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:51:13,649 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:51:13,649 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:51:14,060 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:51:14,060 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 261 transitions, 3125 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:51:14,060 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:51:14,060 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:51:14,060 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:51:16,130 INFO  L124   PetriNetUnfolderBase]: 2683/4362 cut-off events.
[2024-06-03 22:51:16,131 INFO  L125   PetriNetUnfolderBase]: For 341565/341565 co-relation queries the response was YES.
[2024-06-03 22:51:16,154 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35843 conditions, 4362 events. 2683/4362 cut-off events. For 341565/341565 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 26430 event pairs, 562 based on Foata normal form. 12/4372 useless extension candidates. Maximal degree in co-relation 35728. Up to 4084 conditions per place. 
[2024-06-03 22:51:16,168 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 276 selfloop transitions, 21 changer transitions 0/302 dead transitions.
[2024-06-03 22:51:16,169 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 302 transitions, 3893 flow
[2024-06-03 22:51:16,171 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:51:16,171 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:51:16,171 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-03 22:51:16,171 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44761904761904764
[2024-06-03 22:51:16,171 INFO  L175             Difference]: Start difference. First operand has 244 places, 261 transitions, 3125 flow. Second operand 10 states and 188 transitions.
[2024-06-03 22:51:16,172 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 302 transitions, 3893 flow
[2024-06-03 22:51:16,648 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 302 transitions, 3784 flow, removed 36 selfloop flow, removed 8 redundant places.
[2024-06-03 22:51:16,651 INFO  L231             Difference]: Finished difference. Result has 246 places, 262 transitions, 3114 flow
[2024-06-03 22:51:16,651 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3016, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3114, PETRI_PLACES=246, PETRI_TRANSITIONS=262}
[2024-06-03 22:51:16,652 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 203 predicate places.
[2024-06-03 22:51:16,652 INFO  L495      AbstractCegarLoop]: Abstraction has has 246 places, 262 transitions, 3114 flow
[2024-06-03 22:51:16,652 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:51:16,652 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:51:16,652 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:51:16,652 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-03 22:51:16,653 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:51:16,653 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:51:16,653 INFO  L85        PathProgramCache]: Analyzing trace with hash -1141425061, now seen corresponding path program 3 times
[2024-06-03 22:51:16,653 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:51:16,653 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253376453]
[2024-06-03 22:51:16,653 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:51:16,653 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:51:16,706 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15