./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_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/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.yml/witness.yml --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version cde23df1
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m
[2024-06-14 15:48:08,985 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-14 15:48:09,050 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-14 15:48:09,056 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-14 15:48:09,057 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-14 15:48:09,080 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-14 15:48:09,080 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-14 15:48:09,081 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-14 15:48:09,081 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-14 15:48:09,088 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-14 15:48:09,088 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-14 15:48:09,088 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-14 15:48:09,089 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-14 15:48:09,089 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-14 15:48:09,089 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-14 15:48:09,089 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-14 15:48:09,089 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-14 15:48:09,089 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-14 15:48:09,090 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-14 15:48:09,090 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-14 15:48:09,090 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-14 15:48:09,090 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-14 15:48:09,090 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-14 15:48:09,090 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-14 15:48:09,091 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-14 15:48:09,091 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-14 15:48:09,091 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-14 15:48:09,091 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-14 15:48:09,091 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-14 15:48:09,092 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-14 15:48:09,092 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-14 15:48:09,092 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-14 15:48:09,093 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 15:48:09,093 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-14 15:48:09,093 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-14 15:48:09,093 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-14 15:48:09,093 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-14 15:48:09,093 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-14 15:48:09,093 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-14 15:48:09,093 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-14 15:48:09,094 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-14 15:48:09,094 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-14 15:48:09,094 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-14 15:48:09,094 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-14 15:48:09,308 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-14 15:48:09,329 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-14 15:48:09,331 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-14 15:48:09,331 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-14 15:48:09,332 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-14 15:48:09,333 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i
[2024-06-14 15:48:10,418 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-14 15:48:10,599 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-14 15:48:10,599 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i
[2024-06-14 15:48:10,611 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84d4c1b72/66fd1f4b65b742bebedae3d3bcb77227/FLAG5d41ff932
[2024-06-14 15:48:10,620 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84d4c1b72/66fd1f4b65b742bebedae3d3bcb77227
[2024-06-14 15:48:10,623 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-14 15:48:10,623 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-14 15:48:10,623 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/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.yml/witness.yml
[2024-06-14 15:48:10,807 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-14 15:48:10,810 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-14 15:48:10,811 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-14 15:48:10,812 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-14 15:48:10,815 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-14 15:48:10,815 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:48:10" (1/2) ...
[2024-06-14 15:48:10,817 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cf75fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:48:10, skipping insertion in model container
[2024-06-14 15:48:10,817 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:48:10" (1/2) ...
[2024-06-14 15:48:10,818 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@194579aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:48:10, skipping insertion in model container
[2024-06-14 15:48:10,818 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:48:10" (2/2) ...
[2024-06-14 15:48:10,818 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cf75fa9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:48:10, skipping insertion in model container
[2024-06-14 15:48:10,819 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:48:10" (2/2) ...
[2024-06-14 15:48:10,819 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-14 15:48:10,895 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-14 15:48:10,896 INFO  L97    edCorrectnessWitness]: Location invariant before [L835-L835] ((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (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_p0_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (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 )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_p0_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 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_EBX == 0 || __unbuffered_p0_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)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p0_EAX && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)
[2024-06-14 15:48:10,897 INFO  L97    edCorrectnessWitness]: Location invariant before [L832-L832] ((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (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_p0_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (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 )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_p0_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 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_EBX == 0 || __unbuffered_p0_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)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p0_EAX && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)
[2024-06-14 15:48:10,897 INFO  L97    edCorrectnessWitness]: Location invariant before [L834-L834] ((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (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_p0_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (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 )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_p0_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 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_EBX == 0 || __unbuffered_p0_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)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p0_EAX && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)
[2024-06-14 15:48:10,898 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-14 15:48:10,898 INFO  L106   edCorrectnessWitness]: ghost_update [L830-L830] multithreaded = 1;
[2024-06-14 15:48:10,938 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-14 15:48:11,248 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 15:48:11,255 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-14 15:48:11,591 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 15:48:11,622 INFO  L206         MainTranslator]: Completed translation
[2024-06-14 15:48:11,622 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:48:11 WrapperNode
[2024-06-14 15:48:11,622 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-14 15:48:11,623 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-14 15:48:11,624 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-14 15:48:11,624 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-14 15:48:11,629 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 14.06 03:48:11" (1/1) ...
[2024-06-14 15:48:11,668 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 14.06 03:48:11" (1/1) ...
[2024-06-14 15:48:11,757 INFO  L138                Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 125
[2024-06-14 15:48:11,758 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-14 15:48:11,759 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-14 15:48:11,759 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-14 15:48:11,759 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-14 15:48:11,767 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:48:11" (1/1) ...
[2024-06-14 15:48:11,768 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:48:11" (1/1) ...
[2024-06-14 15:48:11,792 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:48:11" (1/1) ...
[2024-06-14 15:48:11,845 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-14 15:48:11,846 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:48:11" (1/1) ...
[2024-06-14 15:48:11,846 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:48:11" (1/1) ...
[2024-06-14 15:48:11,884 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:48:11" (1/1) ...
[2024-06-14 15:48:11,886 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:48:11" (1/1) ...
[2024-06-14 15:48:11,897 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:48:11" (1/1) ...
[2024-06-14 15:48:11,902 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:48:11" (1/1) ...
[2024-06-14 15:48:11,933 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-14 15:48:11,934 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-14 15:48:11,935 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-14 15:48:11,935 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-14 15:48:11,936 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:48:11" (1/1) ...
[2024-06-14 15:48:11,940 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 15:48:12,001 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-14 15:48:12,013 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-14 15:48:12,032 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-14 15:48:12,044 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-14 15:48:12,044 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-14 15:48:12,044 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-14 15:48:12,045 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-14 15:48:12,045 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-14 15:48:12,045 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-14 15:48:12,045 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-14 15:48:12,045 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-14 15:48:12,046 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-14 15:48:12,046 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-14 15:48:12,046 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-14 15:48:12,046 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-14 15:48:12,047 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-14 15:48:12,138 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-14 15:48:12,139 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-14 15:48:13,148 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-14 15:48:13,150 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-14 15:48:13,441 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-14 15:48:13,441 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-14 15:48:13,442 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:48:13 BoogieIcfgContainer
[2024-06-14 15:48:13,442 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-14 15:48:13,444 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-14 15:48:13,444 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-14 15:48:13,446 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-14 15:48:13,446 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:48:10" (1/4) ...
[2024-06-14 15:48:13,447 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636eff37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:48:13, skipping insertion in model container
[2024-06-14 15:48:13,448 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:48:10" (2/4) ...
[2024-06-14 15:48:13,448 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636eff37 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:48:13, skipping insertion in model container
[2024-06-14 15:48:13,448 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:48:11" (3/4) ...
[2024-06-14 15:48:13,449 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636eff37 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:48:13, skipping insertion in model container
[2024-06-14 15:48:13,449 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:48:13" (4/4) ...
[2024-06-14 15:48:13,450 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i
[2024-06-14 15:48:13,463 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-14 15:48:13,463 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-14 15:48:13,463 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-14 15:48:13,575 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-14 15:48:13,604 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow
[2024-06-14 15:48:13,667 INFO  L124   PetriNetUnfolderBase]: 0/38 cut-off events.
[2024-06-14 15:48:13,667 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 15:48:13,670 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-14 15:48:13,670 INFO  L82        GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow
[2024-06-14 15:48:13,699 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow
[2024-06-14 15:48:13,710 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-14 15:48:13,719 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;@1da27fb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-14 15:48:13,719 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-14 15:48:13,726 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-14 15:48:13,726 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-14 15:48:13,726 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 15:48:13,726 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:48:13,727 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-14 15:48:13,727 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:48:13,731 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:48:13,732 INFO  L85        PathProgramCache]: Analyzing trace with hash -1673015535, now seen corresponding path program 1 times
[2024-06-14 15:48:13,743 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:48:13,744 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175329094]
[2024-06-14 15:48:13,744 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:48:13,744 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:48:14,055 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:48:18,783 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:48:18,784 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:48:18,784 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175329094]
[2024-06-14 15:48:18,784 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175329094] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:48:18,785 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:48:18,785 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-14 15:48:18,786 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51190357]
[2024-06-14 15:48:18,787 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:48:18,793 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-14 15:48:18,796 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:48:18,819 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-14 15:48:18,820 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-14 15:48:18,884 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41
[2024-06-14 15:48:18,886 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:18,887 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:48:18,887 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41
[2024-06-14 15:48:18,887 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:48:19,632 INFO  L124   PetriNetUnfolderBase]: 897/1382 cut-off events.
[2024-06-14 15:48:19,633 INFO  L125   PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES.
[2024-06-14 15:48:19,639 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2814 conditions, 1382 events. 897/1382 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6459 event pairs, 581 based on Foata normal form. 1/1353 useless extension candidates. Maximal degree in co-relation 2799. Up to 1359 conditions per place. 
[2024-06-14 15:48:19,648 INFO  L140   encePairwiseOnDemand]: 34/41 looper letters, 32 selfloop transitions, 4 changer transitions 0/42 dead transitions.
[2024-06-14 15:48:19,648 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 171 flow
[2024-06-14 15:48:19,649 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-14 15:48:19,651 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-14 15:48:19,657 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions.
[2024-06-14 15:48:19,658 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6097560975609756
[2024-06-14 15:48:19,660 INFO  L175             Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 75 transitions.
[2024-06-14 15:48:19,660 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 171 flow
[2024-06-14 15:48:19,662 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-14 15:48:19,665 INFO  L231             Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow
[2024-06-14 15:48:19,666 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=35}
[2024-06-14 15:48:19,669 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places.
[2024-06-14 15:48:19,669 INFO  L495      AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow
[2024-06-14 15:48:19,670 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:19,670 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:48:19,670 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:48:19,670 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-14 15:48:19,670 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:48:19,671 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:48:19,671 INFO  L85        PathProgramCache]: Analyzing trace with hash -2003934996, now seen corresponding path program 1 times
[2024-06-14 15:48:19,672 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:48:19,672 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449115467]
[2024-06-14 15:48:19,672 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:48:19,672 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:48:19,786 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:48:24,422 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:48:24,423 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:48:24,423 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449115467]
[2024-06-14 15:48:24,424 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449115467] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:48:24,424 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:48:24,424 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-14 15:48:24,424 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586469115]
[2024-06-14 15:48:24,424 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:48:24,426 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-14 15:48:24,426 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:48:24,426 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-14 15:48:24,427 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-14 15:48:24,527 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-14 15:48:24,527 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand  has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:24,527 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:48:24,527 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-14 15:48:24,527 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:48:25,287 INFO  L124   PetriNetUnfolderBase]: 1140/1737 cut-off events.
[2024-06-14 15:48:25,287 INFO  L125   PetriNetUnfolderBase]: For 354/367 co-relation queries the response was YES.
[2024-06-14 15:48:25,290 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4027 conditions, 1737 events. 1140/1737 cut-off events. For 354/367 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8058 event pairs, 549 based on Foata normal form. 7/1736 useless extension candidates. Maximal degree in co-relation 4012. Up to 1684 conditions per place. 
[2024-06-14 15:48:25,298 INFO  L140   encePairwiseOnDemand]: 34/41 looper letters, 35 selfloop transitions, 6 changer transitions 0/46 dead transitions.
[2024-06-14 15:48:25,298 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 46 transitions, 212 flow
[2024-06-14 15:48:25,299 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-14 15:48:25,299 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-14 15:48:25,301 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions.
[2024-06-14 15:48:25,301 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6097560975609756
[2024-06-14 15:48:25,301 INFO  L175             Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 3 states and 75 transitions.
[2024-06-14 15:48:25,301 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 46 transitions, 212 flow
[2024-06-14 15:48:25,302 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-14 15:48:25,304 INFO  L231             Difference]: Finished difference. Result has 44 places, 38 transitions, 136 flow
[2024-06-14 15:48:25,304 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=44, PETRI_TRANSITIONS=38}
[2024-06-14 15:48:25,305 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places.
[2024-06-14 15:48:25,305 INFO  L495      AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 136 flow
[2024-06-14 15:48:25,305 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:25,306 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:48:25,306 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:48:25,308 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-14 15:48:25,308 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:48:25,309 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:48:25,309 INFO  L85        PathProgramCache]: Analyzing trace with hash -1194629431, now seen corresponding path program 1 times
[2024-06-14 15:48:25,310 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:48:25,314 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270401584]
[2024-06-14 15:48:25,314 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:48:25,315 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:48:25,415 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:48:29,975 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:48:29,976 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:48:29,976 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270401584]
[2024-06-14 15:48:29,976 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270401584] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:48:29,977 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:48:29,977 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 15:48:29,977 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942936605]
[2024-06-14 15:48:29,977 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:48:29,977 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 15:48:29,978 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:48:29,978 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 15:48:29,978 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-14 15:48:30,126 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-14 15:48:30,127 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 136 flow. Second operand  has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:30,127 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:48:30,127 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-14 15:48:30,127 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:48:30,959 INFO  L124   PetriNetUnfolderBase]: 1131/1722 cut-off events.
[2024-06-14 15:48:30,959 INFO  L125   PetriNetUnfolderBase]: For 961/990 co-relation queries the response was YES.
[2024-06-14 15:48:30,962 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4449 conditions, 1722 events. 1131/1722 cut-off events. For 961/990 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7932 event pairs, 409 based on Foata normal form. 17/1732 useless extension candidates. Maximal degree in co-relation 4432. Up to 1639 conditions per place. 
[2024-06-14 15:48:30,969 INFO  L140   encePairwiseOnDemand]: 34/41 looper letters, 39 selfloop transitions, 8 changer transitions 0/52 dead transitions.
[2024-06-14 15:48:30,969 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 52 transitions, 268 flow
[2024-06-14 15:48:30,971 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-14 15:48:30,971 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-14 15:48:30,973 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions.
[2024-06-14 15:48:30,974 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5609756097560976
[2024-06-14 15:48:30,974 INFO  L175             Difference]: Start difference. First operand has 44 places, 38 transitions, 136 flow. Second operand 4 states and 92 transitions.
[2024-06-14 15:48:30,974 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 52 transitions, 268 flow
[2024-06-14 15:48:30,976 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-14 15:48:30,977 INFO  L231             Difference]: Finished difference. Result has 46 places, 39 transitions, 163 flow
[2024-06-14 15:48:30,977 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=46, PETRI_TRANSITIONS=39}
[2024-06-14 15:48:30,978 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places.
[2024-06-14 15:48:30,978 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 163 flow
[2024-06-14 15:48:30,978 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:30,978 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:48:30,978 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:48:30,979 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-14 15:48:30,979 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:48:30,979 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:48:30,980 INFO  L85        PathProgramCache]: Analyzing trace with hash 1730547152, now seen corresponding path program 1 times
[2024-06-14 15:48:30,980 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:48:30,980 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417406818]
[2024-06-14 15:48:30,980 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:48:30,980 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:48:31,057 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:48:37,708 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:48:37,709 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:48:37,711 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417406818]
[2024-06-14 15:48:37,712 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417406818] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:48:37,712 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:48:37,712 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 15:48:37,713 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523481860]
[2024-06-14 15:48:37,713 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:48:37,713 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 15:48:37,714 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:48:37,715 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 15:48:37,715 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-14 15:48:37,863 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-14 15:48:37,863 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 163 flow. Second operand  has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:37,863 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:48:37,863 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-14 15:48:37,864 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:48:38,449 INFO  L124   PetriNetUnfolderBase]: 888/1372 cut-off events.
[2024-06-14 15:48:38,450 INFO  L125   PetriNetUnfolderBase]: For 1358/1364 co-relation queries the response was YES.
[2024-06-14 15:48:38,452 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3863 conditions, 1372 events. 888/1372 cut-off events. For 1358/1364 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6391 event pairs, 408 based on Foata normal form. 8/1376 useless extension candidates. Maximal degree in co-relation 3844. Up to 1326 conditions per place. 
[2024-06-14 15:48:38,457 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 40 selfloop transitions, 8 changer transitions 0/54 dead transitions.
[2024-06-14 15:48:38,457 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 54 transitions, 305 flow
[2024-06-14 15:48:38,457 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 15:48:38,457 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 15:48:38,460 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions.
[2024-06-14 15:48:38,460 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4878048780487805
[2024-06-14 15:48:38,460 INFO  L175             Difference]: Start difference. First operand has 46 places, 39 transitions, 163 flow. Second operand 5 states and 100 transitions.
[2024-06-14 15:48:38,461 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 54 transitions, 305 flow
[2024-06-14 15:48:38,463 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 284 flow, removed 4 selfloop flow, removed 2 redundant places.
[2024-06-14 15:48:38,465 INFO  L231             Difference]: Finished difference. Result has 49 places, 42 transitions, 186 flow
[2024-06-14 15:48:38,465 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=49, PETRI_TRANSITIONS=42}
[2024-06-14 15:48:38,466 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places.
[2024-06-14 15:48:38,466 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 186 flow
[2024-06-14 15:48:38,466 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:38,466 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:48:38,467 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:48:38,467 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-14 15:48:38,467 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:48:38,467 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:48:38,467 INFO  L85        PathProgramCache]: Analyzing trace with hash 2107355392, now seen corresponding path program 1 times
[2024-06-14 15:48:38,468 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:48:38,468 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151700239]
[2024-06-14 15:48:38,468 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:48:38,468 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:48:38,503 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:48:44,964 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:48:44,964 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:48:44,964 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151700239]
[2024-06-14 15:48:44,964 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151700239] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:48:44,965 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:48:44,965 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:48:44,965 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774757316]
[2024-06-14 15:48:44,965 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:48:44,965 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:48:44,966 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:48:44,966 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:48:44,966 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:48:45,046 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:48:45,046 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 186 flow. Second operand  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:45,046 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:48:45,046 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:48:45,047 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:48:45,899 INFO  L124   PetriNetUnfolderBase]: 1319/1997 cut-off events.
[2024-06-14 15:48:45,899 INFO  L125   PetriNetUnfolderBase]: For 2846/2846 co-relation queries the response was YES.
[2024-06-14 15:48:45,903 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5943 conditions, 1997 events. 1319/1997 cut-off events. For 2846/2846 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9322 event pairs, 564 based on Foata normal form. 2/1996 useless extension candidates. Maximal degree in co-relation 5922. Up to 1953 conditions per place. 
[2024-06-14 15:48:45,910 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 51 selfloop transitions, 11 changer transitions 0/66 dead transitions.
[2024-06-14 15:48:45,911 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 66 transitions, 376 flow
[2024-06-14 15:48:45,911 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:48:45,911 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:48:45,912 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions.
[2024-06-14 15:48:45,913 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4349593495934959
[2024-06-14 15:48:45,913 INFO  L175             Difference]: Start difference. First operand has 49 places, 42 transitions, 186 flow. Second operand 6 states and 107 transitions.
[2024-06-14 15:48:45,913 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 66 transitions, 376 flow
[2024-06-14 15:48:45,919 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 356 flow, removed 3 selfloop flow, removed 3 redundant places.
[2024-06-14 15:48:45,920 INFO  L231             Difference]: Finished difference. Result has 54 places, 51 transitions, 242 flow
[2024-06-14 15:48:45,920 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=242, PETRI_PLACES=54, PETRI_TRANSITIONS=51}
[2024-06-14 15:48:45,922 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places.
[2024-06-14 15:48:45,922 INFO  L495      AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 242 flow
[2024-06-14 15:48:45,923 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:45,923 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:48:45,923 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:48:45,923 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-14 15:48:45,923 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:48:45,924 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:48:45,924 INFO  L85        PathProgramCache]: Analyzing trace with hash 903508975, now seen corresponding path program 1 times
[2024-06-14 15:48:45,924 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:48:45,924 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225647600]
[2024-06-14 15:48:45,924 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:48:45,924 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:48:45,959 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:48:53,585 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:48:53,585 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:48:53,586 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225647600]
[2024-06-14 15:48:53,586 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225647600] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:48:53,586 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:48:53,586 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:48:53,586 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328523490]
[2024-06-14 15:48:53,586 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:48:53,586 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:48:53,587 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:48:53,587 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:48:53,587 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:48:53,739 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:48:53,739 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 242 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:53,739 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:48:53,739 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:48:53,739 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:48:54,597 INFO  L124   PetriNetUnfolderBase]: 1314/1990 cut-off events.
[2024-06-14 15:48:54,598 INFO  L125   PetriNetUnfolderBase]: For 3778/3778 co-relation queries the response was YES.
[2024-06-14 15:48:54,601 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6432 conditions, 1990 events. 1314/1990 cut-off events. For 3778/3778 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9256 event pairs, 546 based on Foata normal form. 2/1989 useless extension candidates. Maximal degree in co-relation 6408. Up to 1937 conditions per place. 
[2024-06-14 15:48:54,608 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 55 selfloop transitions, 14 changer transitions 0/73 dead transitions.
[2024-06-14 15:48:54,609 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 73 transitions, 438 flow
[2024-06-14 15:48:54,609 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:48:54,609 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:48:54,610 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions.
[2024-06-14 15:48:54,610 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-14 15:48:54,610 INFO  L175             Difference]: Start difference. First operand has 54 places, 51 transitions, 242 flow. Second operand 7 states and 123 transitions.
[2024-06-14 15:48:54,610 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 73 transitions, 438 flow
[2024-06-14 15:48:54,613 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 73 transitions, 436 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-14 15:48:54,614 INFO  L231             Difference]: Finished difference. Result has 60 places, 54 transitions, 292 flow
[2024-06-14 15:48:54,614 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=292, PETRI_PLACES=60, PETRI_TRANSITIONS=54}
[2024-06-14 15:48:54,616 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places.
[2024-06-14 15:48:54,616 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 292 flow
[2024-06-14 15:48:54,616 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:48:54,617 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:48:54,617 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:48:54,617 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-14 15:48:54,617 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:48:54,617 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:48:54,618 INFO  L85        PathProgramCache]: Analyzing trace with hash 2061477989, now seen corresponding path program 1 times
[2024-06-14 15:48:54,618 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:48:54,621 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713106367]
[2024-06-14 15:48:54,621 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:48:54,621 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:48:54,671 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:49:02,241 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:49:02,241 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:49:02,241 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713106367]
[2024-06-14 15:49:02,241 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713106367] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:49:02,242 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:49:02,242 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:49:02,242 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751980993]
[2024-06-14 15:49:02,242 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:49:02,242 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:49:02,242 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:49:02,242 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:49:02,242 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:49:02,416 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-14 15:49:02,416 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 292 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:02,416 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:49:02,416 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-14 15:49:02,416 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:49:03,211 INFO  L124   PetriNetUnfolderBase]: 1272/1945 cut-off events.
[2024-06-14 15:49:03,211 INFO  L125   PetriNetUnfolderBase]: For 5675/5714 co-relation queries the response was YES.
[2024-06-14 15:49:03,216 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6895 conditions, 1945 events. 1272/1945 cut-off events. For 5675/5714 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9183 event pairs, 484 based on Foata normal form. 20/1921 useless extension candidates. Maximal degree in co-relation 6868. Up to 1790 conditions per place. 
[2024-06-14 15:49:03,224 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 47 selfloop transitions, 15 changer transitions 0/71 dead transitions.
[2024-06-14 15:49:03,224 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 71 transitions, 480 flow
[2024-06-14 15:49:03,226 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 15:49:03,226 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 15:49:03,227 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions.
[2024-06-14 15:49:03,227 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48292682926829267
[2024-06-14 15:49:03,227 INFO  L175             Difference]: Start difference. First operand has 60 places, 54 transitions, 292 flow. Second operand 5 states and 99 transitions.
[2024-06-14 15:49:03,227 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 71 transitions, 480 flow
[2024-06-14 15:49:03,229 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 71 transitions, 452 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-06-14 15:49:03,230 INFO  L231             Difference]: Finished difference. Result has 60 places, 57 transitions, 334 flow
[2024-06-14 15:49:03,231 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=334, PETRI_PLACES=60, PETRI_TRANSITIONS=57}
[2024-06-14 15:49:03,231 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places.
[2024-06-14 15:49:03,231 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 57 transitions, 334 flow
[2024-06-14 15:49:03,231 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:03,231 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:49:03,232 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:49:03,232 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-14 15:49:03,232 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:49:03,232 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:49:03,232 INFO  L85        PathProgramCache]: Analyzing trace with hash -1651070143, now seen corresponding path program 1 times
[2024-06-14 15:49:03,232 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:49:03,232 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605061196]
[2024-06-14 15:49:03,233 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:49:03,233 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:49:03,264 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:49:09,756 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:49:09,756 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:49:09,756 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605061196]
[2024-06-14 15:49:09,756 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605061196] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:49:09,756 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:49:09,756 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:49:09,756 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305622739]
[2024-06-14 15:49:09,756 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:49:09,757 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:49:09,757 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:49:09,757 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:49:09,757 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:49:09,947 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:49:09,948 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 57 transitions, 334 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:09,948 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:49:09,948 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:49:09,948 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:49:10,915 INFO  L124   PetriNetUnfolderBase]: 1526/2299 cut-off events.
[2024-06-14 15:49:10,928 INFO  L125   PetriNetUnfolderBase]: For 7285/7288 co-relation queries the response was YES.
[2024-06-14 15:49:10,936 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8567 conditions, 2299 events. 1526/2299 cut-off events. For 7285/7288 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10779 event pairs, 522 based on Foata normal form. 15/2309 useless extension candidates. Maximal degree in co-relation 8539. Up to 2041 conditions per place. 
[2024-06-14 15:49:10,956 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 66 selfloop transitions, 30 changer transitions 0/100 dead transitions.
[2024-06-14 15:49:10,957 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 100 transitions, 737 flow
[2024-06-14 15:49:10,957 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:49:10,957 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:49:10,958 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions.
[2024-06-14 15:49:10,958 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4738675958188153
[2024-06-14 15:49:10,958 INFO  L175             Difference]: Start difference. First operand has 60 places, 57 transitions, 334 flow. Second operand 7 states and 136 transitions.
[2024-06-14 15:49:10,958 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 100 transitions, 737 flow
[2024-06-14 15:49:10,963 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 100 transitions, 686 flow, removed 14 selfloop flow, removed 3 redundant places.
[2024-06-14 15:49:10,967 INFO  L231             Difference]: Finished difference. Result has 66 places, 76 transitions, 524 flow
[2024-06-14 15:49:10,967 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=524, PETRI_PLACES=66, PETRI_TRANSITIONS=76}
[2024-06-14 15:49:10,968 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places.
[2024-06-14 15:49:10,969 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 76 transitions, 524 flow
[2024-06-14 15:49:10,969 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:10,969 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:49:10,969 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:49:10,969 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-14 15:49:10,969 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:49:10,970 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:49:10,970 INFO  L85        PathProgramCache]: Analyzing trace with hash -2056237631, now seen corresponding path program 2 times
[2024-06-14 15:49:10,970 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:49:10,970 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740231695]
[2024-06-14 15:49:10,970 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:49:10,970 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:49:11,003 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:49:17,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-14 15:49:17,766 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:49:17,766 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740231695]
[2024-06-14 15:49:17,766 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740231695] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:49:17,766 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:49:17,766 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:49:17,766 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329328357]
[2024-06-14 15:49:17,766 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:49:17,766 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:49:17,766 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:49:17,767 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:49:17,767 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:49:17,923 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:49:17,923 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 76 transitions, 524 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:17,924 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:49:17,924 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:49:17,924 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:49:18,908 INFO  L124   PetriNetUnfolderBase]: 1783/2659 cut-off events.
[2024-06-14 15:49:18,909 INFO  L125   PetriNetUnfolderBase]: For 9720/9723 co-relation queries the response was YES.
[2024-06-14 15:49:18,915 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11206 conditions, 2659 events. 1783/2659 cut-off events. For 9720/9723 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12411 event pairs, 548 based on Foata normal form. 15/2669 useless extension candidates. Maximal degree in co-relation 11175. Up to 2239 conditions per place. 
[2024-06-14 15:49:18,925 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 80 selfloop transitions, 37 changer transitions 0/121 dead transitions.
[2024-06-14 15:49:18,925 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 121 transitions, 1018 flow
[2024-06-14 15:49:18,925 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:49:18,925 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:49:18,926 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions.
[2024-06-14 15:49:18,926 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47038327526132406
[2024-06-14 15:49:18,926 INFO  L175             Difference]: Start difference. First operand has 66 places, 76 transitions, 524 flow. Second operand 7 states and 135 transitions.
[2024-06-14 15:49:18,926 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 121 transitions, 1018 flow
[2024-06-14 15:49:18,934 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 121 transitions, 987 flow, removed 12 selfloop flow, removed 2 redundant places.
[2024-06-14 15:49:18,936 INFO  L231             Difference]: Finished difference. Result has 72 places, 95 transitions, 777 flow
[2024-06-14 15:49:18,936 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=777, PETRI_PLACES=72, PETRI_TRANSITIONS=95}
[2024-06-14 15:49:18,937 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places.
[2024-06-14 15:49:18,937 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 95 transitions, 777 flow
[2024-06-14 15:49:18,937 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:18,937 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:49:18,937 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:49:18,937 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-14 15:49:18,937 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:49:18,938 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:49:18,938 INFO  L85        PathProgramCache]: Analyzing trace with hash -2056000481, now seen corresponding path program 3 times
[2024-06-14 15:49:18,938 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:49:18,938 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133731515]
[2024-06-14 15:49:18,938 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:49:18,938 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:49:18,967 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:49:26,061 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:49:26,061 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:49:26,061 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133731515]
[2024-06-14 15:49:26,061 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133731515] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:49:26,061 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:49:26,061 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:49:26,061 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972474833]
[2024-06-14 15:49:26,061 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:49:26,062 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:49:26,062 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:49:26,062 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:49:26,062 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:49:26,185 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:49:26,186 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 95 transitions, 777 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:26,186 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:49:26,186 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:49:26,186 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:49:27,231 INFO  L124   PetriNetUnfolderBase]: 1789/2671 cut-off events.
[2024-06-14 15:49:27,232 INFO  L125   PetriNetUnfolderBase]: For 13552/13552 co-relation queries the response was YES.
[2024-06-14 15:49:27,238 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12878 conditions, 2671 events. 1789/2671 cut-off events. For 13552/13552 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12459 event pairs, 579 based on Foata normal form. 4/2672 useless extension candidates. Maximal degree in co-relation 12844. Up to 2498 conditions per place. 
[2024-06-14 15:49:27,248 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 107 selfloop transitions, 28 changer transitions 0/139 dead transitions.
[2024-06-14 15:49:27,248 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 139 transitions, 1293 flow
[2024-06-14 15:49:27,249 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:49:27,249 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:49:27,249 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions.
[2024-06-14 15:49:27,249 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4481707317073171
[2024-06-14 15:49:27,250 INFO  L175             Difference]: Start difference. First operand has 72 places, 95 transitions, 777 flow. Second operand 8 states and 147 transitions.
[2024-06-14 15:49:27,250 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 139 transitions, 1293 flow
[2024-06-14 15:49:27,264 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 139 transitions, 1247 flow, removed 12 selfloop flow, removed 3 redundant places.
[2024-06-14 15:49:27,266 INFO  L231             Difference]: Finished difference. Result has 80 places, 110 transitions, 1009 flow
[2024-06-14 15:49:27,266 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1009, PETRI_PLACES=80, PETRI_TRANSITIONS=110}
[2024-06-14 15:49:27,266 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 38 predicate places.
[2024-06-14 15:49:27,267 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 110 transitions, 1009 flow
[2024-06-14 15:49:27,267 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:27,267 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:49:27,267 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:49:27,267 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-14 15:49:27,267 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:49:27,268 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:49:27,268 INFO  L85        PathProgramCache]: Analyzing trace with hash -2055991553, now seen corresponding path program 1 times
[2024-06-14 15:49:27,268 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:49:27,268 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665728182]
[2024-06-14 15:49:27,268 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:49:27,268 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:49:27,306 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:49:35,430 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:49:35,431 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:49:35,431 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665728182]
[2024-06-14 15:49:35,431 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665728182] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:49:35,431 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:49:35,431 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:49:35,431 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975287625]
[2024-06-14 15:49:35,431 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:49:35,431 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:49:35,431 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:49:35,432 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:49:35,432 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:49:35,576 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:49:35,576 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 110 transitions, 1009 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:35,576 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:49:35,576 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:49:35,576 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:49:36,644 INFO  L124   PetriNetUnfolderBase]: 1781/2659 cut-off events.
[2024-06-14 15:49:36,645 INFO  L125   PetriNetUnfolderBase]: For 16140/16140 co-relation queries the response was YES.
[2024-06-14 15:49:36,653 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13535 conditions, 2659 events. 1781/2659 cut-off events. For 16140/16140 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 12382 event pairs, 592 based on Foata normal form. 4/2660 useless extension candidates. Maximal degree in co-relation 13496. Up to 2574 conditions per place. 
[2024-06-14 15:49:36,663 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 116 selfloop transitions, 16 changer transitions 0/136 dead transitions.
[2024-06-14 15:49:36,664 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 136 transitions, 1359 flow
[2024-06-14 15:49:36,665 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:49:36,666 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:49:36,666 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions.
[2024-06-14 15:49:36,666 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42378048780487804
[2024-06-14 15:49:36,666 INFO  L175             Difference]: Start difference. First operand has 80 places, 110 transitions, 1009 flow. Second operand 8 states and 139 transitions.
[2024-06-14 15:49:36,667 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 136 transitions, 1359 flow
[2024-06-14 15:49:36,684 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 136 transitions, 1307 flow, removed 23 selfloop flow, removed 2 redundant places.
[2024-06-14 15:49:36,686 INFO  L231             Difference]: Finished difference. Result has 86 places, 112 transitions, 1026 flow
[2024-06-14 15:49:36,687 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1026, PETRI_PLACES=86, PETRI_TRANSITIONS=112}
[2024-06-14 15:49:36,687 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 44 predicate places.
[2024-06-14 15:49:36,687 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 112 transitions, 1026 flow
[2024-06-14 15:49:36,687 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:36,688 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:49:36,688 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:49:36,688 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-14 15:49:36,688 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:49:36,688 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:49:36,688 INFO  L85        PathProgramCache]: Analyzing trace with hash -410482301, now seen corresponding path program 1 times
[2024-06-14 15:49:36,689 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:49:36,689 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970279427]
[2024-06-14 15:49:36,689 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:49:36,689 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:49:36,736 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:49:44,385 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:49:44,385 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:49:44,385 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970279427]
[2024-06-14 15:49:44,386 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970279427] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:49:44,386 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:49:44,386 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:49:44,386 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075895612]
[2024-06-14 15:49:44,386 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:49:44,386 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:49:44,386 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:49:44,386 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:49:44,387 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:49:44,625 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:49:44,626 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 112 transitions, 1026 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:44,626 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:49:44,626 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:49:44,626 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:49:45,703 INFO  L124   PetriNetUnfolderBase]: 1840/2744 cut-off events.
[2024-06-14 15:49:45,703 INFO  L125   PetriNetUnfolderBase]: For 18656/18662 co-relation queries the response was YES.
[2024-06-14 15:49:45,710 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14283 conditions, 2744 events. 1840/2744 cut-off events. For 18656/18662 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12845 event pairs, 484 based on Foata normal form. 6/2743 useless extension candidates. Maximal degree in co-relation 14242. Up to 2331 conditions per place. 
[2024-06-14 15:49:45,719 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 89 selfloop transitions, 59 changer transitions 0/152 dead transitions.
[2024-06-14 15:49:45,719 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 152 transitions, 1608 flow
[2024-06-14 15:49:45,720 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:49:45,720 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:49:45,720 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions.
[2024-06-14 15:49:45,721 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4808362369337979
[2024-06-14 15:49:45,721 INFO  L175             Difference]: Start difference. First operand has 86 places, 112 transitions, 1026 flow. Second operand 7 states and 138 transitions.
[2024-06-14 15:49:45,721 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 152 transitions, 1608 flow
[2024-06-14 15:49:45,736 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 152 transitions, 1555 flow, removed 12 selfloop flow, removed 6 redundant places.
[2024-06-14 15:49:45,738 INFO  L231             Difference]: Finished difference. Result has 89 places, 127 transitions, 1332 flow
[2024-06-14 15:49:45,739 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=973, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1332, PETRI_PLACES=89, PETRI_TRANSITIONS=127}
[2024-06-14 15:49:45,739 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places.
[2024-06-14 15:49:45,739 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 127 transitions, 1332 flow
[2024-06-14 15:49:45,740 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:45,740 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:49:45,740 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:49:45,740 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-14 15:49:45,740 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:49:45,740 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:49:45,740 INFO  L85        PathProgramCache]: Analyzing trace with hash 356434382, now seen corresponding path program 1 times
[2024-06-14 15:49:45,740 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:49:45,741 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438873804]
[2024-06-14 15:49:45,741 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:49:45,741 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:49:45,789 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:49:54,029 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:49:54,030 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:49:54,030 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438873804]
[2024-06-14 15:49:54,030 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438873804] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:49:54,030 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:49:54,030 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:49:54,030 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202981130]
[2024-06-14 15:49:54,030 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:49:54,030 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:49:54,031 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:49:54,031 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:49:54,031 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:49:54,173 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:49:54,173 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 127 transitions, 1332 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:54,173 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:49:54,173 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:49:54,173 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:49:55,273 INFO  L124   PetriNetUnfolderBase]: 1919/2860 cut-off events.
[2024-06-14 15:49:55,274 INFO  L125   PetriNetUnfolderBase]: For 24309/24318 co-relation queries the response was YES.
[2024-06-14 15:49:55,283 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16471 conditions, 2860 events. 1919/2860 cut-off events. For 24309/24318 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 13427 event pairs, 509 based on Foata normal form. 19/2874 useless extension candidates. Maximal degree in co-relation 16427. Up to 2440 conditions per place. 
[2024-06-14 15:49:55,295 INFO  L140   encePairwiseOnDemand]: 26/41 looper letters, 104 selfloop transitions, 54 changer transitions 0/162 dead transitions.
[2024-06-14 15:49:55,295 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 162 transitions, 1868 flow
[2024-06-14 15:49:55,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:49:55,296 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:49:55,296 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-14 15:49:55,297 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47865853658536583
[2024-06-14 15:49:55,297 INFO  L175             Difference]: Start difference. First operand has 89 places, 127 transitions, 1332 flow. Second operand 8 states and 157 transitions.
[2024-06-14 15:49:55,297 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 162 transitions, 1868 flow
[2024-06-14 15:49:55,331 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 162 transitions, 1836 flow, removed 11 selfloop flow, removed 2 redundant places.
[2024-06-14 15:49:55,333 INFO  L231             Difference]: Finished difference. Result has 95 places, 134 transitions, 1522 flow
[2024-06-14 15:49:55,333 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1522, PETRI_PLACES=95, PETRI_TRANSITIONS=134}
[2024-06-14 15:49:55,334 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 53 predicate places.
[2024-06-14 15:49:55,334 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 134 transitions, 1522 flow
[2024-06-14 15:49:55,334 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:49:55,334 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:49:55,334 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:49:55,334 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-14 15:49:55,335 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:49:55,335 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:49:55,335 INFO  L85        PathProgramCache]: Analyzing trace with hash 681144142, now seen corresponding path program 2 times
[2024-06-14 15:49:55,335 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:49:55,335 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543313610]
[2024-06-14 15:49:55,335 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:49:55,335 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:49:55,366 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:50:03,672 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:50:03,672 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:50:03,672 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543313610]
[2024-06-14 15:50:03,673 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543313610] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:50:03,673 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:50:03,673 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:50:03,673 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570020155]
[2024-06-14 15:50:03,673 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:50:03,673 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:50:03,673 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:50:03,673 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:50:03,673 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:50:03,772 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:50:03,772 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 134 transitions, 1522 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:03,772 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:50:03,772 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:50:03,772 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:50:05,017 INFO  L124   PetriNetUnfolderBase]: 2121/3148 cut-off events.
[2024-06-14 15:50:05,017 INFO  L125   PetriNetUnfolderBase]: For 31948/31954 co-relation queries the response was YES.
[2024-06-14 15:50:05,026 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19575 conditions, 3148 events. 2121/3148 cut-off events. For 31948/31954 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 15000 event pairs, 474 based on Foata normal form. 17/3158 useless extension candidates. Maximal degree in co-relation 19529. Up to 2459 conditions per place. 
[2024-06-14 15:50:05,038 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 99 selfloop transitions, 87 changer transitions 0/190 dead transitions.
[2024-06-14 15:50:05,038 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 190 transitions, 2392 flow
[2024-06-14 15:50:05,039 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:50:05,039 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:50:05,040 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions.
[2024-06-14 15:50:05,040 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4817073170731707
[2024-06-14 15:50:05,040 INFO  L175             Difference]: Start difference. First operand has 95 places, 134 transitions, 1522 flow. Second operand 8 states and 158 transitions.
[2024-06-14 15:50:05,040 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 190 transitions, 2392 flow
[2024-06-14 15:50:05,073 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 190 transitions, 2201 flow, removed 45 selfloop flow, removed 6 redundant places.
[2024-06-14 15:50:05,076 INFO  L231             Difference]: Finished difference. Result has 99 places, 160 transitions, 1966 flow
[2024-06-14 15:50:05,076 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1368, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1966, PETRI_PLACES=99, PETRI_TRANSITIONS=160}
[2024-06-14 15:50:05,077 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 57 predicate places.
[2024-06-14 15:50:05,077 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 160 transitions, 1966 flow
[2024-06-14 15:50:05,077 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:05,077 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:50:05,078 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:50:05,078 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-14 15:50:05,078 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:50:05,079 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:50:05,079 INFO  L85        PathProgramCache]: Analyzing trace with hash 688495792, now seen corresponding path program 3 times
[2024-06-14 15:50:05,079 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:50:05,079 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260595373]
[2024-06-14 15:50:05,079 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:50:05,079 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:50:05,111 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:50:13,228 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:50:13,228 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:50:13,228 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260595373]
[2024-06-14 15:50:13,228 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260595373] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:50:13,228 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:50:13,228 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:50:13,228 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762121747]
[2024-06-14 15:50:13,228 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:50:13,229 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:50:13,229 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:50:13,229 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:50:13,229 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:50:13,445 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:50:13,445 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 160 transitions, 1966 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:13,445 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:50:13,445 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:50:13,445 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:50:14,616 INFO  L124   PetriNetUnfolderBase]: 2143/3182 cut-off events.
[2024-06-14 15:50:14,616 INFO  L125   PetriNetUnfolderBase]: For 40196/40196 co-relation queries the response was YES.
[2024-06-14 15:50:14,625 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21728 conditions, 3182 events. 2143/3182 cut-off events. For 40196/40196 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 15092 event pairs, 568 based on Foata normal form. 4/3183 useless extension candidates. Maximal degree in co-relation 21679. Up to 2948 conditions per place. 
[2024-06-14 15:50:14,635 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 160 selfloop transitions, 40 changer transitions 0/204 dead transitions.
[2024-06-14 15:50:14,635 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 204 transitions, 2628 flow
[2024-06-14 15:50:14,636 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:50:14,636 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:50:14,637 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions.
[2024-06-14 15:50:14,637 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44715447154471544
[2024-06-14 15:50:14,637 INFO  L175             Difference]: Start difference. First operand has 99 places, 160 transitions, 1966 flow. Second operand 9 states and 165 transitions.
[2024-06-14 15:50:14,637 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 204 transitions, 2628 flow
[2024-06-14 15:50:14,681 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 204 transitions, 2520 flow, removed 37 selfloop flow, removed 3 redundant places.
[2024-06-14 15:50:14,684 INFO  L231             Difference]: Finished difference. Result has 108 places, 171 transitions, 2159 flow
[2024-06-14 15:50:14,685 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1863, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2159, PETRI_PLACES=108, PETRI_TRANSITIONS=171}
[2024-06-14 15:50:14,685 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 66 predicate places.
[2024-06-14 15:50:14,685 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 171 transitions, 2159 flow
[2024-06-14 15:50:14,685 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:14,686 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:50:14,686 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:50:14,686 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-14 15:50:14,686 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-14 15:50:14,686 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:50:14,686 INFO  L85        PathProgramCache]: Analyzing trace with hash 688762702, now seen corresponding path program 4 times
[2024-06-14 15:50:14,686 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:50:14,687 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849586484]
[2024-06-14 15:50:14,687 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:50:14,687 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:50:14,717 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:50:22,706 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:50:22,706 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:50:22,706 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849586484]
[2024-06-14 15:50:22,706 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849586484] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:50:22,706 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:50:22,706 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:50:22,706 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520417243]
[2024-06-14 15:50:22,707 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:50:22,707 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:50:22,707 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:50:22,707 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:50:22,707 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:50:22,797 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:50:22,797 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 171 transitions, 2159 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:22,797 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:50:22,797 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:50:22,797 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:50:24,014 INFO  L124   PetriNetUnfolderBase]: 2138/3180 cut-off events.
[2024-06-14 15:50:24,014 INFO  L125   PetriNetUnfolderBase]: For 44466/44466 co-relation queries the response was YES.
[2024-06-14 15:50:24,026 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22423 conditions, 3180 events. 2138/3180 cut-off events. For 44466/44466 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 15135 event pairs, 559 based on Foata normal form. 2/3179 useless extension candidates. Maximal degree in co-relation 22369. Up to 3002 conditions per place. 
[2024-06-14 15:50:24,040 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 181 selfloop transitions, 39 changer transitions 0/224 dead transitions.
[2024-06-14 15:50:24,040 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 224 transitions, 3014 flow
[2024-06-14 15:50:24,045 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:50:24,045 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:50:24,047 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions.
[2024-06-14 15:50:24,047 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4363143631436314
[2024-06-14 15:50:24,047 INFO  L175             Difference]: Start difference. First operand has 108 places, 171 transitions, 2159 flow. Second operand 9 states and 161 transitions.
[2024-06-14 15:50:24,047 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 224 transitions, 3014 flow
[2024-06-14 15:50:24,100 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 224 transitions, 2890 flow, removed 56 selfloop flow, removed 3 redundant places.
[2024-06-14 15:50:24,103 INFO  L231             Difference]: Finished difference. Result has 117 places, 194 transitions, 2539 flow
[2024-06-14 15:50:24,103 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2067, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2539, PETRI_PLACES=117, PETRI_TRANSITIONS=194}
[2024-06-14 15:50:24,104 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 75 predicate places.
[2024-06-14 15:50:24,104 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 194 transitions, 2539 flow
[2024-06-14 15:50:24,104 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:24,104 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:50:24,104 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:50:24,104 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-14 15:50:24,104 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:50:24,105 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:50:24,105 INFO  L85        PathProgramCache]: Analyzing trace with hash -487498107, now seen corresponding path program 1 times
[2024-06-14 15:50:24,105 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:50:24,105 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344346686]
[2024-06-14 15:50:24,105 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:50:24,105 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:50:24,132 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:50:35,383 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:50:35,383 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:50:35,384 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344346686]
[2024-06-14 15:50:35,384 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344346686] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:50:35,384 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:50:35,384 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:50:35,384 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562981074]
[2024-06-14 15:50:35,384 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:50:35,384 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:50:35,385 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:50:35,385 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:50:35,385 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:50:35,512 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:50:35,512 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 194 transitions, 2539 flow. Second operand  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:35,513 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:50:35,513 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:50:35,513 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:50:36,571 INFO  L124   PetriNetUnfolderBase]: 2136/3173 cut-off events.
[2024-06-14 15:50:36,571 INFO  L125   PetriNetUnfolderBase]: For 46235/46241 co-relation queries the response was YES.
[2024-06-14 15:50:36,582 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23074 conditions, 3173 events. 2136/3173 cut-off events. For 46235/46241 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 15113 event pairs, 564 based on Foata normal form. 7/3173 useless extension candidates. Maximal degree in co-relation 23015. Up to 3058 conditions per place. 
[2024-06-14 15:50:36,593 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 184 selfloop transitions, 19 changer transitions 0/207 dead transitions.
[2024-06-14 15:50:36,593 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 207 transitions, 3041 flow
[2024-06-14 15:50:36,593 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 15:50:36,593 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 15:50:36,594 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions.
[2024-06-14 15:50:36,594 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45365853658536587
[2024-06-14 15:50:36,594 INFO  L175             Difference]: Start difference. First operand has 117 places, 194 transitions, 2539 flow. Second operand 5 states and 93 transitions.
[2024-06-14 15:50:36,594 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 207 transitions, 3041 flow
[2024-06-14 15:50:36,646 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 207 transitions, 2945 flow, removed 43 selfloop flow, removed 3 redundant places.
[2024-06-14 15:50:36,648 INFO  L231             Difference]: Finished difference. Result has 119 places, 198 transitions, 2563 flow
[2024-06-14 15:50:36,649 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2443, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2563, PETRI_PLACES=119, PETRI_TRANSITIONS=198}
[2024-06-14 15:50:36,649 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 77 predicate places.
[2024-06-14 15:50:36,649 INFO  L495      AbstractCegarLoop]: Abstraction has has 119 places, 198 transitions, 2563 flow
[2024-06-14 15:50:36,649 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:36,650 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:50:36,650 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:50:36,650 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-14 15:50:36,650 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:50:36,650 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:50:36,650 INFO  L85        PathProgramCache]: Analyzing trace with hash 1733225414, now seen corresponding path program 1 times
[2024-06-14 15:50:36,650 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:50:36,650 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315329787]
[2024-06-14 15:50:36,651 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:50:36,651 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:50:36,701 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:50:44,467 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:50:44,468 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:50:44,468 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315329787]
[2024-06-14 15:50:44,468 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315329787] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:50:44,468 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:50:44,468 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:50:44,468 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465040237]
[2024-06-14 15:50:44,468 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:50:44,468 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:50:44,468 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:50:44,469 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:50:44,469 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:50:44,643 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-14 15:50:44,643 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 198 transitions, 2563 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:44,643 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:50:44,643 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-14 15:50:44,643 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:50:45,675 INFO  L124   PetriNetUnfolderBase]: 2124/3167 cut-off events.
[2024-06-14 15:50:45,675 INFO  L125   PetriNetUnfolderBase]: For 51414/51478 co-relation queries the response was YES.
[2024-06-14 15:50:45,688 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23518 conditions, 3167 events. 2124/3167 cut-off events. For 51414/51478 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 15207 event pairs, 390 based on Foata normal form. 13/3131 useless extension candidates. Maximal degree in co-relation 23457. Up to 2941 conditions per place. 
[2024-06-14 15:50:45,700 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 171 selfloop transitions, 15 changer transitions 0/217 dead transitions.
[2024-06-14 15:50:45,701 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 217 transitions, 3009 flow
[2024-06-14 15:50:45,703 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:50:45,703 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:50:45,704 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions.
[2024-06-14 15:50:45,704 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4634146341463415
[2024-06-14 15:50:45,704 INFO  L175             Difference]: Start difference. First operand has 119 places, 198 transitions, 2563 flow. Second operand 6 states and 114 transitions.
[2024-06-14 15:50:45,704 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 217 transitions, 3009 flow
[2024-06-14 15:50:45,767 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 217 transitions, 2951 flow, removed 15 selfloop flow, removed 3 redundant places.
[2024-06-14 15:50:45,769 INFO  L231             Difference]: Finished difference. Result has 122 places, 200 transitions, 2578 flow
[2024-06-14 15:50:45,769 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2505, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2578, PETRI_PLACES=122, PETRI_TRANSITIONS=200}
[2024-06-14 15:50:45,770 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 80 predicate places.
[2024-06-14 15:50:45,770 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 200 transitions, 2578 flow
[2024-06-14 15:50:45,770 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:45,770 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:50:45,770 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:50:45,770 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-14 15:50:45,771 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:50:45,771 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:50:45,771 INFO  L85        PathProgramCache]: Analyzing trace with hash -1951505266, now seen corresponding path program 2 times
[2024-06-14 15:50:45,771 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:50:45,771 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661625270]
[2024-06-14 15:50:45,771 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:50:45,771 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:50:45,819 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:50:53,149 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:50:53,149 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:50:53,149 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661625270]
[2024-06-14 15:50:53,149 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661625270] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:50:53,149 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:50:53,149 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:50:53,149 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68272713]
[2024-06-14 15:50:53,149 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:50:53,150 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:50:53,150 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:50:53,150 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:50:53,150 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:50:53,329 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-14 15:50:53,329 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 200 transitions, 2578 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:53,329 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:50:53,329 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-14 15:50:53,329 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:50:54,438 INFO  L124   PetriNetUnfolderBase]: 2111/3152 cut-off events.
[2024-06-14 15:50:54,438 INFO  L125   PetriNetUnfolderBase]: For 54890/54953 co-relation queries the response was YES.
[2024-06-14 15:50:54,450 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23659 conditions, 3152 events. 2111/3152 cut-off events. For 54890/54953 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 15196 event pairs, 490 based on Foata normal form. 11/3115 useless extension candidates. Maximal degree in co-relation 23597. Up to 2870 conditions per place. 
[2024-06-14 15:50:54,461 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 158 selfloop transitions, 32 changer transitions 0/221 dead transitions.
[2024-06-14 15:50:54,461 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 221 transitions, 3082 flow
[2024-06-14 15:50:54,462 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:50:54,462 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:50:54,462 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions.
[2024-06-14 15:50:54,463 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4715447154471545
[2024-06-14 15:50:54,463 INFO  L175             Difference]: Start difference. First operand has 122 places, 200 transitions, 2578 flow. Second operand 6 states and 116 transitions.
[2024-06-14 15:50:54,463 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 221 transitions, 3082 flow
[2024-06-14 15:50:54,517 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 221 transitions, 3039 flow, removed 8 selfloop flow, removed 4 redundant places.
[2024-06-14 15:50:54,520 INFO  L231             Difference]: Finished difference. Result has 124 places, 202 transitions, 2652 flow
[2024-06-14 15:50:54,520 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2535, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2652, PETRI_PLACES=124, PETRI_TRANSITIONS=202}
[2024-06-14 15:50:54,520 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 82 predicate places.
[2024-06-14 15:50:54,520 INFO  L495      AbstractCegarLoop]: Abstraction has has 124 places, 202 transitions, 2652 flow
[2024-06-14 15:50:54,521 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:50:54,521 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:50:54,521 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:50:54,521 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-14 15:50:54,521 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-14 15:50:54,521 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:50:54,522 INFO  L85        PathProgramCache]: Analyzing trace with hash -1835435000, now seen corresponding path program 1 times
[2024-06-14 15:50:54,522 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:50:54,522 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625928609]
[2024-06-14 15:50:54,522 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:50:54,522 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:50:54,593 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:51:02,137 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:51:02,137 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:51:02,137 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625928609]
[2024-06-14 15:51:02,138 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625928609] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:51:02,138 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:51:02,138 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:51:02,138 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870743039]
[2024-06-14 15:51:02,138 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:51:02,138 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:51:02,138 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:51:02,138 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:51:02,139 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:51:02,435 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:51:02,436 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 202 transitions, 2652 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:02,436 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:51:02,436 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:51:02,436 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:51:03,750 INFO  L124   PetriNetUnfolderBase]: 2280/3403 cut-off events.
[2024-06-14 15:51:03,750 INFO  L125   PetriNetUnfolderBase]: For 61198/61204 co-relation queries the response was YES.
[2024-06-14 15:51:03,764 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25658 conditions, 3403 events. 2280/3403 cut-off events. For 61198/61204 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 16605 event pairs, 481 based on Foata normal form. 6/3402 useless extension candidates. Maximal degree in co-relation 25595. Up to 2720 conditions per place. 
[2024-06-14 15:51:03,779 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 141 selfloop transitions, 118 changer transitions 0/263 dead transitions.
[2024-06-14 15:51:03,779 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 263 transitions, 3817 flow
[2024-06-14 15:51:03,779 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:51:03,779 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:51:03,780 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions.
[2024-06-14 15:51:03,780 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4878048780487805
[2024-06-14 15:51:03,780 INFO  L175             Difference]: Start difference. First operand has 124 places, 202 transitions, 2652 flow. Second operand 9 states and 180 transitions.
[2024-06-14 15:51:03,780 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 263 transitions, 3817 flow
[2024-06-14 15:51:03,850 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 263 transitions, 3738 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-14 15:51:03,854 INFO  L231             Difference]: Finished difference. Result has 132 places, 225 transitions, 3343 flow
[2024-06-14 15:51:03,854 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2577, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3343, PETRI_PLACES=132, PETRI_TRANSITIONS=225}
[2024-06-14 15:51:03,854 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 90 predicate places.
[2024-06-14 15:51:03,854 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 225 transitions, 3343 flow
[2024-06-14 15:51:03,854 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:03,854 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:51:03,855 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:51:03,855 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-14 15:51:03,855 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:51:03,855 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:51:03,855 INFO  L85        PathProgramCache]: Analyzing trace with hash -1835434752, now seen corresponding path program 1 times
[2024-06-14 15:51:03,855 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:51:03,855 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592367992]
[2024-06-14 15:51:03,855 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:51:03,855 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:51:03,892 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:51:11,404 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:51:11,405 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:51:11,405 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592367992]
[2024-06-14 15:51:11,405 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592367992] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:51:11,405 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:51:11,405 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:51:11,405 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172509779]
[2024-06-14 15:51:11,405 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:51:11,405 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:51:11,406 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:51:11,406 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:51:11,406 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:51:11,651 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:51:11,651 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 225 transitions, 3343 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:11,651 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:51:11,651 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:51:11,651 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:51:13,089 INFO  L124   PetriNetUnfolderBase]: 2409/3615 cut-off events.
[2024-06-14 15:51:13,089 INFO  L125   PetriNetUnfolderBase]: For 79611/79620 co-relation queries the response was YES.
[2024-06-14 15:51:13,103 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29299 conditions, 3615 events. 2409/3615 cut-off events. For 79611/79620 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 17929 event pairs, 461 based on Foata normal form. 36/3646 useless extension candidates. Maximal degree in co-relation 29232. Up to 3066 conditions per place. 
[2024-06-14 15:51:13,115 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 214 selfloop transitions, 75 changer transitions 0/293 dead transitions.
[2024-06-14 15:51:13,115 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 293 transitions, 4680 flow
[2024-06-14 15:51:13,116 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:51:13,116 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:51:13,116 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions.
[2024-06-14 15:51:13,116 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4823848238482385
[2024-06-14 15:51:13,116 INFO  L175             Difference]: Start difference. First operand has 132 places, 225 transitions, 3343 flow. Second operand 9 states and 178 transitions.
[2024-06-14 15:51:13,116 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 293 transitions, 4680 flow
[2024-06-14 15:51:13,201 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 293 transitions, 4542 flow, removed 57 selfloop flow, removed 3 redundant places.
[2024-06-14 15:51:13,205 INFO  L231             Difference]: Finished difference. Result has 142 places, 258 transitions, 4059 flow
[2024-06-14 15:51:13,205 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3213, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4059, PETRI_PLACES=142, PETRI_TRANSITIONS=258}
[2024-06-14 15:51:13,205 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 100 predicate places.
[2024-06-14 15:51:13,205 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 258 transitions, 4059 flow
[2024-06-14 15:51:13,205 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:13,205 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:51:13,205 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:51:13,205 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-14 15:51:13,205 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:51:13,206 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:51:13,206 INFO  L85        PathProgramCache]: Analyzing trace with hash -359367032, now seen corresponding path program 2 times
[2024-06-14 15:51:13,206 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:51:13,206 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704166738]
[2024-06-14 15:51:13,206 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:51:13,206 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:51:13,269 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:51:21,177 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:51:21,178 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:51:21,178 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704166738]
[2024-06-14 15:51:21,178 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704166738] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:51:21,178 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:51:21,178 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:51:21,178 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563569590]
[2024-06-14 15:51:21,178 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:51:21,178 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:51:21,179 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:51:21,179 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:51:21,179 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:51:21,332 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:51:21,333 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 258 transitions, 4059 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:21,333 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:51:21,333 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:51:21,333 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:51:22,748 INFO  L124   PetriNetUnfolderBase]: 2453/3704 cut-off events.
[2024-06-14 15:51:22,748 INFO  L125   PetriNetUnfolderBase]: For 86703/86709 co-relation queries the response was YES.
[2024-06-14 15:51:22,766 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31317 conditions, 3704 events. 2453/3704 cut-off events. For 86703/86709 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 18681 event pairs, 490 based on Foata normal form. 6/3703 useless extension candidates. Maximal degree in co-relation 31244. Up to 2901 conditions per place. 
[2024-06-14 15:51:22,783 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 170 selfloop transitions, 130 changer transitions 0/304 dead transitions.
[2024-06-14 15:51:22,783 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 304 transitions, 5078 flow
[2024-06-14 15:51:22,783 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:51:22,784 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:51:22,784 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-14 15:51:22,784 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47696476964769646
[2024-06-14 15:51:22,784 INFO  L175             Difference]: Start difference. First operand has 142 places, 258 transitions, 4059 flow. Second operand 9 states and 176 transitions.
[2024-06-14 15:51:22,784 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 304 transitions, 5078 flow
[2024-06-14 15:51:22,918 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 304 transitions, 4975 flow, removed 47 selfloop flow, removed 2 redundant places.
[2024-06-14 15:51:22,923 INFO  L231             Difference]: Finished difference. Result has 149 places, 266 transitions, 4383 flow
[2024-06-14 15:51:22,923 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3962, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4383, PETRI_PLACES=149, PETRI_TRANSITIONS=266}
[2024-06-14 15:51:22,923 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 107 predicate places.
[2024-06-14 15:51:22,923 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 266 transitions, 4383 flow
[2024-06-14 15:51:22,923 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:22,923 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:51:22,923 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:51:22,923 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-14 15:51:22,924 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:51:22,924 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:51:22,924 INFO  L85        PathProgramCache]: Analyzing trace with hash -359366784, now seen corresponding path program 2 times
[2024-06-14 15:51:22,924 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:51:22,924 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575458302]
[2024-06-14 15:51:22,924 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:51:22,924 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:51:22,955 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:51:30,961 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:51:30,961 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:51:30,961 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575458302]
[2024-06-14 15:51:30,961 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575458302] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:51:30,961 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:51:30,961 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:51:30,961 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398962542]
[2024-06-14 15:51:30,961 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:51:30,962 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:51:30,962 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:51:30,962 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:51:30,962 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:51:31,177 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:51:31,178 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 266 transitions, 4383 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:31,178 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:51:31,178 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:51:31,178 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:51:32,774 INFO  L124   PetriNetUnfolderBase]: 2682/4063 cut-off events.
[2024-06-14 15:51:32,775 INFO  L125   PetriNetUnfolderBase]: For 104479/104488 co-relation queries the response was YES.
[2024-06-14 15:51:32,794 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34910 conditions, 4063 events. 2682/4063 cut-off events. For 104479/104488 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 20922 event pairs, 485 based on Foata normal form. 34/4092 useless extension candidates. Maximal degree in co-relation 34835. Up to 3349 conditions per place. 
[2024-06-14 15:51:32,813 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 245 selfloop transitions, 76 changer transitions 0/325 dead transitions.
[2024-06-14 15:51:32,813 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 325 transitions, 5641 flow
[2024-06-14 15:51:32,814 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:51:32,814 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:51:32,814 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions.
[2024-06-14 15:51:32,814 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4715447154471545
[2024-06-14 15:51:32,814 INFO  L175             Difference]: Start difference. First operand has 149 places, 266 transitions, 4383 flow. Second operand 9 states and 174 transitions.
[2024-06-14 15:51:32,814 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 325 transitions, 5641 flow
[2024-06-14 15:51:32,967 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 325 transitions, 5273 flow, removed 50 selfloop flow, removed 7 redundant places.
[2024-06-14 15:51:32,971 INFO  L231             Difference]: Finished difference. Result has 155 places, 290 transitions, 4706 flow
[2024-06-14 15:51:32,971 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4037, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4706, PETRI_PLACES=155, PETRI_TRANSITIONS=290}
[2024-06-14 15:51:32,972 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 113 predicate places.
[2024-06-14 15:51:32,972 INFO  L495      AbstractCegarLoop]: Abstraction has has 155 places, 290 transitions, 4706 flow
[2024-06-14 15:51:32,972 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:32,972 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:51:32,972 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:51:32,972 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-14 15:51:32,972 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:51:32,972 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:51:32,973 INFO  L85        PathProgramCache]: Analyzing trace with hash -123191672, now seen corresponding path program 3 times
[2024-06-14 15:51:32,973 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:51:32,973 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716159692]
[2024-06-14 15:51:32,973 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:51:32,973 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:51:33,039 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:51:41,320 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:51:41,321 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:51:41,321 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716159692]
[2024-06-14 15:51:41,321 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716159692] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:51:41,321 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:51:41,321 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:51:41,321 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736643219]
[2024-06-14 15:51:41,321 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:51:41,321 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:51:41,321 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:51:41,322 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:51:41,322 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:51:41,526 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:51:41,527 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 290 transitions, 4706 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:41,527 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:51:41,527 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:51:41,527 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:51:42,893 INFO  L124   PetriNetUnfolderBase]: 2693/4111 cut-off events.
[2024-06-14 15:51:42,893 INFO  L125   PetriNetUnfolderBase]: For 105560/105560 co-relation queries the response was YES.
[2024-06-14 15:51:42,913 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35883 conditions, 4111 events. 2693/4111 cut-off events. For 105560/105560 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 21628 event pairs, 577 based on Foata normal form. 2/4110 useless extension candidates. Maximal degree in co-relation 35803. Up to 3738 conditions per place. 
[2024-06-14 15:51:42,931 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 266 selfloop transitions, 70 changer transitions 0/340 dead transitions.
[2024-06-14 15:51:42,932 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 340 transitions, 5786 flow
[2024-06-14 15:51:42,933 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:51:42,933 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:51:42,934 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions.
[2024-06-14 15:51:42,934 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44390243902439025
[2024-06-14 15:51:42,934 INFO  L175             Difference]: Start difference. First operand has 155 places, 290 transitions, 4706 flow. Second operand 10 states and 182 transitions.
[2024-06-14 15:51:42,934 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 340 transitions, 5786 flow
[2024-06-14 15:51:43,128 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 340 transitions, 5685 flow, removed 46 selfloop flow, removed 2 redundant places.
[2024-06-14 15:51:43,133 INFO  L231             Difference]: Finished difference. Result has 164 places, 304 transitions, 5037 flow
[2024-06-14 15:51:43,133 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4605, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5037, PETRI_PLACES=164, PETRI_TRANSITIONS=304}
[2024-06-14 15:51:43,133 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 122 predicate places.
[2024-06-14 15:51:43,134 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 304 transitions, 5037 flow
[2024-06-14 15:51:43,134 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:43,134 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:51:43,134 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:51:43,134 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-14 15:51:43,134 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:51:43,134 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:51:43,135 INFO  L85        PathProgramCache]: Analyzing trace with hash -131465882, now seen corresponding path program 4 times
[2024-06-14 15:51:43,135 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:51:43,135 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084913649]
[2024-06-14 15:51:43,135 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:51:43,135 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:51:43,205 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:51:53,228 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:51:53,229 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:51:53,229 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084913649]
[2024-06-14 15:51:53,229 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084913649] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:51:53,229 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:51:53,229 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:51:53,229 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464750150]
[2024-06-14 15:51:53,229 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:51:53,229 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:51:53,229 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:51:53,230 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:51:53,230 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:51:53,485 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:51:53,486 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 304 transitions, 5037 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:53,486 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:51:53,486 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:51:53,486 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:51:55,015 INFO  L124   PetriNetUnfolderBase]: 2688/4104 cut-off events.
[2024-06-14 15:51:55,015 INFO  L125   PetriNetUnfolderBase]: For 109855/109855 co-relation queries the response was YES.
[2024-06-14 15:51:55,035 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36217 conditions, 4104 events. 2688/4104 cut-off events. For 109855/109855 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 21585 event pairs, 577 based on Foata normal form. 2/4103 useless extension candidates. Maximal degree in co-relation 36134. Up to 3814 conditions per place. 
[2024-06-14 15:51:55,053 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 290 selfloop transitions, 48 changer transitions 0/342 dead transitions.
[2024-06-14 15:51:55,053 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 342 transitions, 5809 flow
[2024-06-14 15:51:55,055 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 15:51:55,055 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:51:55,056 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 195 transitions.
[2024-06-14 15:51:55,056 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43237250554323725
[2024-06-14 15:51:55,056 INFO  L175             Difference]: Start difference. First operand has 164 places, 304 transitions, 5037 flow. Second operand 11 states and 195 transitions.
[2024-06-14 15:51:55,056 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 342 transitions, 5809 flow
[2024-06-14 15:51:55,269 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 342 transitions, 5635 flow, removed 62 selfloop flow, removed 6 redundant places.
[2024-06-14 15:51:55,274 INFO  L231             Difference]: Finished difference. Result has 169 places, 304 transitions, 4967 flow
[2024-06-14 15:51:55,275 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4863, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4967, PETRI_PLACES=169, PETRI_TRANSITIONS=304}
[2024-06-14 15:51:55,275 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 127 predicate places.
[2024-06-14 15:51:55,275 INFO  L495      AbstractCegarLoop]: Abstraction has has 169 places, 304 transitions, 4967 flow
[2024-06-14 15:51:55,275 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:51:55,275 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:51:55,276 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:51:55,276 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-14 15:51:55,276 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-14 15:51:55,276 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:51:55,276 INFO  L85        PathProgramCache]: Analyzing trace with hash -131465634, now seen corresponding path program 3 times
[2024-06-14 15:51:55,276 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:51:55,276 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366345313]
[2024-06-14 15:51:55,276 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:51:55,277 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:51:55,311 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:03,694 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:52:03,694 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:03,694 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366345313]
[2024-06-14 15:52:03,694 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366345313] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:03,694 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:03,694 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:52:03,695 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412960348]
[2024-06-14 15:52:03,695 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:03,695 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:52:03,695 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:03,695 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:52:03,695 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:52:03,869 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:52:03,869 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 304 transitions, 4967 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:03,869 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:03,869 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:52:03,869 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:05,492 INFO  L124   PetriNetUnfolderBase]: 2780/4256 cut-off events.
[2024-06-14 15:52:05,493 INFO  L125   PetriNetUnfolderBase]: For 124306/124306 co-relation queries the response was YES.
[2024-06-14 15:52:05,518 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37466 conditions, 4256 events. 2780/4256 cut-off events. For 124306/124306 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 22726 event pairs, 587 based on Foata normal form. 24/4277 useless extension candidates. Maximal degree in co-relation 37381. Up to 3837 conditions per place. 
[2024-06-14 15:52:05,611 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 295 selfloop transitions, 46 changer transitions 0/345 dead transitions.
[2024-06-14 15:52:05,611 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 345 transitions, 5857 flow
[2024-06-14 15:52:05,613 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:52:05,613 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:52:05,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions.
[2024-06-14 15:52:05,613 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44878048780487806
[2024-06-14 15:52:05,613 INFO  L175             Difference]: Start difference. First operand has 169 places, 304 transitions, 4967 flow. Second operand 10 states and 184 transitions.
[2024-06-14 15:52:05,614 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 345 transitions, 5857 flow
[2024-06-14 15:52:05,803 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 345 transitions, 5743 flow, removed 21 selfloop flow, removed 7 redundant places.
[2024-06-14 15:52:05,808 INFO  L231             Difference]: Finished difference. Result has 172 places, 306 transitions, 5015 flow
[2024-06-14 15:52:05,808 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4853, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5015, PETRI_PLACES=172, PETRI_TRANSITIONS=306}
[2024-06-14 15:52:05,809 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 130 predicate places.
[2024-06-14 15:52:05,809 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 306 transitions, 5015 flow
[2024-06-14 15:52:05,809 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:05,809 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:05,809 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:05,809 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-14 15:52:05,809 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:52:05,810 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:05,810 INFO  L85        PathProgramCache]: Analyzing trace with hash -123191424, now seen corresponding path program 4 times
[2024-06-14 15:52:05,810 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:05,810 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654421664]
[2024-06-14 15:52:05,811 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:05,811 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:05,854 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:13,432 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:52:13,432 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:13,433 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654421664]
[2024-06-14 15:52:13,433 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654421664] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:13,433 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:13,433 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:52:13,433 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969534994]
[2024-06-14 15:52:13,434 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:13,434 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:52:13,434 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:13,434 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:52:13,434 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:52:13,642 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:52:13,642 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 306 transitions, 5015 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:13,642 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:13,642 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:52:13,643 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:15,159 INFO  L124   PetriNetUnfolderBase]: 2797/4273 cut-off events.
[2024-06-14 15:52:15,160 INFO  L125   PetriNetUnfolderBase]: For 124712/124712 co-relation queries the response was YES.
[2024-06-14 15:52:15,183 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38043 conditions, 4273 events. 2797/4273 cut-off events. For 124712/124712 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 22667 event pairs, 592 based on Foata normal form. 4/4274 useless extension candidates. Maximal degree in co-relation 37957. Up to 4012 conditions per place. 
[2024-06-14 15:52:15,202 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 295 selfloop transitions, 44 changer transitions 0/343 dead transitions.
[2024-06-14 15:52:15,202 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 343 transitions, 5841 flow
[2024-06-14 15:52:15,204 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:52:15,204 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:52:15,204 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions.
[2024-06-14 15:52:15,204 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4317073170731707
[2024-06-14 15:52:15,204 INFO  L175             Difference]: Start difference. First operand has 172 places, 306 transitions, 5015 flow. Second operand 10 states and 177 transitions.
[2024-06-14 15:52:15,204 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 343 transitions, 5841 flow
[2024-06-14 15:52:15,433 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 343 transitions, 5735 flow, removed 17 selfloop flow, removed 7 redundant places.
[2024-06-14 15:52:15,438 INFO  L231             Difference]: Finished difference. Result has 175 places, 308 transitions, 5068 flow
[2024-06-14 15:52:15,438 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4909, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5068, PETRI_PLACES=175, PETRI_TRANSITIONS=308}
[2024-06-14 15:52:15,438 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 133 predicate places.
[2024-06-14 15:52:15,438 INFO  L495      AbstractCegarLoop]: Abstraction has has 175 places, 308 transitions, 5068 flow
[2024-06-14 15:52:15,438 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:15,438 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:15,438 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:15,438 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-14 15:52:15,439 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:52:15,439 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:15,439 INFO  L85        PathProgramCache]: Analyzing trace with hash -122894754, now seen corresponding path program 5 times
[2024-06-14 15:52:15,439 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:15,439 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397632004]
[2024-06-14 15:52:15,439 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:15,439 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:15,474 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:23,574 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:52:23,574 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:23,574 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397632004]
[2024-06-14 15:52:23,574 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397632004] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:23,574 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:23,574 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:52:23,574 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601443541]
[2024-06-14 15:52:23,574 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:23,575 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:52:23,575 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:23,575 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:52:23,575 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:52:23,848 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:52:23,848 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 308 transitions, 5068 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:23,848 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:23,848 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:52:23,848 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:25,403 INFO  L124   PetriNetUnfolderBase]: 2789/4271 cut-off events.
[2024-06-14 15:52:25,403 INFO  L125   PetriNetUnfolderBase]: For 128033/128033 co-relation queries the response was YES.
[2024-06-14 15:52:25,425 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37892 conditions, 4271 events. 2789/4271 cut-off events. For 128033/128033 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 22774 event pairs, 555 based on Foata normal form. 4/4272 useless extension candidates. Maximal degree in co-relation 37805. Up to 3905 conditions per place. 
[2024-06-14 15:52:25,444 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 292 selfloop transitions, 53 changer transitions 0/349 dead transitions.
[2024-06-14 15:52:25,444 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 349 transitions, 5959 flow
[2024-06-14 15:52:25,446 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:52:25,446 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:52:25,446 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions.
[2024-06-14 15:52:25,447 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43414634146341463
[2024-06-14 15:52:25,447 INFO  L175             Difference]: Start difference. First operand has 175 places, 308 transitions, 5068 flow. Second operand 10 states and 178 transitions.
[2024-06-14 15:52:25,447 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 349 transitions, 5959 flow
[2024-06-14 15:52:25,656 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 349 transitions, 5818 flow, removed 28 selfloop flow, removed 8 redundant places.
[2024-06-14 15:52:25,661 INFO  L231             Difference]: Finished difference. Result has 178 places, 313 transitions, 5176 flow
[2024-06-14 15:52:25,661 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4927, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5176, PETRI_PLACES=178, PETRI_TRANSITIONS=313}
[2024-06-14 15:52:25,661 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 136 predicate places.
[2024-06-14 15:52:25,661 INFO  L495      AbstractCegarLoop]: Abstraction has has 178 places, 313 transitions, 5176 flow
[2024-06-14 15:52:25,662 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:25,662 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:25,662 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:25,662 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-14 15:52:25,662 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-14 15:52:25,662 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:25,662 INFO  L85        PathProgramCache]: Analyzing trace with hash -334090388, now seen corresponding path program 1 times
[2024-06-14 15:52:25,663 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:25,663 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153972094]
[2024-06-14 15:52:25,663 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:25,663 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:25,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:33,583 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:52:33,583 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:33,583 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153972094]
[2024-06-14 15:52:33,583 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153972094] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:33,583 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:33,584 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:52:33,584 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626999260]
[2024-06-14 15:52:33,584 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:33,584 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:52:33,584 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:33,585 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:52:33,585 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:52:33,844 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:52:33,844 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 313 transitions, 5176 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:33,844 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:33,844 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:52:33,844 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:35,525 INFO  L124   PetriNetUnfolderBase]: 2973/4549 cut-off events.
[2024-06-14 15:52:35,525 INFO  L125   PetriNetUnfolderBase]: For 144909/144915 co-relation queries the response was YES.
[2024-06-14 15:52:35,548 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40420 conditions, 4549 events. 2973/4549 cut-off events. For 144909/144915 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 24456 event pairs, 459 based on Foata normal form. 15/4557 useless extension candidates. Maximal degree in co-relation 40331. Up to 4092 conditions per place. 
[2024-06-14 15:52:35,566 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 325 selfloop transitions, 28 changer transitions 0/357 dead transitions.
[2024-06-14 15:52:35,566 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 357 transitions, 6368 flow
[2024-06-14 15:52:35,567 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:52:35,567 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:52:35,567 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions.
[2024-06-14 15:52:35,567 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4695121951219512
[2024-06-14 15:52:35,567 INFO  L175             Difference]: Start difference. First operand has 178 places, 313 transitions, 5176 flow. Second operand 8 states and 154 transitions.
[2024-06-14 15:52:35,567 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 357 transitions, 6368 flow
[2024-06-14 15:52:35,810 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 357 transitions, 6168 flow, removed 56 selfloop flow, removed 7 redundant places.
[2024-06-14 15:52:35,815 INFO  L231             Difference]: Finished difference. Result has 181 places, 324 transitions, 5313 flow
[2024-06-14 15:52:35,815 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4976, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5313, PETRI_PLACES=181, PETRI_TRANSITIONS=324}
[2024-06-14 15:52:35,816 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 139 predicate places.
[2024-06-14 15:52:35,816 INFO  L495      AbstractCegarLoop]: Abstraction has has 181 places, 324 transitions, 5313 flow
[2024-06-14 15:52:35,816 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:35,816 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:35,816 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:35,816 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-14 15:52:35,816 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:52:35,817 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:35,817 INFO  L85        PathProgramCache]: Analyzing trace with hash 404471924, now seen corresponding path program 2 times
[2024-06-14 15:52:35,817 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:35,817 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462830940]
[2024-06-14 15:52:35,817 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:35,817 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:35,870 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:43,152 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:52:43,152 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:43,152 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462830940]
[2024-06-14 15:52:43,153 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462830940] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:43,153 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:43,153 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:52:43,153 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393531803]
[2024-06-14 15:52:43,153 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:43,153 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:52:43,153 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:43,154 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:52:43,154 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:52:43,396 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:52:43,396 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 324 transitions, 5313 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:43,396 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:43,397 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:52:43,397 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:45,086 INFO  L124   PetriNetUnfolderBase]: 3069/4696 cut-off events.
[2024-06-14 15:52:45,086 INFO  L125   PetriNetUnfolderBase]: For 160462/160468 co-relation queries the response was YES.
[2024-06-14 15:52:45,117 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42190 conditions, 4696 events. 3069/4696 cut-off events. For 160462/160468 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 25430 event pairs, 613 based on Foata normal form. 21/4710 useless extension candidates. Maximal degree in co-relation 42098. Up to 4052 conditions per place. 
[2024-06-14 15:52:45,139 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 268 selfloop transitions, 90 changer transitions 0/362 dead transitions.
[2024-06-14 15:52:45,140 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 362 transitions, 6435 flow
[2024-06-14 15:52:45,140 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:52:45,140 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:52:45,140 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions.
[2024-06-14 15:52:45,141 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4878048780487805
[2024-06-14 15:52:45,141 INFO  L175             Difference]: Start difference. First operand has 181 places, 324 transitions, 5313 flow. Second operand 8 states and 160 transitions.
[2024-06-14 15:52:45,141 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 362 transitions, 6435 flow
[2024-06-14 15:52:45,472 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 362 transitions, 6305 flow, removed 55 selfloop flow, removed 3 redundant places.
[2024-06-14 15:52:45,477 INFO  L231             Difference]: Finished difference. Result has 186 places, 328 transitions, 5513 flow
[2024-06-14 15:52:45,477 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5183, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5513, PETRI_PLACES=186, PETRI_TRANSITIONS=328}
[2024-06-14 15:52:45,479 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 144 predicate places.
[2024-06-14 15:52:45,479 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 328 transitions, 5513 flow
[2024-06-14 15:52:45,479 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:45,479 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:45,479 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:45,479 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-14 15:52:45,479 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-14 15:52:45,480 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:45,480 INFO  L85        PathProgramCache]: Analyzing trace with hash -367119870, now seen corresponding path program 3 times
[2024-06-14 15:52:45,480 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:45,480 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328658336]
[2024-06-14 15:52:45,480 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:45,480 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:45,525 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:52:53,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-14 15:52:53,326 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:52:53,327 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328658336]
[2024-06-14 15:52:53,327 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328658336] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:52:53,327 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:52:53,327 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:52:53,327 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000422754]
[2024-06-14 15:52:53,327 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:52:53,327 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:52:53,327 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:52:53,328 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:52:53,328 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:52:53,436 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:52:53,437 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 328 transitions, 5513 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:53,437 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:52:53,437 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:52:53,437 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:52:55,446 INFO  L124   PetriNetUnfolderBase]: 3360/5144 cut-off events.
[2024-06-14 15:52:55,447 INFO  L125   PetriNetUnfolderBase]: For 194453/194459 co-relation queries the response was YES.
[2024-06-14 15:52:55,480 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47007 conditions, 5144 events. 3360/5144 cut-off events. For 194453/194459 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 28430 event pairs, 658 based on Foata normal form. 21/5158 useless extension candidates. Maximal degree in co-relation 46913. Up to 4086 conditions per place. 
[2024-06-14 15:52:55,506 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 292 selfloop transitions, 82 changer transitions 0/378 dead transitions.
[2024-06-14 15:52:55,506 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 378 transitions, 6951 flow
[2024-06-14 15:52:55,507 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:52:55,507 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:52:55,507 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions.
[2024-06-14 15:52:55,507 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-14 15:52:55,507 INFO  L175             Difference]: Start difference. First operand has 186 places, 328 transitions, 5513 flow. Second operand 8 states and 164 transitions.
[2024-06-14 15:52:55,507 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 378 transitions, 6951 flow
[2024-06-14 15:52:55,889 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 378 transitions, 6715 flow, removed 36 selfloop flow, removed 6 redundant places.
[2024-06-14 15:52:55,894 INFO  L231             Difference]: Finished difference. Result has 189 places, 337 transitions, 5750 flow
[2024-06-14 15:52:55,895 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5277, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5750, PETRI_PLACES=189, PETRI_TRANSITIONS=337}
[2024-06-14 15:52:55,895 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 147 predicate places.
[2024-06-14 15:52:55,895 INFO  L495      AbstractCegarLoop]: Abstraction has has 189 places, 337 transitions, 5750 flow
[2024-06-14 15:52:55,895 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:52:55,895 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:52:55,895 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:52:55,895 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-14 15:52:55,895 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-14 15:52:55,896 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:52:55,896 INFO  L85        PathProgramCache]: Analyzing trace with hash -366966048, now seen corresponding path program 1 times
[2024-06-14 15:52:55,896 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:52:55,896 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753905500]
[2024-06-14 15:52:55,896 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:52:55,896 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:52:55,964 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:53:07,158 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:53:07,159 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:53:07,159 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753905500]
[2024-06-14 15:53:07,159 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753905500] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:53:07,159 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:53:07,159 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:53:07,159 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098479061]
[2024-06-14 15:53:07,159 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:53:07,159 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:53:07,159 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:53:07,160 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:53:07,160 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:53:07,349 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:53:07,349 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 337 transitions, 5750 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-14 15:53:07,349 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:53:07,349 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:53:07,349 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:53:09,533 INFO  L124   PetriNetUnfolderBase]: 3795/5844 cut-off events.
[2024-06-14 15:53:09,533 INFO  L125   PetriNetUnfolderBase]: For 243541/243547 co-relation queries the response was YES.
[2024-06-14 15:53:09,570 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52741 conditions, 5844 events. 3795/5844 cut-off events. For 243541/243547 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 33249 event pairs, 728 based on Foata normal form. 73/5910 useless extension candidates. Maximal degree in co-relation 52645. Up to 4473 conditions per place. 
[2024-06-14 15:53:09,595 INFO  L140   encePairwiseOnDemand]: 26/41 looper letters, 274 selfloop transitions, 110 changer transitions 0/388 dead transitions.
[2024-06-14 15:53:09,596 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 388 transitions, 7087 flow
[2024-06-14 15:53:09,596 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:53:09,596 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:53:09,596 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions.
[2024-06-14 15:53:09,597 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4986449864498645
[2024-06-14 15:53:09,597 INFO  L175             Difference]: Start difference. First operand has 189 places, 337 transitions, 5750 flow. Second operand 9 states and 184 transitions.
[2024-06-14 15:53:09,597 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 388 transitions, 7087 flow
[2024-06-14 15:53:10,019 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 388 transitions, 6897 flow, removed 55 selfloop flow, removed 4 redundant places.
[2024-06-14 15:53:10,024 INFO  L231             Difference]: Finished difference. Result has 197 places, 350 transitions, 6251 flow
[2024-06-14 15:53:10,025 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5560, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6251, PETRI_PLACES=197, PETRI_TRANSITIONS=350}
[2024-06-14 15:53:10,025 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 155 predicate places.
[2024-06-14 15:53:10,025 INFO  L495      AbstractCegarLoop]: Abstraction has has 197 places, 350 transitions, 6251 flow
[2024-06-14 15:53:10,025 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-14 15:53:10,025 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:53:10,026 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:53:10,026 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-14 15:53:10,026 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-14 15:53:10,026 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:53:10,026 INFO  L85        PathProgramCache]: Analyzing trace with hash -1069473048, now seen corresponding path program 2 times
[2024-06-14 15:53:10,026 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:53:10,026 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557109158]
[2024-06-14 15:53:10,027 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:53:10,027 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:53:10,079 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:53:17,528 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:53:17,529 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:53:17,529 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557109158]
[2024-06-14 15:53:17,529 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557109158] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:53:17,529 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:53:17,529 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:53:17,529 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395057329]
[2024-06-14 15:53:17,529 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:53:17,529 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:53:17,529 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:53:17,529 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:53:17,529 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:53:17,817 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:53:17,818 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 350 transitions, 6251 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-14 15:53:17,818 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:53:17,818 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:53:17,818 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:53:20,112 INFO  L124   PetriNetUnfolderBase]: 4108/6386 cut-off events.
[2024-06-14 15:53:20,112 INFO  L125   PetriNetUnfolderBase]: For 269654/269663 co-relation queries the response was YES.
[2024-06-14 15:53:20,155 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58219 conditions, 6386 events. 4108/6386 cut-off events. For 269654/269663 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 37510 event pairs, 926 based on Foata normal form. 64/6445 useless extension candidates. Maximal degree in co-relation 58118. Up to 5526 conditions per place. 
[2024-06-14 15:53:20,185 INFO  L140   encePairwiseOnDemand]: 26/41 looper letters, 330 selfloop transitions, 81 changer transitions 0/415 dead transitions.
[2024-06-14 15:53:20,185 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 415 transitions, 7894 flow
[2024-06-14 15:53:20,187 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:53:20,187 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:53:20,188 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions.
[2024-06-14 15:53:20,188 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47317073170731705
[2024-06-14 15:53:20,188 INFO  L175             Difference]: Start difference. First operand has 197 places, 350 transitions, 6251 flow. Second operand 10 states and 194 transitions.
[2024-06-14 15:53:20,188 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 415 transitions, 7894 flow
[2024-06-14 15:53:20,722 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 415 transitions, 7614 flow, removed 47 selfloop flow, removed 6 redundant places.
[2024-06-14 15:53:20,728 INFO  L231             Difference]: Finished difference. Result has 203 places, 372 transitions, 6675 flow
[2024-06-14 15:53:20,728 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5982, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6675, PETRI_PLACES=203, PETRI_TRANSITIONS=372}
[2024-06-14 15:53:20,728 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 161 predicate places.
[2024-06-14 15:53:20,728 INFO  L495      AbstractCegarLoop]: Abstraction has has 203 places, 372 transitions, 6675 flow
[2024-06-14 15:53:20,728 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-14 15:53:20,728 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:53:20,728 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:53:20,729 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-14 15:53:20,729 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:53:20,729 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:53:20,729 INFO  L85        PathProgramCache]: Analyzing trace with hash -1063908858, now seen corresponding path program 3 times
[2024-06-14 15:53:20,729 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:53:20,729 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784807334]
[2024-06-14 15:53:20,729 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:53:20,730 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:53:20,789 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:53:27,934 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:53:27,935 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:53:27,935 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784807334]
[2024-06-14 15:53:27,935 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784807334] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:53:27,935 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:53:27,935 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:53:27,935 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525105172]
[2024-06-14 15:53:27,935 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:53:27,935 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:53:27,935 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:53:27,936 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:53:27,936 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:53:28,188 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:53:28,188 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 372 transitions, 6675 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-14 15:53:28,188 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:53:28,188 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:53:28,188 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:53:30,666 INFO  L124   PetriNetUnfolderBase]: 4333/6770 cut-off events.
[2024-06-14 15:53:30,666 INFO  L125   PetriNetUnfolderBase]: For 285006/285012 co-relation queries the response was YES.
[2024-06-14 15:53:30,707 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60639 conditions, 6770 events. 4333/6770 cut-off events. For 285006/285012 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 40310 event pairs, 985 based on Foata normal form. 59/6822 useless extension candidates. Maximal degree in co-relation 60535. Up to 5581 conditions per place. 
[2024-06-14 15:53:30,735 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 241 selfloop transitions, 174 changer transitions 0/419 dead transitions.
[2024-06-14 15:53:30,735 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 419 transitions, 8029 flow
[2024-06-14 15:53:30,735 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:53:30,736 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:53:30,736 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions.
[2024-06-14 15:53:30,736 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4926829268292683
[2024-06-14 15:53:30,736 INFO  L175             Difference]: Start difference. First operand has 203 places, 372 transitions, 6675 flow. Second operand 10 states and 202 transitions.
[2024-06-14 15:53:30,736 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 419 transitions, 8029 flow
[2024-06-14 15:53:31,239 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 419 transitions, 7819 flow, removed 72 selfloop flow, removed 4 redundant places.
[2024-06-14 15:53:31,245 INFO  L231             Difference]: Finished difference. Result has 209 places, 374 transitions, 6925 flow
[2024-06-14 15:53:31,245 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6465, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6925, PETRI_PLACES=209, PETRI_TRANSITIONS=374}
[2024-06-14 15:53:31,246 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 167 predicate places.
[2024-06-14 15:53:31,246 INFO  L495      AbstractCegarLoop]: Abstraction has has 209 places, 374 transitions, 6925 flow
[2024-06-14 15:53:31,246 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-14 15:53:31,246 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:53:31,246 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:53:31,246 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-14 15:53:31,246 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:53:31,247 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:53:31,247 INFO  L85        PathProgramCache]: Analyzing trace with hash -1063901418, now seen corresponding path program 4 times
[2024-06-14 15:53:31,247 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:53:31,247 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419678534]
[2024-06-14 15:53:31,247 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:53:31,247 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:53:31,306 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:53:39,245 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:53:39,245 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:53:39,245 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419678534]
[2024-06-14 15:53:39,245 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419678534] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:53:39,245 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:53:39,245 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:53:39,245 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567393284]
[2024-06-14 15:53:39,246 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:53:39,246 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:53:39,246 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:53:39,246 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:53:39,246 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:53:39,611 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:53:39,611 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 374 transitions, 6925 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-14 15:53:39,611 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:53:39,611 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:53:39,611 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:53:42,391 INFO  L124   PetriNetUnfolderBase]: 4994/7927 cut-off events.
[2024-06-14 15:53:42,392 INFO  L125   PetriNetUnfolderBase]: For 342751/342757 co-relation queries the response was YES.
[2024-06-14 15:53:42,453 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 70236 conditions, 7927 events. 4994/7927 cut-off events. For 342751/342757 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 49542 event pairs, 1093 based on Foata normal form. 49/7969 useless extension candidates. Maximal degree in co-relation 70131. Up to 4654 conditions per place. 
[2024-06-14 15:53:42,490 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 240 selfloop transitions, 189 changer transitions 0/433 dead transitions.
[2024-06-14 15:53:42,490 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 433 transitions, 8671 flow
[2024-06-14 15:53:42,491 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:53:42,491 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:53:42,491 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 209 transitions.
[2024-06-14 15:53:42,491 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5097560975609756
[2024-06-14 15:53:42,492 INFO  L175             Difference]: Start difference. First operand has 209 places, 374 transitions, 6925 flow. Second operand 10 states and 209 transitions.
[2024-06-14 15:53:42,492 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 433 transitions, 8671 flow
[2024-06-14 15:53:43,168 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 433 transitions, 8265 flow, removed 34 selfloop flow, removed 8 redundant places.
[2024-06-14 15:53:43,174 INFO  L231             Difference]: Finished difference. Result has 212 places, 380 transitions, 7217 flow
[2024-06-14 15:53:43,174 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6519, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=185, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7217, PETRI_PLACES=212, PETRI_TRANSITIONS=380}
[2024-06-14 15:53:43,175 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 170 predicate places.
[2024-06-14 15:53:43,175 INFO  L495      AbstractCegarLoop]: Abstraction has has 212 places, 380 transitions, 7217 flow
[2024-06-14 15:53:43,175 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-14 15:53:43,175 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:53:43,175 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:53:43,175 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-14 15:53:43,175 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:53:43,175 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:53:43,175 INFO  L85        PathProgramCache]: Analyzing trace with hash -1064110668, now seen corresponding path program 5 times
[2024-06-14 15:53:43,176 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:53:43,176 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923017259]
[2024-06-14 15:53:43,176 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:53:43,176 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:53:43,228 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:53:50,575 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:53:50,575 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:53:50,575 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923017259]
[2024-06-14 15:53:50,575 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923017259] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:53:50,575 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:53:50,575 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:53:50,575 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374943501]
[2024-06-14 15:53:50,575 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:53:50,575 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:53:50,575 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:53:50,576 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:53:50,576 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:53:50,731 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:53:50,731 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 380 transitions, 7217 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-14 15:53:50,731 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:53:50,731 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:53:50,731 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:53:53,498 INFO  L124   PetriNetUnfolderBase]: 5293/8449 cut-off events.
[2024-06-14 15:53:53,498 INFO  L125   PetriNetUnfolderBase]: For 387274/387283 co-relation queries the response was YES.
[2024-06-14 15:53:53,565 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 72874 conditions, 8449 events. 5293/8449 cut-off events. For 387274/387283 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 54537 event pairs, 1545 based on Foata normal form. 112/8556 useless extension candidates. Maximal degree in co-relation 72767. Up to 7124 conditions per place. 
[2024-06-14 15:53:53,600 INFO  L140   encePairwiseOnDemand]: 26/41 looper letters, 335 selfloop transitions, 88 changer transitions 0/427 dead transitions.
[2024-06-14 15:53:53,600 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 427 transitions, 8497 flow
[2024-06-14 15:53:53,601 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:53:53,601 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:53:53,601 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions.
[2024-06-14 15:53:53,601 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47804878048780486
[2024-06-14 15:53:53,601 INFO  L175             Difference]: Start difference. First operand has 212 places, 380 transitions, 7217 flow. Second operand 10 states and 196 transitions.
[2024-06-14 15:53:53,601 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 427 transitions, 8497 flow
[2024-06-14 15:53:54,542 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 427 transitions, 8197 flow, removed 43 selfloop flow, removed 6 redundant places.
[2024-06-14 15:53:54,548 INFO  L231             Difference]: Finished difference. Result has 216 places, 384 transitions, 7259 flow
[2024-06-14 15:53:54,548 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6917, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7259, PETRI_PLACES=216, PETRI_TRANSITIONS=384}
[2024-06-14 15:53:54,549 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 174 predicate places.
[2024-06-14 15:53:54,549 INFO  L495      AbstractCegarLoop]: Abstraction has has 216 places, 384 transitions, 7259 flow
[2024-06-14 15:53:54,549 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-14 15:53:54,549 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:53:54,549 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:53:54,549 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-14 15:53:54,549 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:53:54,550 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:53:54,550 INFO  L85        PathProgramCache]: Analyzing trace with hash 1738955048, now seen corresponding path program 4 times
[2024-06-14 15:53:54,550 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:53:54,550 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987078187]
[2024-06-14 15:53:54,550 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:53:54,550 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:53:54,596 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:54:03,071 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:54:03,072 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:54:03,072 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987078187]
[2024-06-14 15:54:03,072 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987078187] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:54:03,072 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:54:03,072 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:54:03,072 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80224555]
[2024-06-14 15:54:03,072 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:54:03,072 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:54:03,072 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:54:03,073 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:54:03,073 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:54:03,345 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:54:03,345 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 384 transitions, 7259 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:03,345 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:54:03,345 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:54:03,345 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:54:06,278 INFO  L124   PetriNetUnfolderBase]: 5446/8710 cut-off events.
[2024-06-14 15:54:06,279 INFO  L125   PetriNetUnfolderBase]: For 339863/339872 co-relation queries the response was YES.
[2024-06-14 15:54:06,335 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 75001 conditions, 8710 events. 5446/8710 cut-off events. For 339863/339872 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 56833 event pairs, 1623 based on Foata normal form. 22/8727 useless extension candidates. Maximal degree in co-relation 74892. Up to 7943 conditions per place. 
[2024-06-14 15:54:06,367 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 342 selfloop transitions, 92 changer transitions 0/438 dead transitions.
[2024-06-14 15:54:06,367 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 438 transitions, 8765 flow
[2024-06-14 15:54:06,368 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:54:06,368 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:54:06,368 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions.
[2024-06-14 15:54:06,368 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47560975609756095
[2024-06-14 15:54:06,368 INFO  L175             Difference]: Start difference. First operand has 216 places, 384 transitions, 7259 flow. Second operand 10 states and 195 transitions.
[2024-06-14 15:54:06,368 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 438 transitions, 8765 flow
[2024-06-14 15:54:07,173 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 438 transitions, 8441 flow, removed 95 selfloop flow, removed 7 redundant places.
[2024-06-14 15:54:07,182 INFO  L231             Difference]: Finished difference. Result has 220 places, 395 transitions, 7430 flow
[2024-06-14 15:54:07,183 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6936, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7430, PETRI_PLACES=220, PETRI_TRANSITIONS=395}
[2024-06-14 15:54:07,183 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 178 predicate places.
[2024-06-14 15:54:07,183 INFO  L495      AbstractCegarLoop]: Abstraction has has 220 places, 395 transitions, 7430 flow
[2024-06-14 15:54:07,183 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:07,184 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:54:07,184 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:54:07,184 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-14 15:54:07,184 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:54:07,184 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:54:07,185 INFO  L85        PathProgramCache]: Analyzing trace with hash 1738807178, now seen corresponding path program 5 times
[2024-06-14 15:54:07,185 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:54:07,185 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976931935]
[2024-06-14 15:54:07,185 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:54:07,185 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:54:07,237 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:54:15,145 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:54:15,145 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:54:15,145 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976931935]
[2024-06-14 15:54:15,145 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976931935] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:54:15,145 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:54:15,145 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:54:15,145 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162164082]
[2024-06-14 15:54:15,145 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:54:15,146 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:54:15,146 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:54:15,146 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:54:15,146 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:54:15,371 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:54:15,371 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 395 transitions, 7430 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:15,371 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:54:15,371 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:54:15,371 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:54:18,668 INFO  L124   PetriNetUnfolderBase]: 5925/9453 cut-off events.
[2024-06-14 15:54:18,668 INFO  L125   PetriNetUnfolderBase]: For 387679/387688 co-relation queries the response was YES.
[2024-06-14 15:54:18,735 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 81823 conditions, 9453 events. 5925/9453 cut-off events. For 387679/387688 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 62482 event pairs, 1637 based on Foata normal form. 22/9470 useless extension candidates. Maximal degree in co-relation 81714. Up to 7986 conditions per place. 
[2024-06-14 15:54:18,772 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 355 selfloop transitions, 102 changer transitions 0/461 dead transitions.
[2024-06-14 15:54:18,773 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 461 transitions, 9384 flow
[2024-06-14 15:54:18,773 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:54:18,773 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:54:18,773 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 200 transitions.
[2024-06-14 15:54:18,774 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4878048780487805
[2024-06-14 15:54:18,774 INFO  L175             Difference]: Start difference. First operand has 220 places, 395 transitions, 7430 flow. Second operand 10 states and 200 transitions.
[2024-06-14 15:54:18,774 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 461 transitions, 9384 flow
[2024-06-14 15:54:19,668 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 461 transitions, 9101 flow, removed 64 selfloop flow, removed 8 redundant places.
[2024-06-14 15:54:19,674 INFO  L231             Difference]: Finished difference. Result has 223 places, 410 transitions, 7826 flow
[2024-06-14 15:54:19,675 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7147, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7826, PETRI_PLACES=223, PETRI_TRANSITIONS=410}
[2024-06-14 15:54:19,675 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 181 predicate places.
[2024-06-14 15:54:19,675 INFO  L495      AbstractCegarLoop]: Abstraction has has 223 places, 410 transitions, 7826 flow
[2024-06-14 15:54:19,675 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:19,675 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:54:19,675 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:54:19,675 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-14 15:54:19,675 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-14 15:54:19,676 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:54:19,676 INFO  L85        PathProgramCache]: Analyzing trace with hash 1744317428, now seen corresponding path program 6 times
[2024-06-14 15:54:19,676 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:54:19,676 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123088010]
[2024-06-14 15:54:19,676 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:54:19,676 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:54:19,727 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:54:27,149 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:54:27,150 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:54:27,150 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123088010]
[2024-06-14 15:54:27,150 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123088010] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:54:27,150 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:54:27,150 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:54:27,150 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108064928]
[2024-06-14 15:54:27,150 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:54:27,150 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:54:27,150 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:54:27,151 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:54:27,151 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:54:27,389 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:54:27,389 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 410 transitions, 7826 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:27,389 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:54:27,389 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:54:27,389 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:54:30,619 INFO  L124   PetriNetUnfolderBase]: 5961/9513 cut-off events.
[2024-06-14 15:54:30,619 INFO  L125   PetriNetUnfolderBase]: For 400653/400662 co-relation queries the response was YES.
[2024-06-14 15:54:30,689 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 83168 conditions, 9513 events. 5961/9513 cut-off events. For 400653/400662 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 62904 event pairs, 1735 based on Foata normal form. 22/9530 useless extension candidates. Maximal degree in co-relation 83060. Up to 8744 conditions per place. 
[2024-06-14 15:54:30,730 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 352 selfloop transitions, 92 changer transitions 0/448 dead transitions.
[2024-06-14 15:54:30,730 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 448 transitions, 9137 flow
[2024-06-14 15:54:30,730 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:54:30,730 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:54:30,731 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions.
[2024-06-14 15:54:30,731 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4742547425474255
[2024-06-14 15:54:30,731 INFO  L175             Difference]: Start difference. First operand has 223 places, 410 transitions, 7826 flow. Second operand 9 states and 175 transitions.
[2024-06-14 15:54:30,731 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 448 transitions, 9137 flow
[2024-06-14 15:54:31,663 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 448 transitions, 8880 flow, removed 75 selfloop flow, removed 6 redundant places.
[2024-06-14 15:54:31,670 INFO  L231             Difference]: Finished difference. Result has 226 places, 413 transitions, 7917 flow
[2024-06-14 15:54:31,670 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7583, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7917, PETRI_PLACES=226, PETRI_TRANSITIONS=413}
[2024-06-14 15:54:31,671 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 184 predicate places.
[2024-06-14 15:54:31,671 INFO  L495      AbstractCegarLoop]: Abstraction has has 226 places, 413 transitions, 7917 flow
[2024-06-14 15:54:31,671 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:54:31,671 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:54:31,671 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:54:31,671 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-14 15:54:31,672 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-14 15:54:31,672 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:54:31,672 INFO  L85        PathProgramCache]: Analyzing trace with hash 219533688, now seen corresponding path program 6 times
[2024-06-14 15:54:31,672 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:54:31,672 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943677]
[2024-06-14 15:54:31,672 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:54:31,672 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:54:31,746 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:54:39,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-14 15:54:39,289 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:54:39,289 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943677]
[2024-06-14 15:54:39,289 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943677] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:54:39,289 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:54:39,289 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:54:39,289 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98257956]
[2024-06-14 15:54:39,289 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:54:39,290 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:54:39,290 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:54:39,290 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:54:39,290 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:54:39,510 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:54:39,510 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 413 transitions, 7917 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-14 15:54:39,510 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:54:39,510 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:54:39,510 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:54:42,580 INFO  L124   PetriNetUnfolderBase]: 6129/9807 cut-off events.
[2024-06-14 15:54:42,581 INFO  L125   PetriNetUnfolderBase]: For 428266/428266 co-relation queries the response was YES.
[2024-06-14 15:54:42,661 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 86269 conditions, 9807 events. 6129/9807 cut-off events. For 428266/428266 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 65355 event pairs, 1892 based on Foata normal form. 12/9816 useless extension candidates. Maximal degree in co-relation 86159. Up to 9091 conditions per place. 
[2024-06-14 15:54:42,705 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 394 selfloop transitions, 65 changer transitions 0/463 dead transitions.
[2024-06-14 15:54:42,705 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 463 transitions, 9315 flow
[2024-06-14 15:54:42,707 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 15:54:42,707 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:54:42,707 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 203 transitions.
[2024-06-14 15:54:42,708 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4501108647450111
[2024-06-14 15:54:42,708 INFO  L175             Difference]: Start difference. First operand has 226 places, 413 transitions, 7917 flow. Second operand 11 states and 203 transitions.
[2024-06-14 15:54:42,708 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 463 transitions, 9315 flow
[2024-06-14 15:54:43,713 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 463 transitions, 9013 flow, removed 48 selfloop flow, removed 7 redundant places.
[2024-06-14 15:54:43,720 INFO  L231             Difference]: Finished difference. Result has 231 places, 416 transitions, 7906 flow
[2024-06-14 15:54:43,720 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7615, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7906, PETRI_PLACES=231, PETRI_TRANSITIONS=416}
[2024-06-14 15:54:43,721 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 189 predicate places.
[2024-06-14 15:54:43,721 INFO  L495      AbstractCegarLoop]: Abstraction has has 231 places, 416 transitions, 7906 flow
[2024-06-14 15:54:43,721 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-14 15:54:43,721 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:54:43,721 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:54:43,721 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-14 15:54:43,721 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:54:43,722 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:54:43,722 INFO  L85        PathProgramCache]: Analyzing trace with hash 219526248, now seen corresponding path program 7 times
[2024-06-14 15:54:43,722 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:54:43,722 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906869792]
[2024-06-14 15:54:43,722 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:54:43,722 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:54:43,772 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:54:51,670 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:54:51,670 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:54:51,671 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906869792]
[2024-06-14 15:54:51,671 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906869792] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:54:51,671 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:54:51,671 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:54:51,671 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884852956]
[2024-06-14 15:54:51,671 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:54:51,671 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:54:51,671 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:54:51,671 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:54:51,671 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:54:51,869 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:54:51,869 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 416 transitions, 7906 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-14 15:54:51,869 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:54:51,870 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:54:51,870 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:54:55,037 INFO  L124   PetriNetUnfolderBase]: 6101/9763 cut-off events.
[2024-06-14 15:54:55,037 INFO  L125   PetriNetUnfolderBase]: For 430029/430029 co-relation queries the response was YES.
[2024-06-14 15:54:55,131 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 84959 conditions, 9763 events. 6101/9763 cut-off events. For 430029/430029 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 64993 event pairs, 1891 based on Foata normal form. 16/9776 useless extension candidates. Maximal degree in co-relation 84848. Up to 9262 conditions per place. 
[2024-06-14 15:54:55,177 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 392 selfloop transitions, 62 changer transitions 0/458 dead transitions.
[2024-06-14 15:54:55,177 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 458 transitions, 8960 flow
[2024-06-14 15:54:55,179 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 15:54:55,179 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:54:55,179 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 199 transitions.
[2024-06-14 15:54:55,179 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44124168514412415
[2024-06-14 15:54:55,179 INFO  L175             Difference]: Start difference. First operand has 231 places, 416 transitions, 7906 flow. Second operand 11 states and 199 transitions.
[2024-06-14 15:54:55,179 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 458 transitions, 8960 flow
[2024-06-14 15:54:56,405 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 458 transitions, 8738 flow, removed 52 selfloop flow, removed 8 redundant places.
[2024-06-14 15:54:56,412 INFO  L231             Difference]: Finished difference. Result has 234 places, 416 transitions, 7815 flow
[2024-06-14 15:54:56,412 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7684, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7815, PETRI_PLACES=234, PETRI_TRANSITIONS=416}
[2024-06-14 15:54:56,412 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 192 predicate places.
[2024-06-14 15:54:56,412 INFO  L495      AbstractCegarLoop]: Abstraction has has 234 places, 416 transitions, 7815 flow
[2024-06-14 15:54:56,413 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-14 15:54:56,413 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:54:56,413 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:54:56,413 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-14 15:54:56,413 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:54:56,413 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:54:56,413 INFO  L85        PathProgramCache]: Analyzing trace with hash 485230968, now seen corresponding path program 8 times
[2024-06-14 15:54:56,413 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:54:56,414 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277317565]
[2024-06-14 15:54:56,414 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:54:56,414 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:54:56,465 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:55:04,667 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:55:04,667 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:55:04,668 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277317565]
[2024-06-14 15:55:04,668 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277317565] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:55:04,668 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:55:04,668 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:55:04,668 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527748295]
[2024-06-14 15:55:04,668 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:55:04,668 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:55:04,668 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:55:04,669 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:55:04,669 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:55:04,906 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:55:04,907 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 416 transitions, 7815 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-14 15:55:04,907 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:55:04,907 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:55:04,907 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:55:08,087 INFO  L124   PetriNetUnfolderBase]: 6203/9937 cut-off events.
[2024-06-14 15:55:08,087 INFO  L125   PetriNetUnfolderBase]: For 449330/449330 co-relation queries the response was YES.
[2024-06-14 15:55:08,162 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 86601 conditions, 9937 events. 6203/9937 cut-off events. For 449330/449330 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 65950 event pairs, 1860 based on Foata normal form. 12/9946 useless extension candidates. Maximal degree in co-relation 86489. Up to 8384 conditions per place. 
[2024-06-14 15:55:08,204 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 358 selfloop transitions, 106 changer transitions 0/468 dead transitions.
[2024-06-14 15:55:08,204 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 468 transitions, 9251 flow
[2024-06-14 15:55:08,206 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 15:55:08,206 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:55:08,206 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions.
[2024-06-14 15:55:08,206 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523281596452328
[2024-06-14 15:55:08,206 INFO  L175             Difference]: Start difference. First operand has 234 places, 416 transitions, 7815 flow. Second operand 11 states and 204 transitions.
[2024-06-14 15:55:08,206 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 468 transitions, 9251 flow
[2024-06-14 15:55:09,198 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 468 transitions, 9128 flow, removed 1 selfloop flow, removed 9 redundant places.
[2024-06-14 15:55:09,205 INFO  L231             Difference]: Finished difference. Result has 237 places, 420 transitions, 8123 flow
[2024-06-14 15:55:09,206 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7692, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8123, PETRI_PLACES=237, PETRI_TRANSITIONS=420}
[2024-06-14 15:55:09,206 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 195 predicate places.
[2024-06-14 15:55:09,206 INFO  L495      AbstractCegarLoop]: Abstraction has has 237 places, 420 transitions, 8123 flow
[2024-06-14 15:55:09,206 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-14 15:55:09,206 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:55:09,206 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:55:09,207 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-14 15:55:09,207 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:55:09,207 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:55:09,207 INFO  L85        PathProgramCache]: Analyzing trace with hash 476026758, now seen corresponding path program 9 times
[2024-06-14 15:55:09,207 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:55:09,207 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136659680]
[2024-06-14 15:55:09,207 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:55:09,208 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:55:09,263 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:55:17,586 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:55:17,587 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:55:17,588 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136659680]
[2024-06-14 15:55:17,588 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136659680] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:55:17,589 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:55:17,589 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:55:17,589 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420218999]
[2024-06-14 15:55:17,589 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:55:17,589 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:55:17,590 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:55:17,590 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:55:17,590 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:55:17,890 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:55:17,890 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 420 transitions, 8123 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-14 15:55:17,890 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:55:17,890 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:55:17,890 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:55:21,226 INFO  L124   PetriNetUnfolderBase]: 6261/10035 cut-off events.
[2024-06-14 15:55:21,227 INFO  L125   PetriNetUnfolderBase]: For 475302/475302 co-relation queries the response was YES.
[2024-06-14 15:55:21,314 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 88313 conditions, 10035 events. 6261/10035 cut-off events. For 475302/475302 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 67364 event pairs, 1930 based on Foata normal form. 16/10048 useless extension candidates. Maximal degree in co-relation 88199. Up to 9362 conditions per place. 
[2024-06-14 15:55:21,362 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 383 selfloop transitions, 86 changer transitions 0/473 dead transitions.
[2024-06-14 15:55:21,362 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 473 transitions, 9337 flow
[2024-06-14 15:55:21,364 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2024-06-14 15:55:21,365 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2024-06-14 15:55:21,365 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 232 transitions.
[2024-06-14 15:55:21,365 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4352720450281426
[2024-06-14 15:55:21,365 INFO  L175             Difference]: Start difference. First operand has 237 places, 420 transitions, 8123 flow. Second operand 13 states and 232 transitions.
[2024-06-14 15:55:21,365 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 473 transitions, 9337 flow
[2024-06-14 15:55:22,567 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 473 transitions, 9192 flow, removed 40 selfloop flow, removed 6 redundant places.
[2024-06-14 15:55:22,574 INFO  L231             Difference]: Finished difference. Result has 244 places, 423 transitions, 8279 flow
[2024-06-14 15:55:22,575 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7990, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=8279, PETRI_PLACES=244, PETRI_TRANSITIONS=423}
[2024-06-14 15:55:22,575 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 202 predicate places.
[2024-06-14 15:55:22,575 INFO  L495      AbstractCegarLoop]: Abstraction has has 244 places, 423 transitions, 8279 flow
[2024-06-14 15:55:22,576 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-14 15:55:22,576 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:55:22,576 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:55:22,576 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-14 15:55:22,576 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:55:22,577 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:55:22,577 INFO  L85        PathProgramCache]: Analyzing trace with hash 1738961000, now seen corresponding path program 10 times
[2024-06-14 15:55:22,577 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:55:22,577 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106970512]
[2024-06-14 15:55:22,577 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:55:22,577 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:55:22,631 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:55:31,428 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:55:31,428 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:55:31,428 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106970512]
[2024-06-14 15:55:31,429 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106970512] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:55:31,429 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:55:31,429 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:55:31,429 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796628041]
[2024-06-14 15:55:31,429 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:55:31,429 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:55:31,429 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:55:31,429 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:55:31,429 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:55:31,583 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:55:31,584 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 423 transitions, 8279 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-14 15:55:31,584 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:55:31,584 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:55:31,584 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:55:35,223 INFO  L124   PetriNetUnfolderBase]: 6451/10336 cut-off events.
[2024-06-14 15:55:35,223 INFO  L125   PetriNetUnfolderBase]: For 499650/499659 co-relation queries the response was YES.
[2024-06-14 15:55:35,309 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 91112 conditions, 10336 events. 6451/10336 cut-off events. For 499650/499659 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 69714 event pairs, 1845 based on Foata normal form. 28/10359 useless extension candidates. Maximal degree in co-relation 90996. Up to 9465 conditions per place. 
[2024-06-14 15:55:35,355 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 373 selfloop transitions, 107 changer transitions 0/484 dead transitions.
[2024-06-14 15:55:35,356 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 484 transitions, 9935 flow
[2024-06-14 15:55:35,356 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 15:55:35,356 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:55:35,356 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 215 transitions.
[2024-06-14 15:55:35,357 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47671840354767187
[2024-06-14 15:55:35,357 INFO  L175             Difference]: Start difference. First operand has 244 places, 423 transitions, 8279 flow. Second operand 11 states and 215 transitions.
[2024-06-14 15:55:35,357 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 484 transitions, 9935 flow
[2024-06-14 15:55:36,917 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 484 transitions, 9697 flow, removed 28 selfloop flow, removed 12 redundant places.
[2024-06-14 15:55:36,925 INFO  L231             Difference]: Finished difference. Result has 244 places, 437 transitions, 8647 flow
[2024-06-14 15:55:36,925 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8051, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8647, PETRI_PLACES=244, PETRI_TRANSITIONS=437}
[2024-06-14 15:55:36,925 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 202 predicate places.
[2024-06-14 15:55:36,925 INFO  L495      AbstractCegarLoop]: Abstraction has has 244 places, 437 transitions, 8647 flow
[2024-06-14 15:55:36,925 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-14 15:55:36,926 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:55:36,926 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:55:36,926 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-14 15:55:36,926 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-14 15:55:36,926 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:55:36,926 INFO  L85        PathProgramCache]: Analyzing trace with hash 476034198, now seen corresponding path program 11 times
[2024-06-14 15:55:36,926 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:55:36,926 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070220553]
[2024-06-14 15:55:36,927 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:55:36,927 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:55:36,976 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:55:45,056 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:55:45,057 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:55:45,057 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070220553]
[2024-06-14 15:55:45,057 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070220553] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:55:45,057 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:55:45,057 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:55:45,057 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367225411]
[2024-06-14 15:55:45,057 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:55:45,057 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:55:45,058 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:55:45,058 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:55:45,058 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:55:45,219 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:55:45,220 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 437 transitions, 8647 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-14 15:55:45,220 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:55:45,220 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:55:45,220 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:55:48,689 INFO  L124   PetriNetUnfolderBase]: 6492/10407 cut-off events.
[2024-06-14 15:55:48,689 INFO  L125   PetriNetUnfolderBase]: For 500316/500316 co-relation queries the response was YES.
[2024-06-14 15:55:48,769 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 93582 conditions, 10407 events. 6492/10407 cut-off events. For 500316/500316 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 70272 event pairs, 1952 based on Foata normal form. 12/10416 useless extension candidates. Maximal degree in co-relation 93465. Up to 9701 conditions per place. 
[2024-06-14 15:55:48,813 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 383 selfloop transitions, 96 changer transitions 0/483 dead transitions.
[2024-06-14 15:55:48,814 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 483 transitions, 9845 flow
[2024-06-14 15:55:48,816 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 15:55:48,816 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:55:48,816 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions.
[2024-06-14 15:55:48,817 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44789356984478934
[2024-06-14 15:55:48,817 INFO  L175             Difference]: Start difference. First operand has 244 places, 437 transitions, 8647 flow. Second operand 11 states and 202 transitions.
[2024-06-14 15:55:48,817 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 483 transitions, 9845 flow
[2024-06-14 15:55:50,019 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 483 transitions, 9521 flow, removed 97 selfloop flow, removed 6 redundant places.
[2024-06-14 15:55:50,027 INFO  L231             Difference]: Finished difference. Result has 249 places, 438 transitions, 8579 flow
[2024-06-14 15:55:50,027 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8323, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8579, PETRI_PLACES=249, PETRI_TRANSITIONS=438}
[2024-06-14 15:55:50,027 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 207 predicate places.
[2024-06-14 15:55:50,027 INFO  L495      AbstractCegarLoop]: Abstraction has has 249 places, 438 transitions, 8579 flow
[2024-06-14 15:55:50,028 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-14 15:55:50,028 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:55:50,028 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:55:50,028 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-14 15:55:50,028 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-14 15:55:50,028 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:55:50,029 INFO  L85        PathProgramCache]: Analyzing trace with hash 1744525190, now seen corresponding path program 12 times
[2024-06-14 15:55:50,029 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:55:50,029 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682493952]
[2024-06-14 15:55:50,029 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:55:50,029 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:55:50,092 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:55:58,451 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:55:58,451 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:55:58,451 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682493952]
[2024-06-14 15:55:58,451 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682493952] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:55:58,451 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:55:58,451 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:55:58,451 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991896588]
[2024-06-14 15:55:58,451 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:55:58,451 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:55:58,452 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:55:58,452 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:55:58,452 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:55:58,663 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:55:58,664 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 438 transitions, 8579 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-14 15:55:58,664 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:55:58,664 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:55:58,664 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:56:02,434 INFO  L124   PetriNetUnfolderBase]: 6856/11038 cut-off events.
[2024-06-14 15:56:02,435 INFO  L125   PetriNetUnfolderBase]: For 572170/572176 co-relation queries the response was YES.
[2024-06-14 15:56:02,522 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 96136 conditions, 11038 events. 6856/11038 cut-off events. For 572170/572176 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 75367 event pairs, 1966 based on Foata normal form. 59/11090 useless extension candidates. Maximal degree in co-relation 96018. Up to 9286 conditions per place. 
[2024-06-14 15:56:02,569 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 295 selfloop transitions, 183 changer transitions 0/482 dead transitions.
[2024-06-14 15:56:02,569 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 482 transitions, 9986 flow
[2024-06-14 15:56:02,569 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:56:02,569 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:56:02,570 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions.
[2024-06-14 15:56:02,571 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48292682926829267
[2024-06-14 15:56:02,571 INFO  L175             Difference]: Start difference. First operand has 249 places, 438 transitions, 8579 flow. Second operand 10 states and 198 transitions.
[2024-06-14 15:56:02,571 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 482 transitions, 9986 flow
[2024-06-14 15:56:03,800 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 482 transitions, 9750 flow, removed 24 selfloop flow, removed 8 redundant places.
[2024-06-14 15:56:03,807 INFO  L231             Difference]: Finished difference. Result has 251 places, 440 transitions, 8845 flow
[2024-06-14 15:56:03,808 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8343, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=181, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8845, PETRI_PLACES=251, PETRI_TRANSITIONS=440}
[2024-06-14 15:56:03,808 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 209 predicate places.
[2024-06-14 15:56:03,808 INFO  L495      AbstractCegarLoop]: Abstraction has has 251 places, 440 transitions, 8845 flow
[2024-06-14 15:56:03,809 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-14 15:56:03,809 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:56:03,809 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:56:03,809 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-14 15:56:03,809 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-14 15:56:03,809 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:56:03,809 INFO  L85        PathProgramCache]: Analyzing trace with hash 1744532630, now seen corresponding path program 13 times
[2024-06-14 15:56:03,810 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:56:03,810 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822019336]
[2024-06-14 15:56:03,810 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:56:03,810 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:56:03,866 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:56:12,566 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:56:12,566 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:56:12,566 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822019336]
[2024-06-14 15:56:12,566 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822019336] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:56:12,566 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:56:12,566 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:56:12,566 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182830070]
[2024-06-14 15:56:12,566 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:56:12,566 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:56:12,567 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:56:12,567 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:56:12,567 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:56:12,856 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:56:12,856 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 440 transitions, 8845 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-14 15:56:12,856 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:56:12,856 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:56:12,856 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:56:16,988 INFO  L124   PetriNetUnfolderBase]: 7732/12602 cut-off events.
[2024-06-14 15:56:16,988 INFO  L125   PetriNetUnfolderBase]: For 656855/656861 co-relation queries the response was YES.
[2024-06-14 15:56:17,082 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 108664 conditions, 12602 events. 7732/12602 cut-off events. For 656855/656861 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 89770 event pairs, 2095 based on Foata normal form. 49/12644 useless extension candidates. Maximal degree in co-relation 108545. Up to 8032 conditions per place. 
[2024-06-14 15:56:17,131 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 282 selfloop transitions, 207 changer transitions 0/493 dead transitions.
[2024-06-14 15:56:17,131 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 493 transitions, 10598 flow
[2024-06-14 15:56:17,131 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:56:17,131 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:56:17,132 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions.
[2024-06-14 15:56:17,132 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-14 15:56:17,132 INFO  L175             Difference]: Start difference. First operand has 251 places, 440 transitions, 8845 flow. Second operand 10 states and 205 transitions.
[2024-06-14 15:56:17,132 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 493 transitions, 10598 flow
[2024-06-14 15:56:18,630 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 493 transitions, 10172 flow, removed 37 selfloop flow, removed 8 redundant places.
[2024-06-14 15:56:18,638 INFO  L231             Difference]: Finished difference. Result has 253 places, 443 transitions, 9023 flow
[2024-06-14 15:56:18,638 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8419, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9023, PETRI_PLACES=253, PETRI_TRANSITIONS=443}
[2024-06-14 15:56:18,638 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 211 predicate places.
[2024-06-14 15:56:18,638 INFO  L495      AbstractCegarLoop]: Abstraction has has 253 places, 443 transitions, 9023 flow
[2024-06-14 15:56:18,638 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-14 15:56:18,639 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:56:18,639 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:56:18,639 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-14 15:56:18,639 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-14 15:56:18,639 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:56:18,639 INFO  L85        PathProgramCache]: Analyzing trace with hash 1744323380, now seen corresponding path program 14 times
[2024-06-14 15:56:18,639 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:56:18,639 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873146193]
[2024-06-14 15:56:18,640 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:56:18,640 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:56:18,697 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:56:27,086 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:56:27,086 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:56:27,086 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873146193]
[2024-06-14 15:56:27,086 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873146193] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:56:27,087 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:56:27,087 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:56:27,087 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28613520]
[2024-06-14 15:56:27,087 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:56:27,087 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:56:27,087 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:56:27,087 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:56:27,087 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:56:27,317 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:56:27,317 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 443 transitions, 9023 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-14 15:56:27,317 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:56:27,317 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:56:27,317 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:56:31,956 INFO  L124   PetriNetUnfolderBase]: 7926/12937 cut-off events.
[2024-06-14 15:56:31,956 INFO  L125   PetriNetUnfolderBase]: For 689382/689391 co-relation queries the response was YES.
[2024-06-14 15:56:32,051 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 111029 conditions, 12937 events. 7926/12937 cut-off events. For 689382/689391 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 93691 event pairs, 2674 based on Foata normal form. 64/12996 useless extension candidates. Maximal degree in co-relation 110909. Up to 11432 conditions per place. 
[2024-06-14 15:56:32,099 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 383 selfloop transitions, 104 changer transitions 0/491 dead transitions.
[2024-06-14 15:56:32,099 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 491 transitions, 10526 flow
[2024-06-14 15:56:32,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:56:32,100 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:56:32,100 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions.
[2024-06-14 15:56:32,100 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47560975609756095
[2024-06-14 15:56:32,100 INFO  L175             Difference]: Start difference. First operand has 253 places, 443 transitions, 9023 flow. Second operand 10 states and 195 transitions.
[2024-06-14 15:56:32,100 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 491 transitions, 10526 flow
[2024-06-14 15:56:33,598 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 491 transitions, 10165 flow, removed 43 selfloop flow, removed 7 redundant places.
[2024-06-14 15:56:33,605 INFO  L231             Difference]: Finished difference. Result has 257 places, 449 transitions, 9106 flow
[2024-06-14 15:56:33,606 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8668, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9106, PETRI_PLACES=257, PETRI_TRANSITIONS=449}
[2024-06-14 15:56:33,606 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 215 predicate places.
[2024-06-14 15:56:33,606 INFO  L495      AbstractCegarLoop]: Abstraction has has 257 places, 449 transitions, 9106 flow
[2024-06-14 15:56:33,606 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-14 15:56:33,606 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:56:33,606 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:56:33,606 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-14 15:56:33,606 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:56:33,606 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:56:33,607 INFO  L85        PathProgramCache]: Analyzing trace with hash 1683531138, now seen corresponding path program 1 times
[2024-06-14 15:56:33,607 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:56:33,607 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394605380]
[2024-06-14 15:56:33,607 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:56:33,607 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:56:33,633 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:56:47,338 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:56:47,339 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:56:47,339 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394605380]
[2024-06-14 15:56:47,339 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394605380] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:56:47,339 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:56:47,339 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:56:47,339 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402696330]
[2024-06-14 15:56:47,339 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:56:47,339 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:56:47,339 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:56:47,339 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:56:47,340 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:56:47,434 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:56:47,435 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 449 transitions, 9106 flow. Second operand  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:47,435 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:56:47,435 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:56:47,435 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:56:51,409 INFO  L124   PetriNetUnfolderBase]: 7914/12922 cut-off events.
[2024-06-14 15:56:51,409 INFO  L125   PetriNetUnfolderBase]: For 634284/634290 co-relation queries the response was YES.
[2024-06-14 15:56:51,519 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 110895 conditions, 12922 events. 7914/12922 cut-off events. For 634284/634290 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 93891 event pairs, 2804 based on Foata normal form. 5/12920 useless extension candidates. Maximal degree in co-relation 110773. Up to 12548 conditions per place. 
[2024-06-14 15:56:51,571 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 435 selfloop transitions, 24 changer transitions 0/463 dead transitions.
[2024-06-14 15:56:51,571 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 463 transitions, 10148 flow
[2024-06-14 15:56:51,572 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:56:51,572 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:56:51,572 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions.
[2024-06-14 15:56:51,572 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-14 15:56:51,572 INFO  L175             Difference]: Start difference. First operand has 257 places, 449 transitions, 9106 flow. Second operand 6 states and 108 transitions.
[2024-06-14 15:56:51,572 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 463 transitions, 10148 flow
[2024-06-14 15:56:53,350 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 463 transitions, 9858 flow, removed 57 selfloop flow, removed 7 redundant places.
[2024-06-14 15:56:53,357 INFO  L231             Difference]: Finished difference. Result has 256 places, 452 transitions, 8943 flow
[2024-06-14 15:56:53,357 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8816, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8943, PETRI_PLACES=256, PETRI_TRANSITIONS=452}
[2024-06-14 15:56:53,358 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 214 predicate places.
[2024-06-14 15:56:53,358 INFO  L495      AbstractCegarLoop]: Abstraction has has 256 places, 452 transitions, 8943 flow
[2024-06-14 15:56:53,358 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:56:53,358 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:56:53,358 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:56:53,358 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-14 15:56:53,358 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:56:53,358 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:56:53,358 INFO  L85        PathProgramCache]: Analyzing trace with hash 1624783188, now seen corresponding path program 1 times
[2024-06-14 15:56:53,358 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:56:53,358 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950543903]
[2024-06-14 15:56:53,358 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:56:53,359 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:56:53,391 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:57:02,955 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:57:02,955 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:57:02,955 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950543903]
[2024-06-14 15:57:02,955 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950543903] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:57:02,955 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:57:02,955 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:57:02,955 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171841587]
[2024-06-14 15:57:02,955 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:57:02,956 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:57:02,956 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:57:02,956 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:57:02,956 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:57:03,103 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:57:03,103 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 452 transitions, 8943 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:03,103 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:57:03,103 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:57:03,103 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:57:06,823 INFO  L124   PetriNetUnfolderBase]: 7911/12914 cut-off events.
[2024-06-14 15:57:06,824 INFO  L125   PetriNetUnfolderBase]: For 646483/646483 co-relation queries the response was YES.
[2024-06-14 15:57:06,962 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 111397 conditions, 12914 events. 7911/12914 cut-off events. For 646483/646483 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 93651 event pairs, 2757 based on Foata normal form. 1/12912 useless extension candidates. Maximal degree in co-relation 111274. Up to 12499 conditions per place. 
[2024-06-14 15:57:07,021 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 452 selfloop transitions, 44 changer transitions 0/500 dead transitions.
[2024-06-14 15:57:07,021 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 500 transitions, 10837 flow
[2024-06-14 15:57:07,022 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:57:07,022 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:57:07,022 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions.
[2024-06-14 15:57:07,022 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44947735191637633
[2024-06-14 15:57:07,022 INFO  L175             Difference]: Start difference. First operand has 256 places, 452 transitions, 8943 flow. Second operand 7 states and 129 transitions.
[2024-06-14 15:57:07,022 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 500 transitions, 10837 flow
[2024-06-14 15:57:08,971 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 500 transitions, 10742 flow, removed 23 selfloop flow, removed 4 redundant places.
[2024-06-14 15:57:08,979 INFO  L231             Difference]: Finished difference. Result has 262 places, 479 transitions, 9756 flow
[2024-06-14 15:57:08,979 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8854, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9756, PETRI_PLACES=262, PETRI_TRANSITIONS=479}
[2024-06-14 15:57:08,979 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 220 predicate places.
[2024-06-14 15:57:08,980 INFO  L495      AbstractCegarLoop]: Abstraction has has 262 places, 479 transitions, 9756 flow
[2024-06-14 15:57:08,980 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:08,980 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:57:08,980 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:57:08,980 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-14 15:57:08,980 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:57:08,980 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:57:08,981 INFO  L85        PathProgramCache]: Analyzing trace with hash -511585402, now seen corresponding path program 1 times
[2024-06-14 15:57:08,981 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:57:08,981 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554009596]
[2024-06-14 15:57:08,981 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:57:08,981 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:57:09,017 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:57:18,625 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:57:18,626 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:57:18,626 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554009596]
[2024-06-14 15:57:18,626 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554009596] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:57:18,626 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:57:18,626 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:57:18,626 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048802012]
[2024-06-14 15:57:18,626 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:57:18,626 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:57:18,626 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:57:18,626 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:57:18,627 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:57:18,797 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:57:18,798 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 479 transitions, 9756 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:18,798 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:57:18,798 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:57:18,798 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:57:23,025 INFO  L124   PetriNetUnfolderBase]: 7973/13007 cut-off events.
[2024-06-14 15:57:23,025 INFO  L125   PetriNetUnfolderBase]: For 678981/678990 co-relation queries the response was YES.
[2024-06-14 15:57:23,143 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 113336 conditions, 13007 events. 7973/13007 cut-off events. For 678981/678990 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 94283 event pairs, 2762 based on Foata normal form. 18/13020 useless extension candidates. Maximal degree in co-relation 113209. Up to 12517 conditions per place. 
[2024-06-14 15:57:23,198 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 457 selfloop transitions, 62 changer transitions 0/523 dead transitions.
[2024-06-14 15:57:23,198 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 523 transitions, 11343 flow
[2024-06-14 15:57:23,199 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:57:23,199 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:57:23,199 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions.
[2024-06-14 15:57:23,199 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-14 15:57:23,199 INFO  L175             Difference]: Start difference. First operand has 262 places, 479 transitions, 9756 flow. Second operand 8 states and 144 transitions.
[2024-06-14 15:57:23,199 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 523 transitions, 11343 flow
[2024-06-14 15:57:25,350 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 523 transitions, 11219 flow, removed 61 selfloop flow, removed 1 redundant places.
[2024-06-14 15:57:25,357 INFO  L231             Difference]: Finished difference. Result has 270 places, 502 transitions, 10222 flow
[2024-06-14 15:57:25,358 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9632, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10222, PETRI_PLACES=270, PETRI_TRANSITIONS=502}
[2024-06-14 15:57:25,358 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 228 predicate places.
[2024-06-14 15:57:25,358 INFO  L495      AbstractCegarLoop]: Abstraction has has 270 places, 502 transitions, 10222 flow
[2024-06-14 15:57:25,358 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:25,358 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:57:25,358 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:57:25,358 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-14 15:57:25,359 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:57:25,359 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:57:25,359 INFO  L85        PathProgramCache]: Analyzing trace with hash 1683299940, now seen corresponding path program 2 times
[2024-06-14 15:57:25,359 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:57:25,359 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620741363]
[2024-06-14 15:57:25,359 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:57:25,359 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:57:25,519 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:57:34,187 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:57:34,188 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:57:34,188 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620741363]
[2024-06-14 15:57:34,188 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620741363] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:57:34,188 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:57:34,188 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:57:34,188 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740514081]
[2024-06-14 15:57:34,188 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:57:34,188 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:57:34,188 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:57:34,188 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:57:34,189 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:57:34,314 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:57:34,314 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 502 transitions, 10222 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:34,314 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:57:34,314 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:57:34,315 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:57:38,234 INFO  L124   PetriNetUnfolderBase]: 7715/12521 cut-off events.
[2024-06-14 15:57:38,234 INFO  L125   PetriNetUnfolderBase]: For 672306/672315 co-relation queries the response was YES.
[2024-06-14 15:57:38,353 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 109332 conditions, 12521 events. 7715/12521 cut-off events. For 672306/672315 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 89518 event pairs, 2584 based on Foata normal form. 18/12534 useless extension candidates. Maximal degree in co-relation 109201. Up to 11981 conditions per place. 
[2024-06-14 15:57:38,403 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 437 selfloop transitions, 75 changer transitions 4/520 dead transitions.
[2024-06-14 15:57:38,403 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 520 transitions, 11438 flow
[2024-06-14 15:57:38,403 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:57:38,403 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:57:38,404 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions.
[2024-06-14 15:57:38,404 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4529616724738676
[2024-06-14 15:57:38,404 INFO  L175             Difference]: Start difference. First operand has 270 places, 502 transitions, 10222 flow. Second operand 7 states and 130 transitions.
[2024-06-14 15:57:38,404 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 520 transitions, 11438 flow
[2024-06-14 15:57:40,384 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 520 transitions, 11282 flow, removed 52 selfloop flow, removed 3 redundant places.
[2024-06-14 15:57:40,392 INFO  L231             Difference]: Finished difference. Result has 275 places, 500 transitions, 10242 flow
[2024-06-14 15:57:40,393 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10068, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10242, PETRI_PLACES=275, PETRI_TRANSITIONS=500}
[2024-06-14 15:57:40,393 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 233 predicate places.
[2024-06-14 15:57:40,393 INFO  L495      AbstractCegarLoop]: Abstraction has has 275 places, 500 transitions, 10242 flow
[2024-06-14 15:57:40,393 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:40,393 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:57:40,393 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:57:40,394 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-14 15:57:40,394 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:57:40,394 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:57:40,394 INFO  L85        PathProgramCache]: Analyzing trace with hash 1683537090, now seen corresponding path program 3 times
[2024-06-14 15:57:40,394 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:57:40,394 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930749948]
[2024-06-14 15:57:40,394 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:57:40,395 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:57:40,590 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:57:50,111 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:57:50,112 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:57:50,112 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930749948]
[2024-06-14 15:57:50,112 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930749948] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:57:50,112 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:57:50,112 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:57:50,112 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873586568]
[2024-06-14 15:57:50,112 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:57:50,112 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:57:50,112 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:57:50,113 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:57:50,113 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:57:50,266 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:57:50,267 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 500 transitions, 10242 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:50,267 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:57:50,267 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:57:50,267 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:57:54,210 INFO  L124   PetriNetUnfolderBase]: 7435/12027 cut-off events.
[2024-06-14 15:57:54,211 INFO  L125   PetriNetUnfolderBase]: For 658980/658989 co-relation queries the response was YES.
[2024-06-14 15:57:54,303 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 105508 conditions, 12027 events. 7435/12027 cut-off events. For 658980/658989 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 84743 event pairs, 2489 based on Foata normal form. 12/12034 useless extension candidates. Maximal degree in co-relation 105375. Up to 11711 conditions per place. 
[2024-06-14 15:57:54,345 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 470 selfloop transitions, 23 changer transitions 14/511 dead transitions.
[2024-06-14 15:57:54,346 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 511 transitions, 11317 flow
[2024-06-14 15:57:54,346 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:57:54,346 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:57:54,346 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions.
[2024-06-14 15:57:54,347 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43089430894308944
[2024-06-14 15:57:54,347 INFO  L175             Difference]: Start difference. First operand has 275 places, 500 transitions, 10242 flow. Second operand 6 states and 106 transitions.
[2024-06-14 15:57:54,347 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 511 transitions, 11317 flow
[2024-06-14 15:57:56,520 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 511 transitions, 11158 flow, removed 22 selfloop flow, removed 4 redundant places.
[2024-06-14 15:57:56,528 INFO  L231             Difference]: Finished difference. Result has 277 places, 487 transitions, 9920 flow
[2024-06-14 15:57:56,528 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10086, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=9920, PETRI_PLACES=277, PETRI_TRANSITIONS=487}
[2024-06-14 15:57:56,529 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 235 predicate places.
[2024-06-14 15:57:56,529 INFO  L495      AbstractCegarLoop]: Abstraction has has 277 places, 487 transitions, 9920 flow
[2024-06-14 15:57:56,529 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:57:56,529 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:57:56,529 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:57:56,529 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-14 15:57:56,529 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:57:56,530 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:57:56,530 INFO  L85        PathProgramCache]: Analyzing trace with hash 1683546018, now seen corresponding path program 1 times
[2024-06-14 15:57:56,530 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:57:56,530 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034091659]
[2024-06-14 15:57:56,530 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:57:56,530 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:57:56,563 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:58:08,122 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:58:08,122 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:58:08,122 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034091659]
[2024-06-14 15:58:08,122 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034091659] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:58:08,122 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:58:08,123 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:58:08,123 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886622539]
[2024-06-14 15:58:08,123 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:58:08,123 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:58:08,123 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:58:08,123 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:58:08,123 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:58:08,276 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:58:08,276 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 487 transitions, 9920 flow. Second operand  has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 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-14 15:58:08,276 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:58:08,276 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:58:08,276 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:58:12,127 INFO  L124   PetriNetUnfolderBase]: 7069/11438 cut-off events.
[2024-06-14 15:58:12,128 INFO  L125   PetriNetUnfolderBase]: For 675950/675956 co-relation queries the response was YES.
[2024-06-14 15:58:12,245 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 101593 conditions, 11438 events. 7069/11438 cut-off events. For 675950/675956 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 79390 event pairs, 2366 based on Foata normal form. 15/11446 useless extension candidates. Maximal degree in co-relation 101459. Up to 11059 conditions per place. 
[2024-06-14 15:58:12,298 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 475 selfloop transitions, 26 changer transitions 0/505 dead transitions.
[2024-06-14 15:58:12,298 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 505 transitions, 11103 flow
[2024-06-14 15:58:12,299 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:58:12,299 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:58:12,299 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions.
[2024-06-14 15:58:12,299 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45121951219512196
[2024-06-14 15:58:12,299 INFO  L175             Difference]: Start difference. First operand has 277 places, 487 transitions, 9920 flow. Second operand 6 states and 111 transitions.
[2024-06-14 15:58:12,299 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 505 transitions, 11103 flow
[2024-06-14 15:58:14,674 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 505 transitions, 10941 flow, removed 63 selfloop flow, removed 4 redundant places.
[2024-06-14 15:58:14,682 INFO  L231             Difference]: Finished difference. Result has 279 places, 490 transitions, 9891 flow
[2024-06-14 15:58:14,682 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9760, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=9891, PETRI_PLACES=279, PETRI_TRANSITIONS=490}
[2024-06-14 15:58:14,682 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 237 predicate places.
[2024-06-14 15:58:14,682 INFO  L495      AbstractCegarLoop]: Abstraction has has 279 places, 490 transitions, 9891 flow
[2024-06-14 15:58:14,682 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 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-14 15:58:14,682 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:58:14,682 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:58:14,683 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-14 15:58:14,683 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-14 15:58:14,683 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:58:14,683 INFO  L85        PathProgramCache]: Analyzing trace with hash -1241351379, now seen corresponding path program 1 times
[2024-06-14 15:58:14,683 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:58:14,683 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184719745]
[2024-06-14 15:58:14,683 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:58:14,683 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:58:14,755 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:58:22,945 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:58:22,945 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:58:22,945 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184719745]
[2024-06-14 15:58:22,945 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184719745] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:58:22,945 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:58:22,946 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:58:22,946 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073235124]
[2024-06-14 15:58:22,946 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:58:22,946 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:58:22,946 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:58:22,946 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:58:22,946 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:58:23,123 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:58:23,124 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 490 transitions, 9891 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-14 15:58:23,124 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:58:23,124 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:58:23,124 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:58:27,664 INFO  L124   PetriNetUnfolderBase]: 7511/12168 cut-off events.
[2024-06-14 15:58:27,664 INFO  L125   PetriNetUnfolderBase]: For 792708/792714 co-relation queries the response was YES.
[2024-06-14 15:58:27,788 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 107948 conditions, 12168 events. 7511/12168 cut-off events. For 792708/792714 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 85143 event pairs, 2177 based on Foata normal form. 61/12222 useless extension candidates. Maximal degree in co-relation 107813. Up to 10851 conditions per place. 
[2024-06-14 15:58:27,839 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 501 selfloop transitions, 52 changer transitions 0/557 dead transitions.
[2024-06-14 15:58:27,840 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 557 transitions, 12162 flow
[2024-06-14 15:58:27,840 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:58:27,840 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:58:27,840 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions.
[2024-06-14 15:58:27,840 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-14 15:58:27,840 INFO  L175             Difference]: Start difference. First operand has 279 places, 490 transitions, 9891 flow. Second operand 10 states and 205 transitions.
[2024-06-14 15:58:27,841 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 557 transitions, 12162 flow
[2024-06-14 15:58:30,051 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 557 transitions, 12082 flow, removed 15 selfloop flow, removed 4 redundant places.
[2024-06-14 15:58:30,059 INFO  L231             Difference]: Finished difference. Result has 289 places, 506 transitions, 10466 flow
[2024-06-14 15:58:30,059 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9820, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10466, PETRI_PLACES=289, PETRI_TRANSITIONS=506}
[2024-06-14 15:58:30,059 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 247 predicate places.
[2024-06-14 15:58:30,059 INFO  L495      AbstractCegarLoop]: Abstraction has has 289 places, 506 transitions, 10466 flow
[2024-06-14 15:58:30,060 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-14 15:58:30,060 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:58:30,060 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:58:30,060 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-14 15:58:30,060 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-14 15:58:30,060 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:58:30,060 INFO  L85        PathProgramCache]: Analyzing trace with hash -704144829, now seen corresponding path program 2 times
[2024-06-14 15:58:30,060 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:58:30,060 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163883300]
[2024-06-14 15:58:30,060 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:58:30,060 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:58:30,116 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:58:39,016 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:58:39,016 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:58:39,016 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163883300]
[2024-06-14 15:58:39,016 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163883300] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:58:39,016 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:58:39,016 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:58:39,016 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799501098]
[2024-06-14 15:58:39,016 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:58:39,016 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:58:39,017 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:58:39,017 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:58:39,017 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:58:39,387 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:58:39,387 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 506 transitions, 10466 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-14 15:58:39,387 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:58:39,387 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:58:39,387 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:58:44,004 INFO  L124   PetriNetUnfolderBase]: 8116/13125 cut-off events.
[2024-06-14 15:58:44,004 INFO  L125   PetriNetUnfolderBase]: For 931400/931406 co-relation queries the response was YES.
[2024-06-14 15:58:44,164 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 120212 conditions, 13125 events. 8116/13125 cut-off events. For 931400/931406 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 93860 event pairs, 2542 based on Foata normal form. 61/13179 useless extension candidates. Maximal degree in co-relation 120072. Up to 11454 conditions per place. 
[2024-06-14 15:58:44,225 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 460 selfloop transitions, 112 changer transitions 0/576 dead transitions.
[2024-06-14 15:58:44,225 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 576 transitions, 12897 flow
[2024-06-14 15:58:44,226 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:58:44,226 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:58:44,226 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 204 transitions.
[2024-06-14 15:58:44,226 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4975609756097561
[2024-06-14 15:58:44,226 INFO  L175             Difference]: Start difference. First operand has 289 places, 506 transitions, 10466 flow. Second operand 10 states and 204 transitions.
[2024-06-14 15:58:44,226 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 576 transitions, 12897 flow
[2024-06-14 15:58:46,796 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 576 transitions, 12644 flow, removed 115 selfloop flow, removed 3 redundant places.
[2024-06-14 15:58:46,805 INFO  L231             Difference]: Finished difference. Result has 299 places, 527 transitions, 11215 flow
[2024-06-14 15:58:46,806 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10213, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11215, PETRI_PLACES=299, PETRI_TRANSITIONS=527}
[2024-06-14 15:58:46,806 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 257 predicate places.
[2024-06-14 15:58:46,806 INFO  L495      AbstractCegarLoop]: Abstraction has has 299 places, 527 transitions, 11215 flow
[2024-06-14 15:58:46,806 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-14 15:58:46,806 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:58:46,806 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:58:46,806 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-14 15:58:46,806 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:58:46,807 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:58:46,807 INFO  L85        PathProgramCache]: Analyzing trace with hash 1201421981, now seen corresponding path program 3 times
[2024-06-14 15:58:46,807 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:58:46,807 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462039249]
[2024-06-14 15:58:46,807 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:58:46,807 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:58:46,867 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:58:54,625 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:58:54,626 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:58:54,626 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462039249]
[2024-06-14 15:58:54,626 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462039249] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:58:54,626 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:58:54,626 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:58:54,626 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902135884]
[2024-06-14 15:58:54,626 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:58:54,626 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:58:54,626 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:58:54,627 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:58:54,627 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:58:54,889 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-14 15:58:54,889 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 527 transitions, 11215 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-14 15:58:54,889 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:58:54,889 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-14 15:58:54,889 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:58:59,640 INFO  L124   PetriNetUnfolderBase]: 8285/13433 cut-off events.
[2024-06-14 15:58:59,640 INFO  L125   PetriNetUnfolderBase]: For 950757/950766 co-relation queries the response was YES.
[2024-06-14 15:58:59,778 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 123242 conditions, 13433 events. 8285/13433 cut-off events. For 950757/950766 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 96687 event pairs, 2844 based on Foata normal form. 54/13482 useless extension candidates. Maximal degree in co-relation 123097. Up to 12524 conditions per place. 
[2024-06-14 15:58:59,836 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 481 selfloop transitions, 73 changer transitions 15/573 dead transitions.
[2024-06-14 15:58:59,836 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 573 transitions, 12756 flow
[2024-06-14 15:58:59,836 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:58:59,837 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:58:59,837 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 204 transitions.
[2024-06-14 15:58:59,837 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4975609756097561
[2024-06-14 15:58:59,837 INFO  L175             Difference]: Start difference. First operand has 299 places, 527 transitions, 11215 flow. Second operand 10 states and 204 transitions.
[2024-06-14 15:58:59,837 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 573 transitions, 12756 flow
[2024-06-14 15:59:02,629 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 573 transitions, 12491 flow, removed 116 selfloop flow, removed 4 redundant places.
[2024-06-14 15:59:02,637 INFO  L231             Difference]: Finished difference. Result has 306 places, 524 transitions, 11127 flow
[2024-06-14 15:59:02,638 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10950, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11127, PETRI_PLACES=306, PETRI_TRANSITIONS=524}
[2024-06-14 15:59:02,638 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 264 predicate places.
[2024-06-14 15:59:02,638 INFO  L495      AbstractCegarLoop]: Abstraction has has 306 places, 524 transitions, 11127 flow
[2024-06-14 15:59:02,638 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-14 15:59:02,638 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:02,639 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:59:02,639 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-14 15:59:02,639 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:59:02,639 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:02,639 INFO  L85        PathProgramCache]: Analyzing trace with hash 1201306661, now seen corresponding path program 4 times
[2024-06-14 15:59:02,639 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:02,639 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219295615]
[2024-06-14 15:59:02,639 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:02,640 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:02,700 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:10,347 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:59:10,347 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:10,347 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219295615]
[2024-06-14 15:59:10,347 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219295615] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:10,347 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:10,347 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:59:10,347 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019037090]
[2024-06-14 15:59:10,348 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:10,348 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:59:10,348 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:10,348 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:59:10,348 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:59:10,764 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-14 15:59:10,765 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 524 transitions, 11127 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-14 15:59:10,765 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:10,765 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-14 15:59:10,765 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:15,656 INFO  L124   PetriNetUnfolderBase]: 8235/13381 cut-off events.
[2024-06-14 15:59:15,657 INFO  L125   PetriNetUnfolderBase]: For 972781/972790 co-relation queries the response was YES.
[2024-06-14 15:59:15,817 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 122412 conditions, 13381 events. 8235/13381 cut-off events. For 972781/972790 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 96571 event pairs, 2724 based on Foata normal form. 54/13430 useless extension candidates. Maximal degree in co-relation 122264. Up to 12007 conditions per place. 
[2024-06-14 15:59:15,888 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 493 selfloop transitions, 80 changer transitions 0/577 dead transitions.
[2024-06-14 15:59:15,888 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 577 transitions, 12880 flow
[2024-06-14 15:59:15,889 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:59:15,889 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:59:15,904 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 208 transitions.
[2024-06-14 15:59:15,904 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5073170731707317
[2024-06-14 15:59:15,904 INFO  L175             Difference]: Start difference. First operand has 306 places, 524 transitions, 11127 flow. Second operand 10 states and 208 transitions.
[2024-06-14 15:59:15,904 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 577 transitions, 12880 flow
[2024-06-14 15:59:19,088 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 577 transitions, 12587 flow, removed 79 selfloop flow, removed 7 redundant places.
[2024-06-14 15:59:19,097 INFO  L231             Difference]: Finished difference. Result has 311 places, 528 transitions, 11206 flow
[2024-06-14 15:59:19,097 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10834, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11206, PETRI_PLACES=311, PETRI_TRANSITIONS=528}
[2024-06-14 15:59:19,098 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 269 predicate places.
[2024-06-14 15:59:19,098 INFO  L495      AbstractCegarLoop]: Abstraction has has 311 places, 528 transitions, 11206 flow
[2024-06-14 15:59:19,098 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-14 15:59:19,098 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:19,098 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:59:19,098 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-14 15:59:19,098 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:59:19,098 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:19,098 INFO  L85        PathProgramCache]: Analyzing trace with hash -1926967097, now seen corresponding path program 5 times
[2024-06-14 15:59:19,099 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:19,099 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616033581]
[2024-06-14 15:59:19,099 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:19,099 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:19,153 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:27,844 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:59:27,844 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:27,844 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616033581]
[2024-06-14 15:59:27,844 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616033581] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:27,844 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:27,844 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:59:27,844 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131863493]
[2024-06-14 15:59:27,844 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:27,845 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:59:27,845 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:27,845 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:59:27,845 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:59:28,192 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:59:28,192 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 528 transitions, 11206 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-14 15:59:28,192 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:28,192 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:59:28,193 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:33,968 INFO  L124   PetriNetUnfolderBase]: 8413/13697 cut-off events.
[2024-06-14 15:59:33,968 INFO  L125   PetriNetUnfolderBase]: For 1005245/1005254 co-relation queries the response was YES.
[2024-06-14 15:59:34,240 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 124888 conditions, 13697 events. 8413/13697 cut-off events. For 1005245/1005254 co-relation queries the response was YES. Maximal size of possible extension queue 710. Compared 99417 event pairs, 2904 based on Foata normal form. 54/13746 useless extension candidates. Maximal degree in co-relation 124738. Up to 12436 conditions per place. 
[2024-06-14 15:59:34,680 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 453 selfloop transitions, 125 changer transitions 1/583 dead transitions.
[2024-06-14 15:59:34,680 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 583 transitions, 13039 flow
[2024-06-14 15:59:34,681 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 15:59:34,681 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:59:34,681 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 217 transitions.
[2024-06-14 15:59:34,681 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4811529933481153
[2024-06-14 15:59:34,682 INFO  L175             Difference]: Start difference. First operand has 311 places, 528 transitions, 11206 flow. Second operand 11 states and 217 transitions.
[2024-06-14 15:59:34,682 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 583 transitions, 13039 flow
[2024-06-14 15:59:38,191 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 583 transitions, 12790 flow, removed 56 selfloop flow, removed 7 redundant places.
[2024-06-14 15:59:38,201 INFO  L231             Difference]: Finished difference. Result has 315 places, 529 transitions, 11343 flow
[2024-06-14 15:59:38,201 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10957, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11343, PETRI_PLACES=315, PETRI_TRANSITIONS=529}
[2024-06-14 15:59:38,201 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 273 predicate places.
[2024-06-14 15:59:38,201 INFO  L495      AbstractCegarLoop]: Abstraction has has 315 places, 529 transitions, 11343 flow
[2024-06-14 15:59:38,202 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-14 15:59:38,202 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:38,202 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:59:38,202 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-14 15:59:38,202 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:59:38,203 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:38,203 INFO  L85        PathProgramCache]: Analyzing trace with hash -1931551067, now seen corresponding path program 6 times
[2024-06-14 15:59:38,203 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:38,203 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222085615]
[2024-06-14 15:59:38,203 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:38,203 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:38,264 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:59:48,675 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:59:48,675 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:59:48,675 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222085615]
[2024-06-14 15:59:48,675 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222085615] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:59:48,676 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:59:48,676 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:59:48,676 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889780291]
[2024-06-14 15:59:48,676 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:59:48,676 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:59:48,676 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:59:48,676 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:59:48,676 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:59:48,954 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 15:59:48,955 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 529 transitions, 11343 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-14 15:59:48,955 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:59:48,955 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 15:59:48,955 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:59:54,716 INFO  L124   PetriNetUnfolderBase]: 8706/14209 cut-off events.
[2024-06-14 15:59:54,716 INFO  L125   PetriNetUnfolderBase]: For 1042597/1042603 co-relation queries the response was YES.
[2024-06-14 15:59:54,874 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 128532 conditions, 14209 events. 8706/14209 cut-off events. For 1042597/1042603 co-relation queries the response was YES. Maximal size of possible extension queue 733. Compared 104259 event pairs, 2870 based on Foata normal form. 49/14251 useless extension candidates. Maximal degree in co-relation 128381. Up to 11882 conditions per place. 
[2024-06-14 15:59:54,937 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 425 selfloop transitions, 161 changer transitions 0/590 dead transitions.
[2024-06-14 15:59:54,937 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 590 transitions, 13390 flow
[2024-06-14 15:59:54,938 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 15:59:54,938 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:59:54,938 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 224 transitions.
[2024-06-14 15:59:54,938 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49667405764966743
[2024-06-14 15:59:54,939 INFO  L175             Difference]: Start difference. First operand has 315 places, 529 transitions, 11343 flow. Second operand 11 states and 224 transitions.
[2024-06-14 15:59:54,939 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 590 transitions, 13390 flow
[2024-06-14 15:59:58,149 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 590 transitions, 13020 flow, removed 63 selfloop flow, removed 9 redundant places.
[2024-06-14 15:59:58,158 INFO  L231             Difference]: Finished difference. Result has 317 places, 531 transitions, 11457 flow
[2024-06-14 15:59:58,158 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10983, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11457, PETRI_PLACES=317, PETRI_TRANSITIONS=531}
[2024-06-14 15:59:58,159 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 275 predicate places.
[2024-06-14 15:59:58,159 INFO  L495      AbstractCegarLoop]: Abstraction has has 317 places, 531 transitions, 11457 flow
[2024-06-14 15:59:58,159 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-14 15:59:58,159 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:59:58,159 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:59:58,159 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-14 15:59:58,159 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-14 15:59:58,160 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:59:58,160 INFO  L85        PathProgramCache]: Analyzing trace with hash -1760733317, now seen corresponding path program 7 times
[2024-06-14 15:59:58,160 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:59:58,160 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979712660]
[2024-06-14 15:59:58,160 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:59:58,160 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:59:58,214 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:00:07,982 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:00:07,983 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:00:07,983 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979712660]
[2024-06-14 16:00:07,983 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979712660] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:00:07,983 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:00:07,983 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:00:07,983 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996994389]
[2024-06-14 16:00:07,983 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:00:07,983 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:00:07,983 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:00:07,983 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:00:07,983 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:00:08,173 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 16:00:08,173 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 531 transitions, 11457 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-14 16:00:08,174 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:00:08,174 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 16:00:08,174 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:00:13,815 INFO  L124   PetriNetUnfolderBase]: 8823/14413 cut-off events.
[2024-06-14 16:00:13,815 INFO  L125   PetriNetUnfolderBase]: For 1026030/1026039 co-relation queries the response was YES.
[2024-06-14 16:00:13,976 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 129155 conditions, 14413 events. 8823/14413 cut-off events. For 1026030/1026039 co-relation queries the response was YES. Maximal size of possible extension queue 750. Compared 106111 event pairs, 3147 based on Foata normal form. 54/14462 useless extension candidates. Maximal degree in co-relation 129003. Up to 12994 conditions per place. 
[2024-06-14 16:00:14,036 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 441 selfloop transitions, 131 changer transitions 1/577 dead transitions.
[2024-06-14 16:00:14,036 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 577 transitions, 13078 flow
[2024-06-14 16:00:14,040 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:00:14,040 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:00:14,040 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions.
[2024-06-14 16:00:14,041 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48048780487804876
[2024-06-14 16:00:14,042 INFO  L175             Difference]: Start difference. First operand has 317 places, 531 transitions, 11457 flow. Second operand 10 states and 197 transitions.
[2024-06-14 16:00:14,042 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 577 transitions, 13078 flow
[2024-06-14 16:00:17,370 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 577 transitions, 12722 flow, removed 54 selfloop flow, removed 7 redundant places.
[2024-06-14 16:00:17,379 INFO  L231             Difference]: Finished difference. Result has 320 places, 531 transitions, 11430 flow
[2024-06-14 16:00:17,379 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=11101, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11430, PETRI_PLACES=320, PETRI_TRANSITIONS=531}
[2024-06-14 16:00:17,379 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 278 predicate places.
[2024-06-14 16:00:17,380 INFO  L495      AbstractCegarLoop]: Abstraction has has 320 places, 531 transitions, 11430 flow
[2024-06-14 16:00:17,380 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-14 16:00:17,380 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:00:17,380 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:00:17,380 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-14 16:00:17,380 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:00:17,381 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:00:17,381 INFO  L85        PathProgramCache]: Analyzing trace with hash 1316907669, now seen corresponding path program 1 times
[2024-06-14 16:00:17,381 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:00:17,381 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28686829]
[2024-06-14 16:00:17,381 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:00:17,381 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:00:17,418 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:00:27,400 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:00:27,401 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:00:27,401 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28686829]
[2024-06-14 16:00:27,401 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28686829] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:00:27,401 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:00:27,401 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:00:27,401 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368278850]
[2024-06-14 16:00:27,401 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:00:27,401 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:00:27,401 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:00:27,402 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:00:27,402 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:00:27,595 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 16:00:27,598 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 531 transitions, 11430 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:27,598 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:00:27,598 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 16:00:27,599 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:00:32,383 INFO  L124   PetriNetUnfolderBase]: 8826/14413 cut-off events.
[2024-06-14 16:00:32,383 INFO  L125   PetriNetUnfolderBase]: For 963622/963622 co-relation queries the response was YES.
[2024-06-14 16:00:32,534 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 128917 conditions, 14413 events. 8826/14413 cut-off events. For 963622/963622 co-relation queries the response was YES. Maximal size of possible extension queue 750. Compared 105828 event pairs, 3371 based on Foata normal form. 1/14411 useless extension candidates. Maximal degree in co-relation 128764. Up to 13963 conditions per place. 
[2024-06-14 16:00:32,589 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 500 selfloop transitions, 75 changer transitions 1/580 dead transitions.
[2024-06-14 16:00:32,590 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 580 transitions, 13619 flow
[2024-06-14 16:00:32,590 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:00:32,590 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:00:32,591 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions.
[2024-06-14 16:00:32,591 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4603658536585366
[2024-06-14 16:00:32,591 INFO  L175             Difference]: Start difference. First operand has 320 places, 531 transitions, 11430 flow. Second operand 8 states and 151 transitions.
[2024-06-14 16:00:32,591 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 580 transitions, 13619 flow
[2024-06-14 16:00:36,203 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 580 transitions, 13167 flow, removed 61 selfloop flow, removed 9 redundant places.
[2024-06-14 16:00:36,353 INFO  L231             Difference]: Finished difference. Result has 323 places, 550 transitions, 11775 flow
[2024-06-14 16:00:36,354 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10984, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11775, PETRI_PLACES=323, PETRI_TRANSITIONS=550}
[2024-06-14 16:00:36,354 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 281 predicate places.
[2024-06-14 16:00:36,354 INFO  L495      AbstractCegarLoop]: Abstraction has has 323 places, 550 transitions, 11775 flow
[2024-06-14 16:00:36,354 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:36,354 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:00:36,354 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:00:36,355 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-14 16:00:36,355 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:00:36,355 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:00:36,355 INFO  L85        PathProgramCache]: Analyzing trace with hash 1316997879, now seen corresponding path program 2 times
[2024-06-14 16:00:36,355 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:00:36,355 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448286846]
[2024-06-14 16:00:36,355 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:00:36,355 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:00:36,392 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:00:47,076 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:00:47,077 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:00:47,077 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448286846]
[2024-06-14 16:00:47,077 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448286846] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:00:47,077 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:00:47,077 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:00:47,077 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110438762]
[2024-06-14 16:00:47,077 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:00:47,077 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:00:47,077 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:00:47,077 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:00:47,078 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:00:47,220 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-14 16:00:47,220 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 550 transitions, 11775 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:00:47,220 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:00:47,220 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-14 16:00:47,220 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:00:52,120 INFO  L124   PetriNetUnfolderBase]: 8793/14359 cut-off events.
[2024-06-14 16:00:52,121 INFO  L125   PetriNetUnfolderBase]: For 979225/979225 co-relation queries the response was YES.
[2024-06-14 16:00:52,302 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 128728 conditions, 14359 events. 8793/14359 cut-off events. For 979225/979225 co-relation queries the response was YES. Maximal size of possible extension queue 746. Compared 105372 event pairs, 3371 based on Foata normal form. 1/14357 useless extension candidates. Maximal degree in co-relation 128571. Up to 13960 conditions per place. 
[2024-06-14 16:00:52,359 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 514 selfloop transitions, 56 changer transitions 0/574 dead transitions.
[2024-06-14 16:00:52,359 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 574 transitions, 13275 flow
[2024-06-14 16:00:52,359 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:00:52,360 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:00:52,360 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions.
[2024-06-14 16:00:52,360 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-14 16:00:52,360 INFO  L175             Difference]: Start difference. First operand has 323 places, 550 transitions, 11775 flow. Second operand 8 states and 144 transitions.
[2024-06-14 16:00:52,360 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 574 transitions, 13275 flow