./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe031_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version bcb38a6f
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe031_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m
[2024-06-04 18:12:13,778 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-04 18:12:13,848 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-04 18:12:13,854 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-04 18:12:13,855 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-04 18:12:13,889 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-04 18:12:13,890 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-04 18:12:13,890 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-04 18:12:13,891 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-04 18:12:13,894 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-04 18:12:13,895 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-04 18:12:13,895 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-04 18:12:13,896 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-04 18:12:13,897 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-04 18:12:13,897 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-04 18:12:13,898 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-04 18:12:13,898 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-04 18:12:13,898 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-04 18:12:13,898 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-04 18:12:13,899 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-04 18:12:13,899 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-04 18:12:13,899 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-04 18:12:13,900 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-04 18:12:13,900 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-04 18:12:13,900 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-04 18:12:13,900 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-04 18:12:13,901 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-04 18:12:13,901 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-04 18:12:13,901 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-04 18:12:13,902 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-04 18:12:13,903 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-04 18:12:13,903 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-04 18:12:13,903 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 18:12:13,903 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-04 18:12:13,903 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-04 18:12:13,904 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-04 18:12:13,904 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-04 18:12:13,904 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-04 18:12:13,904 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-04 18:12:13,905 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-04 18:12:13,905 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-04 18:12:13,905 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-04 18:12:13,905 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-04 18:12:13,905 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-04 18:12:14,162 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-04 18:12:14,189 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-04 18:12:14,192 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-04 18:12:14,192 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-04 18:12:14,193 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-04 18:12:14,194 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/safe031_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml
[2024-06-04 18:12:14,453 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-04 18:12:14,453 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-04 18:12:14,454 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-04 18:12:15,584 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-04 18:12:15,913 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-04 18:12:15,917 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-04 18:12:15,941 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7766e65a8/fed16ff36a474a499288b5510ebda8e5/FLAGfc39e375b
[2024-06-04 18:12:15,958 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7766e65a8/fed16ff36a474a499288b5510ebda8e5
[2024-06-04 18:12:15,959 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-04 18:12:15,960 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-04 18:12:15,963 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-04 18:12:15,963 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-04 18:12:15,967 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-04 18:12:15,968 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:12:14" (1/2) ...
[2024-06-04 18:12:15,969 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24536bcd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:12:15, skipping insertion in model container
[2024-06-04 18:12:15,969 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:12:14" (1/2) ...
[2024-06-04 18:12:15,971 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@78b97bae and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:12:15, skipping insertion in model container
[2024-06-04 18:12:15,971 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 06:12:15" (2/2) ...
[2024-06-04 18:12:15,972 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24536bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:12:15, skipping insertion in model container
[2024-06-04 18:12:15,972 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 06:12:15" (2/2) ...
[2024-06-04 18:12:15,972 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-04 18:12:16,064 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-04 18:12:16,065 INFO  L97    edCorrectnessWitness]: Location invariant before [L832-L832] (((((((((((((((((! 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 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! 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_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )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 || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && z <= 2) && z <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((y == 0 || y == 1) || y == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))
[2024-06-04 18:12:16,066 INFO  L97    edCorrectnessWitness]: Location invariant before [L834-L834] (((((((((((((((((! 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 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! 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_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )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 || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && z <= 2) && z <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((y == 0 || y == 1) || y == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))
[2024-06-04 18:12:16,067 INFO  L97    edCorrectnessWitness]: Location invariant before [L835-L835] (((((((((((((((((! 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 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! 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_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )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 || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && z <= 2) && z <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((y == 0 || y == 1) || y == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))
[2024-06-04 18:12:16,068 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-04 18:12:16,068 INFO  L106   edCorrectnessWitness]: ghost_update [L830-L830] multithreaded = 1;
[2024-06-04 18:12:16,119 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-04 18:12:16,470 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 18:12:16,487 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-04 18:12:16,859 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 18:12:16,907 INFO  L206         MainTranslator]: Completed translation
[2024-06-04 18:12:16,907 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:12:16 WrapperNode
[2024-06-04 18:12:16,908 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-04 18:12:16,909 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-04 18:12:16,909 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-04 18:12:16,909 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-04 18:12:16,916 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:12:16" (1/1) ...
[2024-06-04 18:12:16,966 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:12:16" (1/1) ...
[2024-06-04 18:12:17,184 INFO  L138                Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 124
[2024-06-04 18:12:17,184 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-04 18:12:17,186 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-04 18:12:17,187 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-04 18:12:17,187 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-04 18:12:17,199 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:12:16" (1/1) ...
[2024-06-04 18:12:17,205 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:12:16" (1/1) ...
[2024-06-04 18:12:17,356 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:12:16" (1/1) ...
[2024-06-04 18:12:17,466 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-04 18:12:17,466 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:12:16" (1/1) ...
[2024-06-04 18:12:17,466 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:12:16" (1/1) ...
[2024-06-04 18:12:17,517 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:12:16" (1/1) ...
[2024-06-04 18:12:17,519 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:12:16" (1/1) ...
[2024-06-04 18:12:17,541 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:12:16" (1/1) ...
[2024-06-04 18:12:17,547 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:12:16" (1/1) ...
[2024-06-04 18:12:17,565 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-04 18:12:17,567 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-04 18:12:17,567 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-04 18:12:17,567 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-04 18:12:17,568 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:12:16" (1/1) ...
[2024-06-04 18:12:17,573 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 18:12:17,581 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-04 18:12:17,593 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-04 18:12:17,612 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-04 18:12:17,636 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-04 18:12:17,637 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-04 18:12:17,637 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-04 18:12:17,637 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-04 18:12:17,638 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-04 18:12:17,638 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-04 18:12:17,638 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-04 18:12:17,638 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-04 18:12:17,638 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-04 18:12:17,638 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-04 18:12:17,639 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-04 18:12:17,639 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-04 18:12:17,640 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-04 18:12:17,776 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-04 18:12:17,778 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-04 18:12:19,114 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-04 18:12:19,115 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-04 18:12:19,450 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-04 18:12:19,450 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-04 18:12:19,451 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 06:12:19 BoogieIcfgContainer
[2024-06-04 18:12:19,451 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-04 18:12:19,453 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-04 18:12:19,454 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-04 18:12:19,457 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-04 18:12:19,457 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:12:14" (1/4) ...
[2024-06-04 18:12:19,458 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692dfe17 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 06:12:19, skipping insertion in model container
[2024-06-04 18:12:19,458 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 06:12:15" (2/4) ...
[2024-06-04 18:12:19,459 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692dfe17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 06:12:19, skipping insertion in model container
[2024-06-04 18:12:19,459 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:12:16" (3/4) ...
[2024-06-04 18:12:19,459 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692dfe17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 06:12:19, skipping insertion in model container
[2024-06-04 18:12:19,459 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 06:12:19" (4/4) ...
[2024-06-04 18:12:19,461 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe031_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-04 18:12:19,478 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-04 18:12:19,479 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-04 18:12:19,479 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-04 18:12:19,618 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-04 18:12:19,653 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow
[2024-06-04 18:12:19,716 INFO  L124   PetriNetUnfolderBase]: 0/39 cut-off events.
[2024-06-04 18:12:19,716 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 18:12:19,719 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-04 18:12:19,720 INFO  L82        GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow
[2024-06-04 18:12:19,725 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow
[2024-06-04 18:12:19,739 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-04 18:12:19,746 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;@44bf4439, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-04 18:12:19,747 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-04 18:12:19,758 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-04 18:12:19,759 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-04 18:12:19,759 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 18:12:19,759 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:19,760 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:19,760 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-04 18:12:19,766 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:19,766 INFO  L85        PathProgramCache]: Analyzing trace with hash -1673967918, now seen corresponding path program 1 times
[2024-06-04 18:12:19,777 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:19,778 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356655344]
[2024-06-04 18:12:19,778 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:19,779 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:20,170 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:25,895 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:25,895 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:25,896 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356655344]
[2024-06-04 18:12:25,897 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356655344] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:25,897 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:25,897 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-04 18:12:25,899 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26895042]
[2024-06-04 18:12:25,899 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:25,907 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-04 18:12:25,911 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:25,939 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-04 18:12:25,940 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-04 18:12:26,015 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-04 18:12:26,018 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand  has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:26,018 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:26,018 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-04 18:12:26,019 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:27,116 INFO  L124   PetriNetUnfolderBase]: 1359/2058 cut-off events.
[2024-06-04 18:12:27,116 INFO  L125   PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES.
[2024-06-04 18:12:27,122 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4174 conditions, 2058 events. 1359/2058 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9772 event pairs, 941 based on Foata normal form. 1/2024 useless extension candidates. Maximal degree in co-relation 4159. Up to 2029 conditions per place. 
[2024-06-04 18:12:27,133 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 34 selfloop transitions, 4 changer transitions 0/43 dead transitions.
[2024-06-04 18:12:27,133 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 177 flow
[2024-06-04 18:12:27,135 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-04 18:12:27,137 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-04 18:12:27,143 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions.
[2024-06-04 18:12:27,144 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5873015873015873
[2024-06-04 18:12:27,146 INFO  L175             Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 74 transitions.
[2024-06-04 18:12:27,147 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 177 flow
[2024-06-04 18:12:27,149 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-04 18:12:27,151 INFO  L231             Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow
[2024-06-04 18:12:27,153 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=36}
[2024-06-04 18:12:27,157 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places.
[2024-06-04 18:12:27,157 INFO  L495      AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow
[2024-06-04 18:12:27,157 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:27,157 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:27,158 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:27,158 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-04 18:12:27,158 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-04 18:12:27,159 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:27,159 INFO  L85        PathProgramCache]: Analyzing trace with hash 1929611761, now seen corresponding path program 1 times
[2024-06-04 18:12:27,159 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:27,159 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983430547]
[2024-06-04 18:12:27,159 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:27,160 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:27,230 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:31,724 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:31,725 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:31,725 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983430547]
[2024-06-04 18:12:31,725 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983430547] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:31,726 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:31,726 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-04 18:12:31,726 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183803218]
[2024-06-04 18:12:31,726 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:31,728 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-04 18:12:31,728 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:31,729 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-04 18:12:31,729 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-04 18:12:31,846 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-04 18:12:31,847 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 102 flow. Second operand  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:31,847 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:31,847 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-04 18:12:31,847 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:32,820 INFO  L124   PetriNetUnfolderBase]: 1353/2049 cut-off events.
[2024-06-04 18:12:32,820 INFO  L125   PetriNetUnfolderBase]: For 397/397 co-relation queries the response was YES.
[2024-06-04 18:12:32,824 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4707 conditions, 2049 events. 1353/2049 cut-off events. For 397/397 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9796 event pairs, 795 based on Foata normal form. 3/2051 useless extension candidates. Maximal degree in co-relation 4692. Up to 2005 conditions per place. 
[2024-06-04 18:12:32,833 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 41 selfloop transitions, 7 changer transitions 0/53 dead transitions.
[2024-06-04 18:12:32,834 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 244 flow
[2024-06-04 18:12:32,835 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-04 18:12:32,835 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-04 18:12:32,836 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions.
[2024-06-04 18:12:32,836 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5654761904761905
[2024-06-04 18:12:32,836 INFO  L175             Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 95 transitions.
[2024-06-04 18:12:32,836 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 244 flow
[2024-06-04 18:12:32,837 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-04 18:12:32,839 INFO  L231             Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow
[2024-06-04 18:12:32,839 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=46, PETRI_TRANSITIONS=39}
[2024-06-04 18:12:32,839 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places.
[2024-06-04 18:12:32,840 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow
[2024-06-04 18:12:32,840 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:32,840 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:32,840 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:32,841 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-04 18:12:32,841 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-04 18:12:32,841 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:32,841 INFO  L85        PathProgramCache]: Analyzing trace with hash -1068922608, now seen corresponding path program 1 times
[2024-06-04 18:12:32,842 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:32,842 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792060974]
[2024-06-04 18:12:32,842 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:32,842 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:32,970 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:38,665 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:38,665 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:38,665 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792060974]
[2024-06-04 18:12:38,666 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792060974] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:38,666 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:38,666 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-04 18:12:38,666 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545256621]
[2024-06-04 18:12:38,666 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:38,667 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-04 18:12:38,667 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:38,668 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-04 18:12:38,668 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-04 18:12:38,812 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-04 18:12:38,812 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 138 flow. Second operand  has 5 states, 5 states have (on average 12.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-04 18:12:38,812 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:38,812 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-04 18:12:38,812 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:39,830 INFO  L124   PetriNetUnfolderBase]: 1347/2040 cut-off events.
[2024-06-04 18:12:39,830 INFO  L125   PetriNetUnfolderBase]: For 1131/1131 co-relation queries the response was YES.
[2024-06-04 18:12:39,833 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5223 conditions, 2040 events. 1347/2040 cut-off events. For 1131/1131 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9801 event pairs, 649 based on Foata normal form. 3/2042 useless extension candidates. Maximal degree in co-relation 5206. Up to 1981 conditions per place. 
[2024-06-04 18:12:39,840 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 48 selfloop transitions, 10 changer transitions 0/63 dead transitions.
[2024-06-04 18:12:39,840 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 63 transitions, 322 flow
[2024-06-04 18:12:39,842 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 18:12:39,842 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 18:12:39,843 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions.
[2024-06-04 18:12:39,843 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5523809523809524
[2024-06-04 18:12:39,844 INFO  L175             Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 5 states and 116 transitions.
[2024-06-04 18:12:39,844 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 63 transitions, 322 flow
[2024-06-04 18:12:39,846 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 63 transitions, 308 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-04 18:12:39,847 INFO  L231             Difference]: Finished difference. Result has 49 places, 42 transitions, 174 flow
[2024-06-04 18:12:39,847 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=42}
[2024-06-04 18:12:39,848 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places.
[2024-06-04 18:12:39,848 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 174 flow
[2024-06-04 18:12:39,848 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-04 18:12:39,849 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:39,849 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:39,849 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-04 18:12:39,849 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-04 18:12:39,850 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:39,850 INFO  L85        PathProgramCache]: Analyzing trace with hash 267149839, now seen corresponding path program 1 times
[2024-06-04 18:12:39,850 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:39,850 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563068993]
[2024-06-04 18:12:39,850 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:39,851 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:39,904 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:47,310 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:47,311 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:47,314 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563068993]
[2024-06-04 18:12:47,314 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563068993] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:47,315 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:47,315 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 18:12:47,315 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863667439]
[2024-06-04 18:12:47,316 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:47,316 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 18:12:47,316 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:47,318 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 18:12:47,319 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-04 18:12:47,434 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:12:47,435 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 174 flow. Second operand  has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:47,435 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:47,435 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:12:47,435 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:48,432 INFO  L124   PetriNetUnfolderBase]: 1342/2033 cut-off events.
[2024-06-04 18:12:48,433 INFO  L125   PetriNetUnfolderBase]: For 2058/2058 co-relation queries the response was YES.
[2024-06-04 18:12:48,437 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5731 conditions, 2033 events. 1342/2033 cut-off events. For 2058/2058 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9648 event pairs, 631 based on Foata normal form. 2/2034 useless extension candidates. Maximal degree in co-relation 5713. Up to 1995 conditions per place. 
[2024-06-04 18:12:48,447 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 43 selfloop transitions, 8 changer transitions 0/56 dead transitions.
[2024-06-04 18:12:48,447 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 56 transitions, 318 flow
[2024-06-04 18:12:48,447 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 18:12:48,448 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 18:12:48,448 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions.
[2024-06-04 18:12:48,449 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46190476190476193
[2024-06-04 18:12:48,449 INFO  L175             Difference]: Start difference. First operand has 49 places, 42 transitions, 174 flow. Second operand 5 states and 97 transitions.
[2024-06-04 18:12:48,449 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 56 transitions, 318 flow
[2024-06-04 18:12:48,454 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 294 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-04 18:12:48,455 INFO  L231             Difference]: Finished difference. Result has 51 places, 45 transitions, 194 flow
[2024-06-04 18:12:48,455 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=51, PETRI_TRANSITIONS=45}
[2024-06-04 18:12:48,457 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places.
[2024-06-04 18:12:48,457 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 194 flow
[2024-06-04 18:12:48,457 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:48,458 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:48,458 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:48,458 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-04 18:12:48,458 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:12:48,459 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:48,459 INFO  L85        PathProgramCache]: Analyzing trace with hash -737393617, now seen corresponding path program 1 times
[2024-06-04 18:12:48,459 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:48,459 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393506913]
[2024-06-04 18:12:48,459 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:48,460 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:48,557 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:53,472 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:53,473 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:53,473 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393506913]
[2024-06-04 18:12:53,474 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393506913] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:53,474 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:53,474 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 18:12:53,474 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547346700]
[2024-06-04 18:12:53,474 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:53,475 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 18:12:53,475 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:53,475 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 18:12:53,475 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-04 18:12:53,647 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-04 18:12:53,647 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 194 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-04 18:12:53,647 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:53,647 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-04 18:12:53,647 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:54,833 INFO  L124   PetriNetUnfolderBase]: 1333/2018 cut-off events.
[2024-06-04 18:12:54,833 INFO  L125   PetriNetUnfolderBase]: For 3143/3143 co-relation queries the response was YES.
[2024-06-04 18:12:54,837 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6150 conditions, 2018 events. 1333/2018 cut-off events. For 3143/3143 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9611 event pairs, 467 based on Foata normal form. 6/2023 useless extension candidates. Maximal degree in co-relation 6130. Up to 1929 conditions per place. 
[2024-06-04 18:12:54,848 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 55 selfloop transitions, 12 changer transitions 0/72 dead transitions.
[2024-06-04 18:12:54,848 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 404 flow
[2024-06-04 18:12:54,850 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:12:54,851 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:12:54,854 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions.
[2024-06-04 18:12:54,855 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5277777777777778
[2024-06-04 18:12:54,855 INFO  L175             Difference]: Start difference. First operand has 51 places, 45 transitions, 194 flow. Second operand 6 states and 133 transitions.
[2024-06-04 18:12:54,855 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 404 flow
[2024-06-04 18:12:54,859 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 72 transitions, 384 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-04 18:12:54,862 INFO  L231             Difference]: Finished difference. Result has 53 places, 46 transitions, 219 flow
[2024-06-04 18:12:54,863 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=53, PETRI_TRANSITIONS=46}
[2024-06-04 18:12:54,865 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places.
[2024-06-04 18:12:54,866 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 219 flow
[2024-06-04 18:12:54,866 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-04 18:12:54,871 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:54,871 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:54,872 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-04 18:12:54,872 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-04 18:12:54,872 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:54,872 INFO  L85        PathProgramCache]: Analyzing trace with hash -299350990, now seen corresponding path program 1 times
[2024-06-04 18:12:54,873 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:54,873 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204638813]
[2024-06-04 18:12:54,873 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:54,873 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:54,932 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:01,587 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:01,587 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:01,587 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204638813]
[2024-06-04 18:13:01,587 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204638813] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:01,587 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:01,587 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:13:01,588 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458525083]
[2024-06-04 18:13:01,588 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:01,588 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:13:01,588 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:01,589 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:13:01,589 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:13:01,741 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:13:01,742 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 219 flow. Second operand  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:01,742 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:01,742 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:13:01,742 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:02,675 INFO  L124   PetriNetUnfolderBase]: 1335/2021 cut-off events.
[2024-06-04 18:13:02,675 INFO  L125   PetriNetUnfolderBase]: For 4349/4349 co-relation queries the response was YES.
[2024-06-04 18:13:02,679 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6528 conditions, 2021 events. 1335/2021 cut-off events. For 4349/4349 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9543 event pairs, 569 based on Foata normal form. 3/2023 useless extension candidates. Maximal degree in co-relation 6508. Up to 1955 conditions per place. 
[2024-06-04 18:13:02,687 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 52 selfloop transitions, 17 changer transitions 0/74 dead transitions.
[2024-06-04 18:13:02,688 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 74 transitions, 473 flow
[2024-06-04 18:13:02,688 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:13:02,688 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:13:02,689 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions.
[2024-06-04 18:13:02,689 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4722222222222222
[2024-06-04 18:13:02,689 INFO  L175             Difference]: Start difference. First operand has 53 places, 46 transitions, 219 flow. Second operand 6 states and 119 transitions.
[2024-06-04 18:13:02,689 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 74 transitions, 473 flow
[2024-06-04 18:13:02,693 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 74 transitions, 438 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-06-04 18:13:02,695 INFO  L231             Difference]: Finished difference. Result has 57 places, 57 transitions, 309 flow
[2024-06-04 18:13:02,695 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=309, PETRI_PLACES=57, PETRI_TRANSITIONS=57}
[2024-06-04 18:13:02,698 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places.
[2024-06-04 18:13:02,699 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 309 flow
[2024-06-04 18:13:02,699 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:02,699 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:02,700 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:02,700 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-04 18:13:02,700 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-04 18:13:02,700 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:02,701 INFO  L85        PathProgramCache]: Analyzing trace with hash -973676242, now seen corresponding path program 1 times
[2024-06-04 18:13:02,701 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:02,704 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859055811]
[2024-06-04 18:13:02,705 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:02,705 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:02,762 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:08,476 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:08,477 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:08,477 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859055811]
[2024-06-04 18:13:08,477 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859055811] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:08,477 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:08,477 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:13:08,478 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143053428]
[2024-06-04 18:13:08,478 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:08,478 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:13:08,478 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:08,478 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:13:08,479 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:13:08,628 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:13:08,628 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 309 flow. Second operand  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:08,629 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:08,629 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:13:08,629 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:09,437 INFO  L124   PetriNetUnfolderBase]: 1357/2063 cut-off events.
[2024-06-04 18:13:09,437 INFO  L125   PetriNetUnfolderBase]: For 6614/6614 co-relation queries the response was YES.
[2024-06-04 18:13:09,441 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7429 conditions, 2063 events. 1357/2063 cut-off events. For 6614/6614 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9748 event pairs, 556 based on Foata normal form. 4/2066 useless extension candidates. Maximal degree in co-relation 7405. Up to 1991 conditions per place. 
[2024-06-04 18:13:09,453 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 63 selfloop transitions, 11 changer transitions 0/79 dead transitions.
[2024-06-04 18:13:09,453 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 79 transitions, 531 flow
[2024-06-04 18:13:09,454 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:13:09,454 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:13:09,454 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions.
[2024-06-04 18:13:09,455 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-04 18:13:09,455 INFO  L175             Difference]: Start difference. First operand has 57 places, 57 transitions, 309 flow. Second operand 6 states and 117 transitions.
[2024-06-04 18:13:09,455 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 79 transitions, 531 flow
[2024-06-04 18:13:09,459 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 79 transitions, 515 flow, removed 7 selfloop flow, removed 1 redundant places.
[2024-06-04 18:13:09,461 INFO  L231             Difference]: Finished difference. Result has 62 places, 60 transitions, 353 flow
[2024-06-04 18:13:09,461 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=353, PETRI_PLACES=62, PETRI_TRANSITIONS=60}
[2024-06-04 18:13:09,462 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places.
[2024-06-04 18:13:09,462 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 353 flow
[2024-06-04 18:13:09,462 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:09,462 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:09,462 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:09,463 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-04 18:13:09,463 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-04 18:13:09,463 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:09,463 INFO  L85        PathProgramCache]: Analyzing trace with hash -967010002, now seen corresponding path program 2 times
[2024-06-04 18:13:09,463 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:09,464 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611171790]
[2024-06-04 18:13:09,464 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:09,464 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:09,511 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:15,693 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:15,693 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:15,693 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611171790]
[2024-06-04 18:13:15,694 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611171790] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:15,694 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:15,694 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:13:15,694 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912173438]
[2024-06-04 18:13:15,694 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:15,694 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:13:15,695 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:15,695 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:13:15,695 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:13:15,768 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:13:15,769 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 353 flow. Second operand  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:15,769 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:15,769 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:13:15,769 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:16,590 INFO  L124   PetriNetUnfolderBase]: 1363/2067 cut-off events.
[2024-06-04 18:13:16,590 INFO  L125   PetriNetUnfolderBase]: For 8943/8943 co-relation queries the response was YES.
[2024-06-04 18:13:16,595 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7989 conditions, 2067 events. 1363/2067 cut-off events. For 8943/8943 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10002 event pairs, 552 based on Foata normal form. 4/2068 useless extension candidates. Maximal degree in co-relation 7962. Up to 1947 conditions per place. 
[2024-06-04 18:13:16,605 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 59 selfloop transitions, 21 changer transitions 0/85 dead transitions.
[2024-06-04 18:13:16,606 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 85 transitions, 651 flow
[2024-06-04 18:13:16,609 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:13:16,609 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:13:16,610 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions.
[2024-06-04 18:13:16,610 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-04 18:13:16,610 INFO  L175             Difference]: Start difference. First operand has 62 places, 60 transitions, 353 flow. Second operand 6 states and 120 transitions.
[2024-06-04 18:13:16,610 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 85 transitions, 651 flow
[2024-06-04 18:13:16,615 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 85 transitions, 617 flow, removed 8 selfloop flow, removed 4 redundant places.
[2024-06-04 18:13:16,617 INFO  L231             Difference]: Finished difference. Result has 64 places, 66 transitions, 435 flow
[2024-06-04 18:13:16,617 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=435, PETRI_PLACES=64, PETRI_TRANSITIONS=66}
[2024-06-04 18:13:16,618 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places.
[2024-06-04 18:13:16,618 INFO  L495      AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 435 flow
[2024-06-04 18:13:16,618 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:16,618 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:16,619 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:16,619 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-04 18:13:16,619 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-04 18:13:16,619 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:16,619 INFO  L85        PathProgramCache]: Analyzing trace with hash -967001074, now seen corresponding path program 1 times
[2024-06-04 18:13:16,620 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:16,620 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605881754]
[2024-06-04 18:13:16,620 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:16,620 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:16,666 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:23,857 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:23,857 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:23,857 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605881754]
[2024-06-04 18:13:23,873 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605881754] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:23,873 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:23,873 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:13:23,874 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434581422]
[2024-06-04 18:13:23,874 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:23,874 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:13:23,874 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:23,875 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:13:23,875 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:13:24,034 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:13:24,035 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 66 transitions, 435 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-04 18:13:24,035 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:24,035 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:13:24,035 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:24,823 INFO  L124   PetriNetUnfolderBase]: 1365/2080 cut-off events.
[2024-06-04 18:13:24,823 INFO  L125   PetriNetUnfolderBase]: For 10835/10835 co-relation queries the response was YES.
[2024-06-04 18:13:24,827 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8475 conditions, 2080 events. 1365/2080 cut-off events. For 10835/10835 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9966 event pairs, 518 based on Foata normal form. 3/2082 useless extension candidates. Maximal degree in co-relation 8447. Up to 1986 conditions per place. 
[2024-06-04 18:13:24,834 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 65 selfloop transitions, 21 changer transitions 0/91 dead transitions.
[2024-06-04 18:13:24,834 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 91 transitions, 723 flow
[2024-06-04 18:13:24,835 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:13:24,835 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:13:24,835 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions.
[2024-06-04 18:13:24,835 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46598639455782315
[2024-06-04 18:13:24,836 INFO  L175             Difference]: Start difference. First operand has 64 places, 66 transitions, 435 flow. Second operand 7 states and 137 transitions.
[2024-06-04 18:13:24,836 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 91 transitions, 723 flow
[2024-06-04 18:13:24,841 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 91 transitions, 691 flow, removed 11 selfloop flow, removed 2 redundant places.
[2024-06-04 18:13:24,842 INFO  L231             Difference]: Finished difference. Result has 69 places, 70 transitions, 494 flow
[2024-06-04 18:13:24,843 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=494, PETRI_PLACES=69, PETRI_TRANSITIONS=70}
[2024-06-04 18:13:24,843 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places.
[2024-06-04 18:13:24,843 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 70 transitions, 494 flow
[2024-06-04 18:13:24,844 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-04 18:13:24,844 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:24,844 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:24,844 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-04 18:13:24,844 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-04 18:13:24,845 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:24,845 INFO  L85        PathProgramCache]: Analyzing trace with hash -119191137, now seen corresponding path program 1 times
[2024-06-04 18:13:24,845 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:24,845 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838322435]
[2024-06-04 18:13:24,845 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:24,845 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:24,881 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:31,222 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:31,222 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:31,222 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838322435]
[2024-06-04 18:13:31,222 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838322435] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:31,222 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:31,222 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:13:31,222 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113150709]
[2024-06-04 18:13:31,223 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:31,223 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:13:31,223 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:31,224 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:13:31,224 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:13:31,352 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:13:31,352 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 70 transitions, 494 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-04 18:13:31,352 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:31,352 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:13:31,352 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:32,246 INFO  L124   PetriNetUnfolderBase]: 1501/2282 cut-off events.
[2024-06-04 18:13:32,246 INFO  L125   PetriNetUnfolderBase]: For 13201/13201 co-relation queries the response was YES.
[2024-06-04 18:13:32,251 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9835 conditions, 2282 events. 1501/2282 cut-off events. For 13201/13201 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11087 event pairs, 506 based on Foata normal form. 10/2291 useless extension candidates. Maximal degree in co-relation 9805. Up to 2058 conditions per place. 
[2024-06-04 18:13:32,258 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 85 selfloop transitions, 29 changer transitions 0/119 dead transitions.
[2024-06-04 18:13:32,259 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 119 transitions, 994 flow
[2024-06-04 18:13:32,259 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:13:32,259 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:13:32,260 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions.
[2024-06-04 18:13:32,260 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4880952380952381
[2024-06-04 18:13:32,261 INFO  L175             Difference]: Start difference. First operand has 69 places, 70 transitions, 494 flow. Second operand 8 states and 164 transitions.
[2024-06-04 18:13:32,261 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 119 transitions, 994 flow
[2024-06-04 18:13:32,269 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 119 transitions, 933 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-06-04 18:13:32,271 INFO  L231             Difference]: Finished difference. Result has 75 places, 88 transitions, 673 flow
[2024-06-04 18:13:32,271 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=673, PETRI_PLACES=75, PETRI_TRANSITIONS=88}
[2024-06-04 18:13:32,272 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places.
[2024-06-04 18:13:32,272 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 88 transitions, 673 flow
[2024-06-04 18:13:32,272 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-04 18:13:32,272 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:32,272 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:32,273 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-04 18:13:32,273 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-04 18:13:32,273 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:32,273 INFO  L85        PathProgramCache]: Analyzing trace with hash 86539921, now seen corresponding path program 2 times
[2024-06-04 18:13:32,273 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:32,274 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811071251]
[2024-06-04 18:13:32,274 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:32,274 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:32,315 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:38,905 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:38,906 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:38,906 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811071251]
[2024-06-04 18:13:38,906 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811071251] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:38,906 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:38,907 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:13:38,907 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445735495]
[2024-06-04 18:13:38,907 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:38,907 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:13:38,907 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:38,908 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:13:38,908 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:13:39,029 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:13:39,029 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 88 transitions, 673 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-04 18:13:39,029 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:39,029 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:13:39,029 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:40,148 INFO  L124   PetriNetUnfolderBase]: 1725/2622 cut-off events.
[2024-06-04 18:13:40,148 INFO  L125   PetriNetUnfolderBase]: For 19890/19890 co-relation queries the response was YES.
[2024-06-04 18:13:40,153 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13082 conditions, 2622 events. 1725/2622 cut-off events. For 19890/19890 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 13069 event pairs, 520 based on Foata normal form. 10/2631 useless extension candidates. Maximal degree in co-relation 13048. Up to 2028 conditions per place. 
[2024-06-04 18:13:40,166 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 90 selfloop transitions, 47 changer transitions 0/142 dead transitions.
[2024-06-04 18:13:40,167 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 142 transitions, 1329 flow
[2024-06-04 18:13:40,167 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:13:40,167 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:13:40,168 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions.
[2024-06-04 18:13:40,168 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5178571428571429
[2024-06-04 18:13:40,169 INFO  L175             Difference]: Start difference. First operand has 75 places, 88 transitions, 673 flow. Second operand 8 states and 174 transitions.
[2024-06-04 18:13:40,169 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 142 transitions, 1329 flow
[2024-06-04 18:13:40,188 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 142 transitions, 1271 flow, removed 22 selfloop flow, removed 3 redundant places.
[2024-06-04 18:13:40,191 INFO  L231             Difference]: Finished difference. Result has 82 places, 102 transitions, 913 flow
[2024-06-04 18:13:40,191 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=913, PETRI_PLACES=82, PETRI_TRANSITIONS=102}
[2024-06-04 18:13:40,192 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places.
[2024-06-04 18:13:40,192 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 102 transitions, 913 flow
[2024-06-04 18:13:40,192 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-04 18:13:40,192 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:40,192 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:40,192 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-04 18:13:40,193 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-04 18:13:40,193 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:40,193 INFO  L85        PathProgramCache]: Analyzing trace with hash 86273011, now seen corresponding path program 3 times
[2024-06-04 18:13:40,193 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:40,193 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064679142]
[2024-06-04 18:13:40,194 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:40,194 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:40,231 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:46,746 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:46,746 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:46,746 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064679142]
[2024-06-04 18:13:46,746 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064679142] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:46,746 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:46,746 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:13:46,747 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141363623]
[2024-06-04 18:13:46,747 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:46,747 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:13:46,747 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:46,748 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:13:46,748 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:13:46,899 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:13:46,899 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 102 transitions, 913 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-04 18:13:46,899 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:46,899 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:13:46,900 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:48,013 INFO  L124   PetriNetUnfolderBase]: 1805/2754 cut-off events.
[2024-06-04 18:13:48,014 INFO  L125   PetriNetUnfolderBase]: For 25073/25073 co-relation queries the response was YES.
[2024-06-04 18:13:48,021 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15112 conditions, 2754 events. 1805/2754 cut-off events. For 25073/25073 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 13907 event pairs, 563 based on Foata normal form. 10/2763 useless extension candidates. Maximal degree in co-relation 15075. Up to 2082 conditions per place. 
[2024-06-04 18:13:48,035 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 92 selfloop transitions, 51 changer transitions 0/148 dead transitions.
[2024-06-04 18:13:48,036 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 148 transitions, 1511 flow
[2024-06-04 18:13:48,037 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:13:48,037 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:13:48,037 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions.
[2024-06-04 18:13:48,038 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5148809523809523
[2024-06-04 18:13:48,038 INFO  L175             Difference]: Start difference. First operand has 82 places, 102 transitions, 913 flow. Second operand 8 states and 173 transitions.
[2024-06-04 18:13:48,038 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 148 transitions, 1511 flow
[2024-06-04 18:13:48,064 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 148 transitions, 1446 flow, removed 23 selfloop flow, removed 3 redundant places.
[2024-06-04 18:13:48,067 INFO  L231             Difference]: Finished difference. Result has 89 places, 112 transitions, 1120 flow
[2024-06-04 18:13:48,067 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1120, PETRI_PLACES=89, PETRI_TRANSITIONS=112}
[2024-06-04 18:13:48,068 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 46 predicate places.
[2024-06-04 18:13:48,068 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 112 transitions, 1120 flow
[2024-06-04 18:13:48,068 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-04 18:13:48,068 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:48,069 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:48,069 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-04 18:13:48,069 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-04 18:13:48,069 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:48,069 INFO  L85        PathProgramCache]: Analyzing trace with hash 86549841, now seen corresponding path program 1 times
[2024-06-04 18:13:48,069 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:48,070 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964383119]
[2024-06-04 18:13:48,070 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:48,070 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:48,116 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:55,668 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:55,668 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:55,668 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964383119]
[2024-06-04 18:13:55,669 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964383119] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:55,669 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:55,669 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:13:55,669 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130970177]
[2024-06-04 18:13:55,669 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:55,669 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:13:55,669 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:55,670 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:13:55,670 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:13:55,907 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:13:55,907 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 112 transitions, 1120 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-04 18:13:55,907 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:55,907 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:13:55,907 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:56,951 INFO  L124   PetriNetUnfolderBase]: 1808/2759 cut-off events.
[2024-06-04 18:13:56,951 INFO  L125   PetriNetUnfolderBase]: For 29045/29045 co-relation queries the response was YES.
[2024-06-04 18:13:56,958 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16099 conditions, 2759 events. 1808/2759 cut-off events. For 29045/29045 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 13872 event pairs, 601 based on Foata normal form. 6/2764 useless extension candidates. Maximal degree in co-relation 16058. Up to 2581 conditions per place. 
[2024-06-04 18:13:56,967 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 112 selfloop transitions, 24 changer transitions 0/141 dead transitions.
[2024-06-04 18:13:56,967 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 141 transitions, 1556 flow
[2024-06-04 18:13:56,967 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:13:56,967 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:13:56,968 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-04 18:13:56,968 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46130952380952384
[2024-06-04 18:13:56,968 INFO  L175             Difference]: Start difference. First operand has 89 places, 112 transitions, 1120 flow. Second operand 8 states and 155 transitions.
[2024-06-04 18:13:56,968 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 141 transitions, 1556 flow
[2024-06-04 18:13:56,992 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 141 transitions, 1485 flow, removed 26 selfloop flow, removed 3 redundant places.
[2024-06-04 18:13:56,994 INFO  L231             Difference]: Finished difference. Result has 94 places, 115 transitions, 1163 flow
[2024-06-04 18:13:56,995 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1163, PETRI_PLACES=94, PETRI_TRANSITIONS=115}
[2024-06-04 18:13:56,995 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places.
[2024-06-04 18:13:56,995 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 115 transitions, 1163 flow
[2024-06-04 18:13:56,996 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-04 18:13:56,996 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:56,996 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:56,996 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-04 18:13:56,996 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:13:56,997 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:56,997 INFO  L85        PathProgramCache]: Analyzing trace with hash -698979012, now seen corresponding path program 1 times
[2024-06-04 18:13:56,997 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:56,997 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390054558]
[2024-06-04 18:13:56,997 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:56,997 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:57,034 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:05,815 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:05,816 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:05,816 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390054558]
[2024-06-04 18:14:05,816 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390054558] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:05,816 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:05,816 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 18:14:05,816 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657969397]
[2024-06-04 18:14:05,817 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:05,817 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 18:14:05,817 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:05,818 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 18:14:05,818 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-04 18:14:05,900 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:14:05,900 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 115 transitions, 1163 flow. Second operand  has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:05,900 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:05,900 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:14:05,900 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:06,981 INFO  L124   PetriNetUnfolderBase]: 1805/2753 cut-off events.
[2024-06-04 18:14:06,982 INFO  L125   PetriNetUnfolderBase]: For 30835/30835 co-relation queries the response was YES.
[2024-06-04 18:14:06,989 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16319 conditions, 2753 events. 1805/2753 cut-off events. For 30835/30835 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 13850 event pairs, 624 based on Foata normal form. 1/2753 useless extension candidates. Maximal degree in co-relation 16276. Up to 2650 conditions per place. 
[2024-06-04 18:14:06,998 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 110 selfloop transitions, 8 changer transitions 0/123 dead transitions.
[2024-06-04 18:14:06,998 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 123 transitions, 1419 flow
[2024-06-04 18:14:06,999 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 18:14:06,999 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 18:14:06,999 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions.
[2024-06-04 18:14:06,999 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4380952380952381
[2024-06-04 18:14:07,000 INFO  L175             Difference]: Start difference. First operand has 94 places, 115 transitions, 1163 flow. Second operand 5 states and 92 transitions.
[2024-06-04 18:14:07,000 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 123 transitions, 1419 flow
[2024-06-04 18:14:07,021 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 123 transitions, 1321 flow, removed 27 selfloop flow, removed 6 redundant places.
[2024-06-04 18:14:07,023 INFO  L231             Difference]: Finished difference. Result has 93 places, 115 transitions, 1087 flow
[2024-06-04 18:14:07,024 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1065, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1087, PETRI_PLACES=93, PETRI_TRANSITIONS=115}
[2024-06-04 18:14:07,024 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places.
[2024-06-04 18:14:07,024 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 115 transitions, 1087 flow
[2024-06-04 18:14:07,025 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:07,025 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:07,025 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:07,025 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-04 18:14:07,025 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-04 18:14:07,026 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:07,026 INFO  L85        PathProgramCache]: Analyzing trace with hash 595274829, now seen corresponding path program 1 times
[2024-06-04 18:14:07,026 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:07,026 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822803065]
[2024-06-04 18:14:07,026 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:07,026 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:07,100 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:12,866 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:12,867 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:12,867 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822803065]
[2024-06-04 18:14:12,867 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822803065] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:12,867 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:12,867 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:14:12,867 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714394690]
[2024-06-04 18:14:12,868 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:12,868 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:14:12,868 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:12,869 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:14:12,869 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:14:13,001 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:14:13,001 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 115 transitions, 1087 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-04 18:14:13,001 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:13,001 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:14:13,002 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:13,974 INFO  L124   PetriNetUnfolderBase]: 1800/2746 cut-off events.
[2024-06-04 18:14:13,974 INFO  L125   PetriNetUnfolderBase]: For 32503/32503 co-relation queries the response was YES.
[2024-06-04 18:14:13,982 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16183 conditions, 2746 events. 1800/2746 cut-off events. For 32503/32503 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 13788 event pairs, 621 based on Foata normal form. 2/2747 useless extension candidates. Maximal degree in co-relation 16139. Up to 2607 conditions per place. 
[2024-06-04 18:14:13,992 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 121 selfloop transitions, 14 changer transitions 0/140 dead transitions.
[2024-06-04 18:14:13,993 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 140 transitions, 1421 flow
[2024-06-04 18:14:13,995 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:14:13,995 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:14:13,996 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions.
[2024-06-04 18:14:13,996 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46258503401360546
[2024-06-04 18:14:13,996 INFO  L175             Difference]: Start difference. First operand has 93 places, 115 transitions, 1087 flow. Second operand 7 states and 136 transitions.
[2024-06-04 18:14:13,996 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 140 transitions, 1421 flow
[2024-06-04 18:14:14,065 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 140 transitions, 1389 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-06-04 18:14:14,067 INFO  L231             Difference]: Finished difference. Result has 96 places, 115 transitions, 1091 flow
[2024-06-04 18:14:14,068 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1055, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1091, PETRI_PLACES=96, PETRI_TRANSITIONS=115}
[2024-06-04 18:14:14,069 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 53 predicate places.
[2024-06-04 18:14:14,069 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 115 transitions, 1091 flow
[2024-06-04 18:14:14,070 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-04 18:14:14,070 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:14,070 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:14,070 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-04 18:14:14,070 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-04 18:14:14,071 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:14,071 INFO  L85        PathProgramCache]: Analyzing trace with hash -1848403781, now seen corresponding path program 1 times
[2024-06-04 18:14:14,071 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:14,071 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693138510]
[2024-06-04 18:14:14,071 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:14,072 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:14,123 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:21,329 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:21,329 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:21,329 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693138510]
[2024-06-04 18:14:21,329 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693138510] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:21,329 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:21,330 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:14:21,330 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778920289]
[2024-06-04 18:14:21,330 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:21,330 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:14:21,331 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:21,331 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:14:21,331 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:14:21,501 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:14:21,501 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 115 transitions, 1091 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-04 18:14:21,501 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:21,501 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:14:21,501 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:22,646 INFO  L124   PetriNetUnfolderBase]: 1864/2840 cut-off events.
[2024-06-04 18:14:22,646 INFO  L125   PetriNetUnfolderBase]: For 36258/36258 co-relation queries the response was YES.
[2024-06-04 18:14:22,654 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16870 conditions, 2840 events. 1864/2840 cut-off events. For 36258/36258 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 14361 event pairs, 548 based on Foata normal form. 10/2849 useless extension candidates. Maximal degree in co-relation 16826. Up to 2524 conditions per place. 
[2024-06-04 18:14:22,664 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 116 selfloop transitions, 34 changer transitions 0/155 dead transitions.
[2024-06-04 18:14:22,665 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 155 transitions, 1657 flow
[2024-06-04 18:14:22,665 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:14:22,665 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:14:22,666 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions.
[2024-06-04 18:14:22,666 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5089285714285714
[2024-06-04 18:14:22,666 INFO  L175             Difference]: Start difference. First operand has 96 places, 115 transitions, 1091 flow. Second operand 8 states and 171 transitions.
[2024-06-04 18:14:22,666 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 155 transitions, 1657 flow
[2024-06-04 18:14:22,694 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 155 transitions, 1607 flow, removed 7 selfloop flow, removed 6 redundant places.
[2024-06-04 18:14:22,696 INFO  L231             Difference]: Finished difference. Result has 98 places, 121 transitions, 1202 flow
[2024-06-04 18:14:22,696 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1202, PETRI_PLACES=98, PETRI_TRANSITIONS=121}
[2024-06-04 18:14:22,697 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 55 predicate places.
[2024-06-04 18:14:22,697 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 121 transitions, 1202 flow
[2024-06-04 18:14:22,697 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-04 18:14:22,697 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:22,698 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:22,698 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-04 18:14:22,698 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:14:22,698 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:22,698 INFO  L85        PathProgramCache]: Analyzing trace with hash -1620502631, now seen corresponding path program 2 times
[2024-06-04 18:14:22,699 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:22,699 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738274107]
[2024-06-04 18:14:22,699 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:22,699 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:22,739 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:30,233 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:30,233 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:30,233 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738274107]
[2024-06-04 18:14:30,233 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738274107] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:30,233 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:30,233 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:14:30,233 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216489150]
[2024-06-04 18:14:30,234 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:30,234 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:14:30,234 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:30,234 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:14:30,235 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:14:30,467 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:14:30,467 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 121 transitions, 1202 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-04 18:14:30,467 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:30,467 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:14:30,468 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:31,530 INFO  L124   PetriNetUnfolderBase]: 1928/2931 cut-off events.
[2024-06-04 18:14:31,530 INFO  L125   PetriNetUnfolderBase]: For 41369/41369 co-relation queries the response was YES.
[2024-06-04 18:14:31,538 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18465 conditions, 2931 events. 1928/2931 cut-off events. For 41369/41369 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 14796 event pairs, 547 based on Foata normal form. 10/2939 useless extension candidates. Maximal degree in co-relation 18420. Up to 2216 conditions per place. 
[2024-06-04 18:14:31,548 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 101 selfloop transitions, 54 changer transitions 0/160 dead transitions.
[2024-06-04 18:14:31,548 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 160 transitions, 1808 flow
[2024-06-04 18:14:31,549 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:14:31,549 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:14:31,550 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions.
[2024-06-04 18:14:31,550 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5119047619047619
[2024-06-04 18:14:31,550 INFO  L175             Difference]: Start difference. First operand has 98 places, 121 transitions, 1202 flow. Second operand 8 states and 172 transitions.
[2024-06-04 18:14:31,550 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 160 transitions, 1808 flow
[2024-06-04 18:14:31,583 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 160 transitions, 1691 flow, removed 28 selfloop flow, removed 6 redundant places.
[2024-06-04 18:14:31,585 INFO  L231             Difference]: Finished difference. Result has 100 places, 127 transitions, 1298 flow
[2024-06-04 18:14:31,585 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1085, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1298, PETRI_PLACES=100, PETRI_TRANSITIONS=127}
[2024-06-04 18:14:31,586 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places.
[2024-06-04 18:14:31,586 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 127 transitions, 1298 flow
[2024-06-04 18:14:31,586 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-04 18:14:31,586 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:31,587 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:31,587 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-04 18:14:31,587 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-04 18:14:31,587 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:31,587 INFO  L85        PathProgramCache]: Analyzing trace with hash -1611931751, now seen corresponding path program 3 times
[2024-06-04 18:14:31,588 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:31,588 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651197350]
[2024-06-04 18:14:31,588 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:31,588 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:31,635 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:38,972 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:38,972 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:38,973 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651197350]
[2024-06-04 18:14:38,973 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651197350] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:38,973 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:38,973 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:14:38,973 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322052699]
[2024-06-04 18:14:38,973 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:38,973 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:14:38,973 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:38,974 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:14:38,974 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:14:39,165 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:14:39,165 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 127 transitions, 1298 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-04 18:14:39,165 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:39,165 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:14:39,165 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:40,410 INFO  L124   PetriNetUnfolderBase]: 2024/3063 cut-off events.
[2024-06-04 18:14:40,410 INFO  L125   PetriNetUnfolderBase]: For 48245/48245 co-relation queries the response was YES.
[2024-06-04 18:14:40,420 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20252 conditions, 3063 events. 2024/3063 cut-off events. For 48245/48245 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 15526 event pairs, 529 based on Foata normal form. 10/3071 useless extension candidates. Maximal degree in co-relation 20206. Up to 2168 conditions per place. 
[2024-06-04 18:14:40,432 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 97 selfloop transitions, 75 changer transitions 0/177 dead transitions.
[2024-06-04 18:14:40,432 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 177 transitions, 2078 flow
[2024-06-04 18:14:40,432 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:14:40,433 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:14:40,433 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions.
[2024-06-04 18:14:40,433 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5158730158730159
[2024-06-04 18:14:40,433 INFO  L175             Difference]: Start difference. First operand has 100 places, 127 transitions, 1298 flow. Second operand 9 states and 195 transitions.
[2024-06-04 18:14:40,433 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 177 transitions, 2078 flow
[2024-06-04 18:14:40,468 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 177 transitions, 1911 flow, removed 33 selfloop flow, removed 6 redundant places.
[2024-06-04 18:14:40,471 INFO  L231             Difference]: Finished difference. Result has 104 places, 138 transitions, 1491 flow
[2024-06-04 18:14:40,471 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1491, PETRI_PLACES=104, PETRI_TRANSITIONS=138}
[2024-06-04 18:14:40,472 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 61 predicate places.
[2024-06-04 18:14:40,472 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 138 transitions, 1491 flow
[2024-06-04 18:14:40,472 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-04 18:14:40,472 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:40,472 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:40,473 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-04 18:14:40,473 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:14:40,473 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:40,473 INFO  L85        PathProgramCache]: Analyzing trace with hash -193511713, now seen corresponding path program 1 times
[2024-06-04 18:14:40,473 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:40,474 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297250038]
[2024-06-04 18:14:40,474 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:40,474 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:40,501 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:51,727 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:51,728 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:51,728 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297250038]
[2024-06-04 18:14:51,728 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297250038] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:51,728 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:51,728 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:14:51,728 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451252729]
[2024-06-04 18:14:51,728 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:51,728 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:14:51,729 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:51,729 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:14:51,729 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:14:51,832 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:14:51,833 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 138 transitions, 1491 flow. Second operand  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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-04 18:14:51,833 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:51,833 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:14:51,833 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:52,895 INFO  L124   PetriNetUnfolderBase]: 2038/3112 cut-off events.
[2024-06-04 18:14:52,896 INFO  L125   PetriNetUnfolderBase]: For 54419/54419 co-relation queries the response was YES.
[2024-06-04 18:14:52,906 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21703 conditions, 3112 events. 2038/3112 cut-off events. For 54419/54419 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 15896 event pairs, 611 based on Foata normal form. 6/3117 useless extension candidates. Maximal degree in co-relation 21655. Up to 2888 conditions per place. 
[2024-06-04 18:14:52,918 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 138 selfloop transitions, 25 changer transitions 0/168 dead transitions.
[2024-06-04 18:14:52,919 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 168 transitions, 2065 flow
[2024-06-04 18:14:52,919 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:14:52,920 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:14:52,920 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions.
[2024-06-04 18:14:52,920 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44047619047619047
[2024-06-04 18:14:52,921 INFO  L175             Difference]: Start difference. First operand has 104 places, 138 transitions, 1491 flow. Second operand 8 states and 148 transitions.
[2024-06-04 18:14:52,921 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 168 transitions, 2065 flow
[2024-06-04 18:14:52,965 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 168 transitions, 1884 flow, removed 55 selfloop flow, removed 5 redundant places.
[2024-06-04 18:14:52,967 INFO  L231             Difference]: Finished difference. Result has 108 places, 146 transitions, 1516 flow
[2024-06-04 18:14:52,967 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1516, PETRI_PLACES=108, PETRI_TRANSITIONS=146}
[2024-06-04 18:14:52,968 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 65 predicate places.
[2024-06-04 18:14:52,968 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 146 transitions, 1516 flow
[2024-06-04 18:14:52,968 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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-04 18:14:52,968 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:52,969 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:52,969 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-04 18:14:52,969 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-04 18:14:52,969 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:52,969 INFO  L85        PathProgramCache]: Analyzing trace with hash 1094257098, now seen corresponding path program 1 times
[2024-06-04 18:14:52,969 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:52,969 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956648037]
[2024-06-04 18:14:52,969 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:52,969 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:53,035 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:59,648 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:59,649 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:59,649 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956648037]
[2024-06-04 18:14:59,649 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956648037] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:59,649 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:59,649 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:14:59,649 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472240853]
[2024-06-04 18:14:59,649 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:59,650 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:14:59,650 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:59,650 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:14:59,650 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:14:59,829 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:14:59,830 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 146 transitions, 1516 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-04 18:14:59,830 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:59,830 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:14:59,830 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:00,942 INFO  L124   PetriNetUnfolderBase]: 2070/3149 cut-off events.
[2024-06-04 18:15:00,942 INFO  L125   PetriNetUnfolderBase]: For 58366/58366 co-relation queries the response was YES.
[2024-06-04 18:15:00,952 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22207 conditions, 3149 events. 2070/3149 cut-off events. For 58366/58366 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 16056 event pairs, 594 based on Foata normal form. 5/3153 useless extension candidates. Maximal degree in co-relation 22156. Up to 2908 conditions per place. 
[2024-06-04 18:15:00,963 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 155 selfloop transitions, 36 changer transitions 0/196 dead transitions.
[2024-06-04 18:15:00,963 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 196 transitions, 2358 flow
[2024-06-04 18:15:00,964 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:15:00,964 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:15:00,965 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions.
[2024-06-04 18:15:00,965 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5089285714285714
[2024-06-04 18:15:00,965 INFO  L175             Difference]: Start difference. First operand has 108 places, 146 transitions, 1516 flow. Second operand 8 states and 171 transitions.
[2024-06-04 18:15:00,965 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 196 transitions, 2358 flow
[2024-06-04 18:15:01,003 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 196 transitions, 2298 flow, removed 22 selfloop flow, removed 4 redundant places.
[2024-06-04 18:15:01,006 INFO  L231             Difference]: Finished difference. Result has 115 places, 162 transitions, 1848 flow
[2024-06-04 18:15:01,006 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1848, PETRI_PLACES=115, PETRI_TRANSITIONS=162}
[2024-06-04 18:15:01,007 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 72 predicate places.
[2024-06-04 18:15:01,007 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 162 transitions, 1848 flow
[2024-06-04 18:15:01,007 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-04 18:15:01,007 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:01,008 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:01,008 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-04 18:15:01,008 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-04 18:15:01,008 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:01,008 INFO  L85        PathProgramCache]: Analyzing trace with hash -621969168, now seen corresponding path program 1 times
[2024-06-04 18:15:01,009 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:01,009 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235332634]
[2024-06-04 18:15:01,009 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:01,009 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:01,054 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:09,474 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:09,475 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:09,475 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235332634]
[2024-06-04 18:15:09,475 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235332634] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:09,475 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:09,475 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:15:09,475 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805495059]
[2024-06-04 18:15:09,475 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:09,475 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:15:09,477 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:09,477 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:15:09,477 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:15:09,663 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:15:09,663 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 162 transitions, 1848 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:09,664 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:09,664 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:15:09,664 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:11,137 INFO  L124   PetriNetUnfolderBase]: 2382/3659 cut-off events.
[2024-06-04 18:15:11,138 INFO  L125   PetriNetUnfolderBase]: For 86781/86781 co-relation queries the response was YES.
[2024-06-04 18:15:11,152 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26476 conditions, 3659 events. 2382/3659 cut-off events. For 86781/86781 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 19280 event pairs, 626 based on Foata normal form. 74/3732 useless extension candidates. Maximal degree in co-relation 26420. Up to 2868 conditions per place. 
[2024-06-04 18:15:11,165 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 167 selfloop transitions, 38 changer transitions 0/210 dead transitions.
[2024-06-04 18:15:11,165 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 210 transitions, 2620 flow
[2024-06-04 18:15:11,166 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:15:11,166 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:15:11,166 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 207 transitions.
[2024-06-04 18:15:11,167 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4928571428571429
[2024-06-04 18:15:11,167 INFO  L175             Difference]: Start difference. First operand has 115 places, 162 transitions, 1848 flow. Second operand 10 states and 207 transitions.
[2024-06-04 18:15:11,167 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 210 transitions, 2620 flow
[2024-06-04 18:15:11,225 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 210 transitions, 2467 flow, removed 71 selfloop flow, removed 2 redundant places.
[2024-06-04 18:15:11,228 INFO  L231             Difference]: Finished difference. Result has 123 places, 165 transitions, 1861 flow
[2024-06-04 18:15:11,228 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1695, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1861, PETRI_PLACES=123, PETRI_TRANSITIONS=165}
[2024-06-04 18:15:11,229 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 80 predicate places.
[2024-06-04 18:15:11,229 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 165 transitions, 1861 flow
[2024-06-04 18:15:11,229 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:11,229 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:11,229 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:11,229 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-04 18:15:11,229 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:15:11,230 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:11,230 INFO  L85        PathProgramCache]: Analyzing trace with hash 1779152757, now seen corresponding path program 1 times
[2024-06-04 18:15:11,230 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:11,230 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616582274]
[2024-06-04 18:15:11,230 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:11,230 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:11,268 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:22,729 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:22,730 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:22,730 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616582274]
[2024-06-04 18:15:22,730 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616582274] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:22,730 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:22,730 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:15:22,731 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010004564]
[2024-06-04 18:15:22,731 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:22,731 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:15:22,731 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:22,732 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:15:22,732 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:15:22,878 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:15:22,879 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 165 transitions, 1861 flow. Second operand  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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-04 18:15:22,879 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:22,879 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:15:22,879 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:24,012 INFO  L124   PetriNetUnfolderBase]: 2392/3677 cut-off events.
[2024-06-04 18:15:24,012 INFO  L125   PetriNetUnfolderBase]: For 78939/78939 co-relation queries the response was YES.
[2024-06-04 18:15:24,026 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27179 conditions, 3677 events. 2392/3677 cut-off events. For 78939/78939 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 19438 event pairs, 712 based on Foata normal form. 2/3678 useless extension candidates. Maximal degree in co-relation 27120. Up to 3463 conditions per place. 
[2024-06-04 18:15:24,040 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 152 selfloop transitions, 33 changer transitions 0/190 dead transitions.
[2024-06-04 18:15:24,040 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 190 transitions, 2460 flow
[2024-06-04 18:15:24,041 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:15:24,041 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:15:24,041 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions.
[2024-06-04 18:15:24,041 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46258503401360546
[2024-06-04 18:15:24,042 INFO  L175             Difference]: Start difference. First operand has 123 places, 165 transitions, 1861 flow. Second operand 7 states and 136 transitions.
[2024-06-04 18:15:24,042 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 190 transitions, 2460 flow
[2024-06-04 18:15:24,100 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 190 transitions, 2348 flow, removed 18 selfloop flow, removed 8 redundant places.
[2024-06-04 18:15:24,102 INFO  L231             Difference]: Finished difference. Result has 122 places, 170 transitions, 1921 flow
[2024-06-04 18:15:24,102 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1755, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1921, PETRI_PLACES=122, PETRI_TRANSITIONS=170}
[2024-06-04 18:15:24,103 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 79 predicate places.
[2024-06-04 18:15:24,103 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 170 transitions, 1921 flow
[2024-06-04 18:15:24,103 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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-04 18:15:24,103 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:24,103 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:24,103 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-04 18:15:24,104 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-04 18:15:24,104 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:24,104 INFO  L85        PathProgramCache]: Analyzing trace with hash 1304027346, now seen corresponding path program 2 times
[2024-06-04 18:15:24,104 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:24,104 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624262040]
[2024-06-04 18:15:24,104 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:24,104 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:24,138 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:31,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-04 18:15:31,566 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:31,567 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624262040]
[2024-06-04 18:15:31,567 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624262040] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:31,567 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:31,567 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:15:31,567 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061543016]
[2024-06-04 18:15:31,567 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:31,567 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:15:31,567 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:31,568 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:15:31,568 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:15:31,733 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:15:31,733 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 170 transitions, 1921 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:31,733 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:31,733 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:15:31,733 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:33,036 INFO  L124   PetriNetUnfolderBase]: 2500/3907 cut-off events.
[2024-06-04 18:15:33,036 INFO  L125   PetriNetUnfolderBase]: For 84937/84937 co-relation queries the response was YES.
[2024-06-04 18:15:33,051 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27995 conditions, 3907 events. 2500/3907 cut-off events. For 84937/84937 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 21437 event pairs, 565 based on Foata normal form. 17/3922 useless extension candidates. Maximal degree in co-relation 27935. Up to 3252 conditions per place. 
[2024-06-04 18:15:33,067 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 196 selfloop transitions, 65 changer transitions 0/266 dead transitions.
[2024-06-04 18:15:33,067 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 266 transitions, 3504 flow
[2024-06-04 18:15:33,069 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:15:33,069 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:15:33,069 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 193 transitions.
[2024-06-04 18:15:33,069 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5105820105820106
[2024-06-04 18:15:33,070 INFO  L175             Difference]: Start difference. First operand has 122 places, 170 transitions, 1921 flow. Second operand 9 states and 193 transitions.
[2024-06-04 18:15:33,070 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 266 transitions, 3504 flow
[2024-06-04 18:15:33,137 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 266 transitions, 3422 flow, removed 17 selfloop flow, removed 4 redundant places.
[2024-06-04 18:15:33,140 INFO  L231             Difference]: Finished difference. Result has 132 places, 217 transitions, 2780 flow
[2024-06-04 18:15:33,140 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1845, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2780, PETRI_PLACES=132, PETRI_TRANSITIONS=217}
[2024-06-04 18:15:33,141 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 89 predicate places.
[2024-06-04 18:15:33,141 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 217 transitions, 2780 flow
[2024-06-04 18:15:33,141 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:33,141 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:33,141 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:33,141 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-04 18:15:33,141 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-04 18:15:33,141 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:33,142 INFO  L85        PathProgramCache]: Analyzing trace with hash 1560527856, now seen corresponding path program 3 times
[2024-06-04 18:15:33,142 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:33,142 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524890757]
[2024-06-04 18:15:33,142 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:33,142 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:33,190 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:40,693 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:40,693 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:40,693 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524890757]
[2024-06-04 18:15:40,693 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524890757] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:40,693 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:40,693 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:15:40,694 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681681921]
[2024-06-04 18:15:40,694 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:40,694 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:15:40,694 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:40,694 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:15:40,695 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:15:40,864 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:15:40,865 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 217 transitions, 2780 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:40,865 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:40,865 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:15:40,865 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:42,332 INFO  L124   PetriNetUnfolderBase]: 2616/4075 cut-off events.
[2024-06-04 18:15:42,332 INFO  L125   PetriNetUnfolderBase]: For 103499/103499 co-relation queries the response was YES.
[2024-06-04 18:15:42,350 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31315 conditions, 4075 events. 2616/4075 cut-off events. For 103499/103499 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 22385 event pairs, 575 based on Foata normal form. 17/4090 useless extension candidates. Maximal degree in co-relation 31249. Up to 3431 conditions per place. 
[2024-06-04 18:15:42,366 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 205 selfloop transitions, 73 changer transitions 0/283 dead transitions.
[2024-06-04 18:15:42,366 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 283 transitions, 4067 flow
[2024-06-04 18:15:42,368 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:15:42,368 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:15:42,368 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 193 transitions.
[2024-06-04 18:15:42,368 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5105820105820106
[2024-06-04 18:15:42,368 INFO  L175             Difference]: Start difference. First operand has 132 places, 217 transitions, 2780 flow. Second operand 9 states and 193 transitions.
[2024-06-04 18:15:42,369 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 283 transitions, 4067 flow
[2024-06-04 18:15:42,457 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 283 transitions, 3923 flow, removed 71 selfloop flow, removed 1 redundant places.
[2024-06-04 18:15:42,460 INFO  L231             Difference]: Finished difference. Result has 144 places, 239 transitions, 3263 flow
[2024-06-04 18:15:42,460 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2652, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3263, PETRI_PLACES=144, PETRI_TRANSITIONS=239}
[2024-06-04 18:15:42,461 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 101 predicate places.
[2024-06-04 18:15:42,461 INFO  L495      AbstractCegarLoop]: Abstraction has has 144 places, 239 transitions, 3263 flow
[2024-06-04 18:15:42,461 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:42,461 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:42,461 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:42,461 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-04 18:15:42,461 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-04 18:15:42,462 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:42,462 INFO  L85        PathProgramCache]: Analyzing trace with hash 1570051056, now seen corresponding path program 4 times
[2024-06-04 18:15:42,462 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:42,462 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672005930]
[2024-06-04 18:15:42,462 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:42,462 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:42,498 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:49,269 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:49,269 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:49,269 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672005930]
[2024-06-04 18:15:49,269 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672005930] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:49,269 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:49,269 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:15:49,269 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936687731]
[2024-06-04 18:15:49,269 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:49,270 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:15:49,270 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:49,270 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:15:49,270 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:15:49,407 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:15:49,407 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 239 transitions, 3263 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:49,407 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:49,407 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:15:49,407 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:51,045 INFO  L124   PetriNetUnfolderBase]: 2840/4455 cut-off events.
[2024-06-04 18:15:51,046 INFO  L125   PetriNetUnfolderBase]: For 130333/130333 co-relation queries the response was YES.
[2024-06-04 18:15:51,064 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36020 conditions, 4455 events. 2840/4455 cut-off events. For 130333/130333 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 25137 event pairs, 564 based on Foata normal form. 16/4469 useless extension candidates. Maximal degree in co-relation 35947. Up to 3090 conditions per place. 
[2024-06-04 18:15:51,081 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 205 selfloop transitions, 102 changer transitions 0/312 dead transitions.
[2024-06-04 18:15:51,082 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 312 transitions, 4809 flow
[2024-06-04 18:15:51,082 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:15:51,082 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:15:51,082 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 198 transitions.
[2024-06-04 18:15:51,083 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5238095238095238
[2024-06-04 18:15:51,083 INFO  L175             Difference]: Start difference. First operand has 144 places, 239 transitions, 3263 flow. Second operand 9 states and 198 transitions.
[2024-06-04 18:15:51,083 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 312 transitions, 4809 flow
[2024-06-04 18:15:51,188 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 312 transitions, 4702 flow, removed 45 selfloop flow, removed 2 redundant places.
[2024-06-04 18:15:51,192 INFO  L231             Difference]: Finished difference. Result has 153 places, 257 transitions, 3784 flow
[2024-06-04 18:15:51,192 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3156, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3784, PETRI_PLACES=153, PETRI_TRANSITIONS=257}
[2024-06-04 18:15:51,193 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 110 predicate places.
[2024-06-04 18:15:51,193 INFO  L495      AbstractCegarLoop]: Abstraction has has 153 places, 257 transitions, 3784 flow
[2024-06-04 18:15:51,193 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:51,193 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:51,193 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:51,194 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-04 18:15:51,194 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-04 18:15:51,194 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:51,194 INFO  L85        PathProgramCache]: Analyzing trace with hash 1569724626, now seen corresponding path program 5 times
[2024-06-04 18:15:51,194 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:51,194 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387550375]
[2024-06-04 18:15:51,194 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:51,195 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:51,228 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:58,930 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:58,931 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:58,931 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387550375]
[2024-06-04 18:15:58,931 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387550375] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:58,931 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:58,931 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:15:58,931 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766189311]
[2024-06-04 18:15:58,931 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:58,931 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:15:58,932 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:58,932 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:15:58,932 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:15:59,118 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:15:59,119 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 257 transitions, 3784 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:59,119 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:59,119 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:15:59,119 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:00,700 INFO  L124   PetriNetUnfolderBase]: 2879/4478 cut-off events.
[2024-06-04 18:16:00,700 INFO  L125   PetriNetUnfolderBase]: For 144410/144410 co-relation queries the response was YES.
[2024-06-04 18:16:00,724 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38276 conditions, 4478 events. 2879/4478 cut-off events. For 144410/144410 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 24996 event pairs, 683 based on Foata normal form. 16/4492 useless extension candidates. Maximal degree in co-relation 38199. Up to 3426 conditions per place. 
[2024-06-04 18:16:00,745 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 187 selfloop transitions, 113 changer transitions 0/305 dead transitions.
[2024-06-04 18:16:00,746 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 305 transitions, 4953 flow
[2024-06-04 18:16:00,746 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:16:00,746 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:16:00,746 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions.
[2024-06-04 18:16:00,747 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5158730158730159
[2024-06-04 18:16:00,747 INFO  L175             Difference]: Start difference. First operand has 153 places, 257 transitions, 3784 flow. Second operand 9 states and 195 transitions.
[2024-06-04 18:16:00,747 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 305 transitions, 4953 flow
[2024-06-04 18:16:00,895 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 305 transitions, 4784 flow, removed 42 selfloop flow, removed 4 redundant places.
[2024-06-04 18:16:00,900 INFO  L231             Difference]: Finished difference. Result has 159 places, 260 transitions, 3933 flow
[2024-06-04 18:16:00,900 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3622, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3933, PETRI_PLACES=159, PETRI_TRANSITIONS=260}
[2024-06-04 18:16:00,901 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 116 predicate places.
[2024-06-04 18:16:00,901 INFO  L495      AbstractCegarLoop]: Abstraction has has 159 places, 260 transitions, 3933 flow
[2024-06-04 18:16:00,901 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:00,901 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:00,901 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:00,901 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-04 18:16:00,901 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:16:00,902 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:00,902 INFO  L85        PathProgramCache]: Analyzing trace with hash -1703909477, now seen corresponding path program 2 times
[2024-06-04 18:16:00,902 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:00,902 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482365765]
[2024-06-04 18:16:00,902 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:00,902 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:00,932 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:11,471 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:11,472 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:11,472 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482365765]
[2024-06-04 18:16:11,472 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482365765] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:11,472 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:11,472 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:16:11,472 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924537625]
[2024-06-04 18:16:11,472 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:11,473 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:16:11,473 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:11,473 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:16:11,473 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:16:11,631 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:16:11,632 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 260 transitions, 3933 flow. Second operand  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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-04 18:16:11,632 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:11,632 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:16:11,632 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:13,030 INFO  L124   PetriNetUnfolderBase]: 2853/4446 cut-off events.
[2024-06-04 18:16:13,030 INFO  L125   PetriNetUnfolderBase]: For 140875/140875 co-relation queries the response was YES.
[2024-06-04 18:16:13,052 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38286 conditions, 4446 events. 2853/4446 cut-off events. For 140875/140875 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 24727 event pairs, 803 based on Foata normal form. 6/4451 useless extension candidates. Maximal degree in co-relation 38206. Up to 4196 conditions per place. 
[2024-06-04 18:16:13,072 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 238 selfloop transitions, 36 changer transitions 0/279 dead transitions.
[2024-06-04 18:16:13,072 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 279 transitions, 4565 flow
[2024-06-04 18:16:13,072 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:16:13,073 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:16:13,073 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions.
[2024-06-04 18:16:13,073 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44047619047619047
[2024-06-04 18:16:13,073 INFO  L175             Difference]: Start difference. First operand has 159 places, 260 transitions, 3933 flow. Second operand 8 states and 148 transitions.
[2024-06-04 18:16:13,073 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 279 transitions, 4565 flow
[2024-06-04 18:16:13,224 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 279 transitions, 4249 flow, removed 72 selfloop flow, removed 5 redundant places.
[2024-06-04 18:16:13,228 INFO  L231             Difference]: Finished difference. Result has 162 places, 260 transitions, 3714 flow
[2024-06-04 18:16:13,228 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3627, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3714, PETRI_PLACES=162, PETRI_TRANSITIONS=260}
[2024-06-04 18:16:13,228 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 119 predicate places.
[2024-06-04 18:16:13,228 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 260 transitions, 3714 flow
[2024-06-04 18:16:13,228 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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-04 18:16:13,229 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:13,229 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:13,229 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-04 18:16:13,229 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:16:13,229 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:13,229 INFO  L85        PathProgramCache]: Analyzing trace with hash 1354684633, now seen corresponding path program 1 times
[2024-06-04 18:16:13,229 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:13,229 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683329561]
[2024-06-04 18:16:13,229 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:13,229 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:13,264 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:21,411 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:21,412 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:21,412 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683329561]
[2024-06-04 18:16:21,412 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683329561] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:21,412 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:21,412 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:16:21,412 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600496031]
[2024-06-04 18:16:21,413 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:21,413 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:16:21,413 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:21,414 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:16:21,414 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:16:21,528 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:16:21,529 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 260 transitions, 3714 flow. Second operand  has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:21,529 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:21,529 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:16:21,529 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:22,792 INFO  L124   PetriNetUnfolderBase]: 2855/4449 cut-off events.
[2024-06-04 18:16:22,792 INFO  L125   PetriNetUnfolderBase]: For 137580/137580 co-relation queries the response was YES.
[2024-06-04 18:16:22,816 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37515 conditions, 4449 events. 2855/4449 cut-off events. For 137580/137580 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 24813 event pairs, 799 based on Foata normal form. 2/4450 useless extension candidates. Maximal degree in co-relation 37434. Up to 4251 conditions per place. 
[2024-06-04 18:16:22,836 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 252 selfloop transitions, 19 changer transitions 0/276 dead transitions.
[2024-06-04 18:16:22,836 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 276 transitions, 4384 flow
[2024-06-04 18:16:22,837 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:16:22,837 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:16:22,837 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions.
[2024-06-04 18:16:22,837 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-04 18:16:22,838 INFO  L175             Difference]: Start difference. First operand has 162 places, 260 transitions, 3714 flow. Second operand 6 states and 114 transitions.
[2024-06-04 18:16:22,838 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 276 transitions, 4384 flow
[2024-06-04 18:16:23,099 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 276 transitions, 4268 flow, removed 9 selfloop flow, removed 8 redundant places.
[2024-06-04 18:16:23,103 INFO  L231             Difference]: Finished difference. Result has 160 places, 263 transitions, 3684 flow
[2024-06-04 18:16:23,103 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3598, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3684, PETRI_PLACES=160, PETRI_TRANSITIONS=263}
[2024-06-04 18:16:23,103 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 117 predicate places.
[2024-06-04 18:16:23,104 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 263 transitions, 3684 flow
[2024-06-04 18:16:23,104 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:23,104 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:23,104 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:23,104 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-04 18:16:23,104 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:16:23,105 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:23,105 INFO  L85        PathProgramCache]: Analyzing trace with hash -1703902533, now seen corresponding path program 2 times
[2024-06-04 18:16:23,105 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:23,105 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617906095]
[2024-06-04 18:16:23,106 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:23,106 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:23,148 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:31,554 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:31,554 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:31,554 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617906095]
[2024-06-04 18:16:31,554 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617906095] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:31,554 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:31,554 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:16:31,554 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133072617]
[2024-06-04 18:16:31,555 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:31,555 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:16:31,555 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:31,555 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:16:31,556 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:16:31,672 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:16:31,672 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 263 transitions, 3684 flow. Second operand  has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:31,672 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:31,672 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:16:31,672 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:33,055 INFO  L124   PetriNetUnfolderBase]: 2826/4400 cut-off events.
[2024-06-04 18:16:33,055 INFO  L125   PetriNetUnfolderBase]: For 141605/141605 co-relation queries the response was YES.
[2024-06-04 18:16:33,078 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37276 conditions, 4400 events. 2826/4400 cut-off events. For 141605/141605 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 24473 event pairs, 797 based on Foata normal form. 1/4400 useless extension candidates. Maximal degree in co-relation 37194. Up to 4237 conditions per place. 
[2024-06-04 18:16:33,097 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 256 selfloop transitions, 11 changer transitions 0/272 dead transitions.
[2024-06-04 18:16:33,097 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 272 transitions, 4240 flow
[2024-06-04 18:16:33,097 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:16:33,097 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:16:33,098 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions.
[2024-06-04 18:16:33,098 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42063492063492064
[2024-06-04 18:16:33,098 INFO  L175             Difference]: Start difference. First operand has 160 places, 263 transitions, 3684 flow. Second operand 6 states and 106 transitions.
[2024-06-04 18:16:33,098 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 272 transitions, 4240 flow
[2024-06-04 18:16:33,259 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 272 transitions, 4211 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-04 18:16:33,263 INFO  L231             Difference]: Finished difference. Result has 163 places, 263 transitions, 3683 flow
[2024-06-04 18:16:33,263 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3655, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3683, PETRI_PLACES=163, PETRI_TRANSITIONS=263}
[2024-06-04 18:16:33,263 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 120 predicate places.
[2024-06-04 18:16:33,264 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 263 transitions, 3683 flow
[2024-06-04 18:16:33,264 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:33,264 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:33,264 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:33,264 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-04 18:16:33,265 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-04 18:16:33,265 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:33,265 INFO  L85        PathProgramCache]: Analyzing trace with hash 1903326266, now seen corresponding path program 1 times
[2024-06-04 18:16:33,265 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:33,265 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700073866]
[2024-06-04 18:16:33,265 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:33,266 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:33,331 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:39,684 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:39,684 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:39,684 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700073866]
[2024-06-04 18:16:39,684 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700073866] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:39,684 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:39,685 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:16:39,685 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389631057]
[2024-06-04 18:16:39,685 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:39,685 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:16:39,685 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:39,686 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:16:39,686 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:16:39,869 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:16:39,869 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 263 transitions, 3683 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-04 18:16:39,869 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:39,870 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:16:39,871 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:41,469 INFO  L124   PetriNetUnfolderBase]: 2843/4427 cut-off events.
[2024-06-04 18:16:41,470 INFO  L125   PetriNetUnfolderBase]: For 149571/149571 co-relation queries the response was YES.
[2024-06-04 18:16:41,493 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37676 conditions, 4427 events. 2843/4427 cut-off events. For 149571/149571 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 24668 event pairs, 638 based on Foata normal form. 4/4430 useless extension candidates. Maximal degree in co-relation 37593. Up to 4187 conditions per place. 
[2024-06-04 18:16:41,511 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 276 selfloop transitions, 15 changer transitions 0/296 dead transitions.
[2024-06-04 18:16:41,511 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 296 transitions, 4401 flow
[2024-06-04 18:16:41,513 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:16:41,513 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:16:41,513 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-04 18:16:41,514 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45535714285714285
[2024-06-04 18:16:41,514 INFO  L175             Difference]: Start difference. First operand has 163 places, 263 transitions, 3683 flow. Second operand 8 states and 153 transitions.
[2024-06-04 18:16:41,514 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 296 transitions, 4401 flow
[2024-06-04 18:16:41,670 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 296 transitions, 4354 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-06-04 18:16:41,674 INFO  L231             Difference]: Finished difference. Result has 165 places, 265 transitions, 3735 flow
[2024-06-04 18:16:41,674 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3636, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3735, PETRI_PLACES=165, PETRI_TRANSITIONS=265}
[2024-06-04 18:16:41,675 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 122 predicate places.
[2024-06-04 18:16:41,675 INFO  L495      AbstractCegarLoop]: Abstraction has has 165 places, 265 transitions, 3735 flow
[2024-06-04 18:16:41,675 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-04 18:16:41,675 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:41,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-04 18:16:41,675 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-04 18:16:41,675 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-04 18:16:41,676 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:41,676 INFO  L85        PathProgramCache]: Analyzing trace with hash 828496748, now seen corresponding path program 2 times
[2024-06-04 18:16:41,676 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:41,676 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797171709]
[2024-06-04 18:16:41,676 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:41,676 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:41,733 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:48,718 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:48,718 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:48,718 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797171709]
[2024-06-04 18:16:48,718 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797171709] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:48,718 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:48,718 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:16:48,719 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039430433]
[2024-06-04 18:16:48,719 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:48,719 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:16:48,719 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:48,719 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:16:48,720 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:16:48,880 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:16:48,880 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 265 transitions, 3735 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-04 18:16:48,880 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:48,880 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:16:48,880 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:50,360 INFO  L124   PetriNetUnfolderBase]: 2860/4454 cut-off events.
[2024-06-04 18:16:50,361 INFO  L125   PetriNetUnfolderBase]: For 158016/158016 co-relation queries the response was YES.
[2024-06-04 18:16:50,384 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38274 conditions, 4454 events. 2860/4454 cut-off events. For 158016/158016 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 24807 event pairs, 757 based on Foata normal form. 4/4457 useless extension candidates. Maximal degree in co-relation 38190. Up to 4240 conditions per place. 
[2024-06-04 18:16:50,404 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 276 selfloop transitions, 16 changer transitions 0/297 dead transitions.
[2024-06-04 18:16:50,404 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 297 transitions, 4457 flow
[2024-06-04 18:16:50,406 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:16:50,406 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:16:50,406 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-04 18:16:50,407 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45535714285714285
[2024-06-04 18:16:50,407 INFO  L175             Difference]: Start difference. First operand has 165 places, 265 transitions, 3735 flow. Second operand 8 states and 153 transitions.
[2024-06-04 18:16:50,407 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 297 transitions, 4457 flow
[2024-06-04 18:16:50,588 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 297 transitions, 4376 flow, removed 27 selfloop flow, removed 6 redundant places.
[2024-06-04 18:16:50,591 INFO  L231             Difference]: Finished difference. Result has 167 places, 267 transitions, 3759 flow
[2024-06-04 18:16:50,592 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3654, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3759, PETRI_PLACES=167, PETRI_TRANSITIONS=267}
[2024-06-04 18:16:50,592 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 124 predicate places.
[2024-06-04 18:16:50,592 INFO  L495      AbstractCegarLoop]: Abstraction has has 167 places, 267 transitions, 3759 flow
[2024-06-04 18:16:50,592 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-04 18:16:50,592 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:50,592 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:50,592 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-04 18:16:50,593 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-04 18:16:50,593 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:50,593 INFO  L85        PathProgramCache]: Analyzing trace with hash 1906188186, now seen corresponding path program 1 times
[2024-06-04 18:16:50,593 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:50,593 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585947831]
[2024-06-04 18:16:50,593 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:50,593 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:50,670 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:58,346 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:58,346 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:58,346 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585947831]
[2024-06-04 18:16:58,346 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585947831] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:58,346 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:58,346 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:16:58,346 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033710504]
[2024-06-04 18:16:58,347 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:58,347 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:16:58,347 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:58,347 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:16:58,347 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:16:58,482 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:16:58,482 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 267 transitions, 3759 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:58,482 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:58,483 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:16:58,483 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:00,260 INFO  L124   PetriNetUnfolderBase]: 2892/4505 cut-off events.
[2024-06-04 18:17:00,260 INFO  L125   PetriNetUnfolderBase]: For 168542/168542 co-relation queries the response was YES.
[2024-06-04 18:17:00,283 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38955 conditions, 4505 events. 2892/4505 cut-off events. For 168542/168542 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 25095 event pairs, 738 based on Foata normal form. 5/4509 useless extension candidates. Maximal degree in co-relation 38870. Up to 4197 conditions per place. 
[2024-06-04 18:17:00,301 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 258 selfloop transitions, 46 changer transitions 0/309 dead transitions.
[2024-06-04 18:17:00,301 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 309 transitions, 4689 flow
[2024-06-04 18:17:00,301 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:17:00,301 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:17:00,302 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions.
[2024-06-04 18:17:00,302 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-04 18:17:00,302 INFO  L175             Difference]: Start difference. First operand has 167 places, 267 transitions, 3759 flow. Second operand 9 states and 189 transitions.
[2024-06-04 18:17:00,302 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 309 transitions, 4689 flow
[2024-06-04 18:17:00,485 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 309 transitions, 4602 flow, removed 29 selfloop flow, removed 6 redundant places.
[2024-06-04 18:17:00,489 INFO  L231             Difference]: Finished difference. Result has 170 places, 272 transitions, 3924 flow
[2024-06-04 18:17:00,489 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3672, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3924, PETRI_PLACES=170, PETRI_TRANSITIONS=272}
[2024-06-04 18:17:00,489 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 127 predicate places.
[2024-06-04 18:17:00,490 INFO  L495      AbstractCegarLoop]: Abstraction has has 170 places, 272 transitions, 3924 flow
[2024-06-04 18:17:00,490 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:00,490 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:00,490 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:17:00,490 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-04 18:17:00,490 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-04 18:17:00,491 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:00,491 INFO  L85        PathProgramCache]: Analyzing trace with hash -2107853766, now seen corresponding path program 3 times
[2024-06-04 18:17:00,491 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:00,491 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750461249]
[2024-06-04 18:17:00,491 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:00,491 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:00,552 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:07,341 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:07,342 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:07,342 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750461249]
[2024-06-04 18:17:07,342 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750461249] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:07,342 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:07,342 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:17:07,342 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512843619]
[2024-06-04 18:17:07,342 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:07,342 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:17:07,343 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:07,343 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:17:07,343 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:17:07,479 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:17:07,479 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 272 transitions, 3924 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-04 18:17:07,480 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:07,480 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:17:07,480 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:09,039 INFO  L124   PetriNetUnfolderBase]: 2909/4538 cut-off events.
[2024-06-04 18:17:09,039 INFO  L125   PetriNetUnfolderBase]: For 177329/177329 co-relation queries the response was YES.
[2024-06-04 18:17:09,064 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40005 conditions, 4538 events. 2909/4538 cut-off events. For 177329/177329 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 25344 event pairs, 726 based on Foata normal form. 4/4541 useless extension candidates. Maximal degree in co-relation 39919. Up to 4319 conditions per place. 
[2024-06-04 18:17:09,083 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 282 selfloop transitions, 16 changer transitions 0/303 dead transitions.
[2024-06-04 18:17:09,083 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 303 transitions, 4686 flow
[2024-06-04 18:17:09,085 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:17:09,085 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:17:09,085 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-04 18:17:09,086 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44642857142857145
[2024-06-04 18:17:09,086 INFO  L175             Difference]: Start difference. First operand has 170 places, 272 transitions, 3924 flow. Second operand 8 states and 150 transitions.
[2024-06-04 18:17:09,086 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 303 transitions, 4686 flow
[2024-06-04 18:17:09,313 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 303 transitions, 4470 flow, removed 65 selfloop flow, removed 7 redundant places.
[2024-06-04 18:17:09,317 INFO  L231             Difference]: Finished difference. Result has 172 places, 276 transitions, 3855 flow
[2024-06-04 18:17:09,317 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3708, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3855, PETRI_PLACES=172, PETRI_TRANSITIONS=276}
[2024-06-04 18:17:09,318 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 129 predicate places.
[2024-06-04 18:17:09,318 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 276 transitions, 3855 flow
[2024-06-04 18:17:09,318 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-04 18:17:09,318 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:09,318 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:17:09,318 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-04 18:17:09,318 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-04 18:17:09,318 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:09,318 INFO  L85        PathProgramCache]: Analyzing trace with hash 1116098252, now seen corresponding path program 2 times
[2024-06-04 18:17:09,319 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:09,319 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526187075]
[2024-06-04 18:17:09,319 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:09,319 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:09,375 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:16,968 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:16,969 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:16,969 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526187075]
[2024-06-04 18:17:16,969 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526187075] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:16,969 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:16,969 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:17:16,969 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911222509]
[2024-06-04 18:17:16,969 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:16,969 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:17:16,970 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:16,970 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:17:16,970 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:17:17,195 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:17:17,195 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 276 transitions, 3855 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:17,195 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:17,195 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:17:17,195 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:18,932 INFO  L124   PetriNetUnfolderBase]: 2989/4672 cut-off events.
[2024-06-04 18:17:18,932 INFO  L125   PetriNetUnfolderBase]: For 193181/193181 co-relation queries the response was YES.
[2024-06-04 18:17:18,958 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41305 conditions, 4672 events. 2989/4672 cut-off events. For 193181/193181 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 26291 event pairs, 697 based on Foata normal form. 5/4676 useless extension candidates. Maximal degree in co-relation 41217. Up to 4078 conditions per place. 
[2024-06-04 18:17:18,978 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 232 selfloop transitions, 100 changer transitions 0/337 dead transitions.
[2024-06-04 18:17:18,978 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 337 transitions, 5391 flow
[2024-06-04 18:17:18,979 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:17:18,979 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:17:18,979 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions.
[2024-06-04 18:17:18,979 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5158730158730159
[2024-06-04 18:17:18,980 INFO  L175             Difference]: Start difference. First operand has 172 places, 276 transitions, 3855 flow. Second operand 9 states and 195 transitions.
[2024-06-04 18:17:18,980 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 337 transitions, 5391 flow
[2024-06-04 18:17:19,166 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 337 transitions, 5280 flow, removed 42 selfloop flow, removed 5 redundant places.
[2024-06-04 18:17:19,170 INFO  L231             Difference]: Finished difference. Result has 179 places, 297 transitions, 4545 flow
[2024-06-04 18:17:19,170 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3744, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4545, PETRI_PLACES=179, PETRI_TRANSITIONS=297}
[2024-06-04 18:17:19,170 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 136 predicate places.
[2024-06-04 18:17:19,171 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 297 transitions, 4545 flow
[2024-06-04 18:17:19,171 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:19,171 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:19,171 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:17:19,171 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-04 18:17:19,171 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-04 18:17:19,171 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:19,171 INFO  L85        PathProgramCache]: Analyzing trace with hash -1461044372, now seen corresponding path program 4 times
[2024-06-04 18:17:19,171 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:19,172 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786982887]
[2024-06-04 18:17:19,172 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:19,172 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:19,233 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:26,506 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:26,506 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:26,506 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786982887]
[2024-06-04 18:17:26,506 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786982887] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:26,506 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:26,506 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:17:26,506 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878227145]
[2024-06-04 18:17:26,506 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:26,506 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:17:26,507 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:26,507 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:17:26,507 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:17:26,645 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:17:26,645 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 297 transitions, 4545 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-04 18:17:26,645 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:26,645 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:17:26,645 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:28,163 INFO  L124   PetriNetUnfolderBase]: 2981/4661 cut-off events.
[2024-06-04 18:17:28,163 INFO  L125   PetriNetUnfolderBase]: For 203121/203121 co-relation queries the response was YES.
[2024-06-04 18:17:28,193 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42641 conditions, 4661 events. 2981/4661 cut-off events. For 203121/203121 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 26315 event pairs, 735 based on Foata normal form. 4/4663 useless extension candidates. Maximal degree in co-relation 42549. Up to 4392 conditions per place. 
[2024-06-04 18:17:28,215 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 297 selfloop transitions, 23 changer transitions 0/325 dead transitions.
[2024-06-04 18:17:28,215 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 325 transitions, 5351 flow
[2024-06-04 18:17:28,217 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:17:28,217 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:17:28,217 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-04 18:17:28,217 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44642857142857145
[2024-06-04 18:17:28,218 INFO  L175             Difference]: Start difference. First operand has 179 places, 297 transitions, 4545 flow. Second operand 8 states and 150 transitions.
[2024-06-04 18:17:28,218 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 325 transitions, 5351 flow
[2024-06-04 18:17:28,484 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 325 transitions, 5114 flow, removed 97 selfloop flow, removed 3 redundant places.
[2024-06-04 18:17:28,489 INFO  L231             Difference]: Finished difference. Result has 185 places, 301 transitions, 4477 flow
[2024-06-04 18:17:28,489 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4310, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4477, PETRI_PLACES=185, PETRI_TRANSITIONS=301}
[2024-06-04 18:17:28,490 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 142 predicate places.
[2024-06-04 18:17:28,490 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 301 transitions, 4477 flow
[2024-06-04 18:17:28,490 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-04 18:17:28,490 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:28,490 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:17:28,490 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-04 18:17:28,490 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-04 18:17:28,490 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:28,490 INFO  L85        PathProgramCache]: Analyzing trace with hash 1416815608, now seen corresponding path program 3 times
[2024-06-04 18:17:28,491 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:28,491 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985912552]
[2024-06-04 18:17:28,491 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:28,491 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:28,550 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:36,578 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:36,578 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:36,579 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985912552]
[2024-06-04 18:17:36,579 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985912552] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:36,579 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:36,579 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:17:36,579 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010982770]
[2024-06-04 18:17:36,579 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:36,579 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:17:36,579 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:36,580 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:17:36,580 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:17:36,806 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:17:36,806 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 301 transitions, 4477 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:36,806 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:36,806 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:17:36,806 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:38,601 INFO  L124   PetriNetUnfolderBase]: 3059/4780 cut-off events.
[2024-06-04 18:17:38,601 INFO  L125   PetriNetUnfolderBase]: For 219224/219224 co-relation queries the response was YES.
[2024-06-04 18:17:38,631 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43943 conditions, 4780 events. 3059/4780 cut-off events. For 219224/219224 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 27135 event pairs, 623 based on Foata normal form. 5/4782 useless extension candidates. Maximal degree in co-relation 43848. Up to 3383 conditions per place. 
[2024-06-04 18:17:38,654 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 165 selfloop transitions, 189 changer transitions 0/359 dead transitions.
[2024-06-04 18:17:38,654 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 359 transitions, 6242 flow
[2024-06-04 18:17:38,654 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:17:38,654 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:17:38,655 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 196 transitions.
[2024-06-04 18:17:38,655 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5185185185185185
[2024-06-04 18:17:38,655 INFO  L175             Difference]: Start difference. First operand has 185 places, 301 transitions, 4477 flow. Second operand 9 states and 196 transitions.
[2024-06-04 18:17:38,655 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 359 transitions, 6242 flow
[2024-06-04 18:17:38,925 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 359 transitions, 6111 flow, removed 45 selfloop flow, removed 5 redundant places.
[2024-06-04 18:17:38,931 INFO  L231             Difference]: Finished difference. Result has 192 places, 321 transitions, 5445 flow
[2024-06-04 18:17:38,931 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4346, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5445, PETRI_PLACES=192, PETRI_TRANSITIONS=321}
[2024-06-04 18:17:38,931 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 149 predicate places.
[2024-06-04 18:17:38,932 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 321 transitions, 5445 flow
[2024-06-04 18:17:38,932 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:38,932 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:38,932 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:17:38,932 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-04 18:17:38,933 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-04 18:17:38,933 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:38,933 INFO  L85        PathProgramCache]: Analyzing trace with hash -2092791954, now seen corresponding path program 4 times
[2024-06-04 18:17:38,933 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:38,933 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262878260]
[2024-06-04 18:17:38,933 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:38,934 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:39,024 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:46,470 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:46,470 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:46,470 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262878260]
[2024-06-04 18:17:46,470 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262878260] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:46,470 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:46,470 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:17:46,470 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968786566]
[2024-06-04 18:17:46,470 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:46,471 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:17:46,471 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:46,471 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:17:46,471 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:17:46,671 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:17:46,671 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 321 transitions, 5445 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:46,671 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:46,671 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:17:46,671 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:48,410 INFO  L124   PetriNetUnfolderBase]: 3105/4865 cut-off events.
[2024-06-04 18:17:48,410 INFO  L125   PetriNetUnfolderBase]: For 240315/240315 co-relation queries the response was YES.
[2024-06-04 18:17:48,440 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47317 conditions, 4865 events. 3105/4865 cut-off events. For 240315/240315 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 27828 event pairs, 627 based on Foata normal form. 5/4867 useless extension candidates. Maximal degree in co-relation 47218. Up to 3785 conditions per place. 
[2024-06-04 18:17:48,462 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 212 selfloop transitions, 151 changer transitions 0/368 dead transitions.
[2024-06-04 18:17:48,462 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 368 transitions, 6933 flow
[2024-06-04 18:17:48,462 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:17:48,462 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:17:48,463 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions.
[2024-06-04 18:17:48,463 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5158730158730159
[2024-06-04 18:17:48,463 INFO  L175             Difference]: Start difference. First operand has 192 places, 321 transitions, 5445 flow. Second operand 9 states and 195 transitions.
[2024-06-04 18:17:48,463 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 368 transitions, 6933 flow
[2024-06-04 18:17:48,757 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 368 transitions, 6650 flow, removed 128 selfloop flow, removed 2 redundant places.
[2024-06-04 18:17:48,763 INFO  L231             Difference]: Finished difference. Result has 199 places, 332 transitions, 5817 flow
[2024-06-04 18:17:48,763 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5194, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5817, PETRI_PLACES=199, PETRI_TRANSITIONS=332}
[2024-06-04 18:17:48,764 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 156 predicate places.
[2024-06-04 18:17:48,764 INFO  L495      AbstractCegarLoop]: Abstraction has has 199 places, 332 transitions, 5817 flow
[2024-06-04 18:17:48,764 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:48,764 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:48,765 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:17:48,765 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-04 18:17:48,765 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-04 18:17:48,765 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:48,765 INFO  L85        PathProgramCache]: Analyzing trace with hash -1454373172, now seen corresponding path program 5 times
[2024-06-04 18:17:48,766 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:48,766 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080760725]
[2024-06-04 18:17:48,766 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:48,766 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:48,834 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:56,311 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:56,311 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:56,311 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080760725]
[2024-06-04 18:17:56,311 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080760725] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:56,311 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:56,312 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:17:56,312 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978397097]
[2024-06-04 18:17:56,312 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:56,312 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:17:56,312 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:56,313 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:17:56,313 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:17:56,514 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:17:56,515 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 332 transitions, 5817 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:56,515 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:56,515 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:17:56,515 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:58,156 INFO  L124   PetriNetUnfolderBase]: 3137/4938 cut-off events.
[2024-06-04 18:17:58,157 INFO  L125   PetriNetUnfolderBase]: For 242340/242340 co-relation queries the response was YES.
[2024-06-04 18:17:58,188 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47547 conditions, 4938 events. 3137/4938 cut-off events. For 242340/242340 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 28446 event pairs, 634 based on Foata normal form. 5/4940 useless extension candidates. Maximal degree in co-relation 47446. Up to 3820 conditions per place. 
[2024-06-04 18:17:58,213 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 231 selfloop transitions, 145 changer transitions 0/381 dead transitions.
[2024-06-04 18:17:58,213 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 381 transitions, 7359 flow
[2024-06-04 18:17:58,214 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:17:58,214 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:17:58,214 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions.
[2024-06-04 18:17:58,214 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5158730158730159
[2024-06-04 18:17:58,215 INFO  L175             Difference]: Start difference. First operand has 199 places, 332 transitions, 5817 flow. Second operand 9 states and 195 transitions.
[2024-06-04 18:17:58,215 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 381 transitions, 7359 flow
[2024-06-04 18:17:58,545 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 381 transitions, 6997 flow, removed 90 selfloop flow, removed 5 redundant places.
[2024-06-04 18:17:58,551 INFO  L231             Difference]: Finished difference. Result has 204 places, 345 transitions, 6157 flow
[2024-06-04 18:17:58,551 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5462, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6157, PETRI_PLACES=204, PETRI_TRANSITIONS=345}
[2024-06-04 18:17:58,551 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 161 predicate places.
[2024-06-04 18:17:58,551 INFO  L495      AbstractCegarLoop]: Abstraction has has 204 places, 345 transitions, 6157 flow
[2024-06-04 18:17:58,552 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:58,552 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:58,552 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:17:58,552 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-04 18:17:58,552 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:17:58,552 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:58,552 INFO  L85        PathProgramCache]: Analyzing trace with hash -954448158, now seen corresponding path program 1 times
[2024-06-04 18:17:58,552 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:58,552 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840020546]
[2024-06-04 18:17:58,552 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:58,553 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:58,584 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:18:07,373 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:18:07,373 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:18:07,373 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840020546]
[2024-06-04 18:18:07,373 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840020546] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:18:07,373 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:18:07,373 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:18:07,374 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847758853]
[2024-06-04 18:18:07,374 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:18:07,374 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:18:07,374 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:18:07,374 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:18:07,374 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:18:07,543 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:18:07,543 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 345 transitions, 6157 flow. Second operand  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:07,543 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:18:07,543 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:18:07,543 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:18:09,261 INFO  L124   PetriNetUnfolderBase]: 3229/5077 cut-off events.
[2024-06-04 18:18:09,262 INFO  L125   PetriNetUnfolderBase]: For 258956/258956 co-relation queries the response was YES.
[2024-06-04 18:18:09,292 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49862 conditions, 5077 events. 3229/5077 cut-off events. For 258956/258956 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 29281 event pairs, 650 based on Foata normal form. 12/5088 useless extension candidates. Maximal degree in co-relation 49759. Up to 4162 conditions per place. 
[2024-06-04 18:18:09,316 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 304 selfloop transitions, 86 changer transitions 0/395 dead transitions.
[2024-06-04 18:18:09,317 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 395 transitions, 7750 flow
[2024-06-04 18:18:09,317 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:18:09,317 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:18:09,318 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions.
[2024-06-04 18:18:09,318 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4880952380952381
[2024-06-04 18:18:09,318 INFO  L175             Difference]: Start difference. First operand has 204 places, 345 transitions, 6157 flow. Second operand 8 states and 164 transitions.
[2024-06-04 18:18:09,318 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 395 transitions, 7750 flow
[2024-06-04 18:18:09,648 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 395 transitions, 7517 flow, removed 103 selfloop flow, removed 2 redundant places.
[2024-06-04 18:18:09,653 INFO  L231             Difference]: Finished difference. Result has 211 places, 362 transitions, 6536 flow
[2024-06-04 18:18:09,654 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5924, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6536, PETRI_PLACES=211, PETRI_TRANSITIONS=362}
[2024-06-04 18:18:09,654 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 168 predicate places.
[2024-06-04 18:18:09,654 INFO  L495      AbstractCegarLoop]: Abstraction has has 211 places, 362 transitions, 6536 flow
[2024-06-04 18:18:09,654 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:09,654 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:18:09,654 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:18:09,655 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-04 18:18:09,655 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:18:09,655 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:18:09,655 INFO  L85        PathProgramCache]: Analyzing trace with hash -1281369792, now seen corresponding path program 2 times
[2024-06-04 18:18:09,655 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:18:09,655 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652129534]
[2024-06-04 18:18:09,655 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:18:09,655 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:18:09,694 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:18:17,926 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:18:17,926 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:18:17,926 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652129534]
[2024-06-04 18:18:17,927 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652129534] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:18:17,927 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:18:17,927 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:18:17,927 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55861046]
[2024-06-04 18:18:17,927 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:18:17,927 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:18:17,927 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:18:17,927 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:18:17,927 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:18:18,072 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:18:18,073 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 362 transitions, 6536 flow. Second operand  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:18,073 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:18:18,073 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:18:18,073 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:18:19,732 INFO  L124   PetriNetUnfolderBase]: 3267/5128 cut-off events.
[2024-06-04 18:18:19,732 INFO  L125   PetriNetUnfolderBase]: For 263460/263460 co-relation queries the response was YES.
[2024-06-04 18:18:19,765 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51008 conditions, 5128 events. 3267/5128 cut-off events. For 263460/263460 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 29578 event pairs, 743 based on Foata normal form. 6/5133 useless extension candidates. Maximal degree in co-relation 50902. Up to 4698 conditions per place. 
[2024-06-04 18:18:19,789 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 343 selfloop transitions, 44 changer transitions 0/392 dead transitions.
[2024-06-04 18:18:19,789 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 392 transitions, 7682 flow
[2024-06-04 18:18:19,790 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:18:19,790 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:18:19,790 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions.
[2024-06-04 18:18:19,790 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43386243386243384
[2024-06-04 18:18:19,790 INFO  L175             Difference]: Start difference. First operand has 211 places, 362 transitions, 6536 flow. Second operand 9 states and 164 transitions.
[2024-06-04 18:18:19,791 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 392 transitions, 7682 flow
[2024-06-04 18:18:20,111 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 392 transitions, 7533 flow, removed 37 selfloop flow, removed 4 redundant places.
[2024-06-04 18:18:20,118 INFO  L231             Difference]: Finished difference. Result has 216 places, 368 transitions, 6638 flow
[2024-06-04 18:18:20,118 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6390, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6638, PETRI_PLACES=216, PETRI_TRANSITIONS=368}
[2024-06-04 18:18:20,119 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 173 predicate places.
[2024-06-04 18:18:20,119 INFO  L495      AbstractCegarLoop]: Abstraction has has 216 places, 368 transitions, 6638 flow
[2024-06-04 18:18:20,119 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:20,119 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:18:20,119 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:18:20,120 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-04 18:18:20,120 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:18:20,120 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:18:20,120 INFO  L85        PathProgramCache]: Analyzing trace with hash 1794786934, now seen corresponding path program 3 times
[2024-06-04 18:18:20,120 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:18:20,121 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013768135]
[2024-06-04 18:18:20,121 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:18:20,121 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:18:20,159 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:18:28,053 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:18:28,053 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:18:28,053 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013768135]
[2024-06-04 18:18:28,053 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013768135] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:18:28,054 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:18:28,054 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:18:28,054 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042400015]
[2024-06-04 18:18:28,054 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:18:28,054 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:18:28,054 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:18:28,054 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:18:28,054 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:18:28,155 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:18:28,155 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 368 transitions, 6638 flow. Second operand  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:28,155 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:18:28,156 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:18:28,156 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:18:29,753 INFO  L124   PetriNetUnfolderBase]: 3249/5108 cut-off events.
[2024-06-04 18:18:29,753 INFO  L125   PetriNetUnfolderBase]: For 266232/266232 co-relation queries the response was YES.
[2024-06-04 18:18:29,786 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50293 conditions, 5108 events. 3249/5108 cut-off events. For 266232/266232 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 29533 event pairs, 754 based on Foata normal form. 6/5113 useless extension candidates. Maximal degree in co-relation 50186. Up to 4794 conditions per place. 
[2024-06-04 18:18:29,809 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 356 selfloop transitions, 27 changer transitions 0/388 dead transitions.
[2024-06-04 18:18:29,809 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 388 transitions, 7483 flow
[2024-06-04 18:18:29,810 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:18:29,810 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:18:29,810 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions.
[2024-06-04 18:18:29,810 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42063492063492064
[2024-06-04 18:18:29,810 INFO  L175             Difference]: Start difference. First operand has 216 places, 368 transitions, 6638 flow. Second operand 9 states and 159 transitions.
[2024-06-04 18:18:29,810 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 388 transitions, 7483 flow
[2024-06-04 18:18:30,159 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 388 transitions, 7199 flow, removed 44 selfloop flow, removed 8 redundant places.
[2024-06-04 18:18:30,165 INFO  L231             Difference]: Finished difference. Result has 217 places, 368 transitions, 6417 flow
[2024-06-04 18:18:30,165 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6354, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6417, PETRI_PLACES=217, PETRI_TRANSITIONS=368}
[2024-06-04 18:18:30,165 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 174 predicate places.
[2024-06-04 18:18:30,165 INFO  L495      AbstractCegarLoop]: Abstraction has has 217 places, 368 transitions, 6417 flow
[2024-06-04 18:18:30,165 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:30,165 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:18:30,166 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:18:30,166 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-04 18:18:30,166 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:18:30,166 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:18:30,166 INFO  L85        PathProgramCache]: Analyzing trace with hash 1794795862, now seen corresponding path program 1 times
[2024-06-04 18:18:30,166 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:18:30,166 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339827769]
[2024-06-04 18:18:30,166 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:18:30,166 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:18:30,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:18:41,121 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:18:41,121 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:18:41,122 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339827769]
[2024-06-04 18:18:41,122 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339827769] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:18:41,122 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:18:41,122 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:18:41,122 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135000352]
[2024-06-04 18:18:41,122 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:18:41,122 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:18:41,122 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:18:41,123 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:18:41,123 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:18:41,281 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:18:41,281 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 368 transitions, 6417 flow. Second operand  has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:41,281 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:18:41,281 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:18:41,281 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:18:42,946 INFO  L124   PetriNetUnfolderBase]: 3288/5163 cut-off events.
[2024-06-04 18:18:42,946 INFO  L125   PetriNetUnfolderBase]: For 276995/276995 co-relation queries the response was YES.
[2024-06-04 18:18:42,976 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50251 conditions, 5163 events. 3288/5163 cut-off events. For 276995/276995 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 29775 event pairs, 756 based on Foata normal form. 14/5176 useless extension candidates. Maximal degree in co-relation 50144. Up to 4763 conditions per place. 
[2024-06-04 18:18:42,999 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 350 selfloop transitions, 40 changer transitions 0/395 dead transitions.
[2024-06-04 18:18:42,999 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 395 transitions, 7384 flow
[2024-06-04 18:18:43,000 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:18:43,000 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:18:43,000 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions.
[2024-06-04 18:18:43,000 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43915343915343913
[2024-06-04 18:18:43,000 INFO  L175             Difference]: Start difference. First operand has 217 places, 368 transitions, 6417 flow. Second operand 9 states and 166 transitions.
[2024-06-04 18:18:43,000 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 395 transitions, 7384 flow
[2024-06-04 18:18:43,312 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 395 transitions, 7215 flow, removed 23 selfloop flow, removed 10 redundant places.
[2024-06-04 18:18:43,319 INFO  L231             Difference]: Finished difference. Result has 216 places, 370 transitions, 6382 flow
[2024-06-04 18:18:43,319 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6248, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6382, PETRI_PLACES=216, PETRI_TRANSITIONS=370}
[2024-06-04 18:18:43,320 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 173 predicate places.
[2024-06-04 18:18:43,320 INFO  L495      AbstractCegarLoop]: Abstraction has has 216 places, 370 transitions, 6382 flow
[2024-06-04 18:18:43,320 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:43,320 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:18:43,321 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-04 18:18:43,321 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-04 18:18:43,321 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-04 18:18:43,321 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:18:43,321 INFO  L85        PathProgramCache]: Analyzing trace with hash -967967907, now seen corresponding path program 1 times
[2024-06-04 18:18:43,322 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:18:43,322 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271901009]
[2024-06-04 18:18:43,322 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:18:43,322 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:18:43,399 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:18:50,739 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:18:50,740 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:18:50,740 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271901009]
[2024-06-04 18:18:50,740 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271901009] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:18:50,740 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:18:50,740 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:18:50,740 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486050649]
[2024-06-04 18:18:50,741 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:18:50,741 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:18:50,741 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:18:50,741 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:18:50,742 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:18:50,975 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:18:50,975 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 370 transitions, 6382 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:50,975 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:18:50,976 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:18:50,976 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:18:52,786 INFO  L124   PetriNetUnfolderBase]: 3403/5350 cut-off events.
[2024-06-04 18:18:52,786 INFO  L125   PetriNetUnfolderBase]: For 293402/293402 co-relation queries the response was YES.
[2024-06-04 18:18:52,817 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52144 conditions, 5350 events. 3403/5350 cut-off events. For 293402/293402 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 31159 event pairs, 623 based on Foata normal form. 10/5359 useless extension candidates. Maximal degree in co-relation 52039. Up to 4822 conditions per place. 
[2024-06-04 18:18:52,840 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 374 selfloop transitions, 42 changer transitions 0/421 dead transitions.
[2024-06-04 18:18:52,841 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 421 transitions, 7814 flow
[2024-06-04 18:18:52,841 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:18:52,841 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:18:52,841 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions.
[2024-06-04 18:18:52,842 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-04 18:18:52,842 INFO  L175             Difference]: Start difference. First operand has 216 places, 370 transitions, 6382 flow. Second operand 9 states and 189 transitions.
[2024-06-04 18:18:52,842 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 421 transitions, 7814 flow
[2024-06-04 18:18:53,219 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 421 transitions, 7714 flow, removed 13 selfloop flow, removed 7 redundant places.
[2024-06-04 18:18:53,225 INFO  L231             Difference]: Finished difference. Result has 220 places, 381 transitions, 6715 flow
[2024-06-04 18:18:53,225 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6282, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6715, PETRI_PLACES=220, PETRI_TRANSITIONS=381}
[2024-06-04 18:18:53,226 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 177 predicate places.
[2024-06-04 18:18:53,226 INFO  L495      AbstractCegarLoop]: Abstraction has has 220 places, 381 transitions, 6715 flow
[2024-06-04 18:18:53,226 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:53,226 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:18:53,226 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-04 18:18:53,226 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-04 18:18:53,226 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-04 18:18:53,227 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:18:53,227 INFO  L85        PathProgramCache]: Analyzing trace with hash -86403295, now seen corresponding path program 2 times
[2024-06-04 18:18:53,227 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:18:53,227 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820016132]
[2024-06-04 18:18:53,227 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:18:53,227 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:18:53,289 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:18:59,780 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:18:59,780 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:18:59,780 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820016132]
[2024-06-04 18:18:59,780 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820016132] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:18:59,780 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:18:59,780 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:18:59,780 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855696265]
[2024-06-04 18:18:59,780 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:18:59,781 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:18:59,781 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:18:59,781 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:18:59,781 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:19:00,005 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:19:00,005 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 381 transitions, 6715 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:19:00,005 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:19:00,005 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:19:00,006 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:19:01,998 INFO  L124   PetriNetUnfolderBase]: 3649/5720 cut-off events.
[2024-06-04 18:19:01,998 INFO  L125   PetriNetUnfolderBase]: For 351462/351462 co-relation queries the response was YES.
[2024-06-04 18:19:02,033 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57390 conditions, 5720 events. 3649/5720 cut-off events. For 351462/351462 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 33699 event pairs, 775 based on Foata normal form. 16/5735 useless extension candidates. Maximal degree in co-relation 57282. Up to 5011 conditions per place. 
[2024-06-04 18:19:02,058 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 385 selfloop transitions, 45 changer transitions 0/435 dead transitions.
[2024-06-04 18:19:02,059 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 435 transitions, 8321 flow
[2024-06-04 18:19:02,059 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:19:02,059 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:19:02,059 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 196 transitions.
[2024-06-04 18:19:02,060 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5185185185185185
[2024-06-04 18:19:02,060 INFO  L175             Difference]: Start difference. First operand has 220 places, 381 transitions, 6715 flow. Second operand 9 states and 196 transitions.
[2024-06-04 18:19:02,060 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 435 transitions, 8321 flow
[2024-06-04 18:19:02,528 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 435 transitions, 8088 flow, removed 97 selfloop flow, removed 4 redundant places.
[2024-06-04 18:19:02,534 INFO  L231             Difference]: Finished difference. Result has 226 places, 387 transitions, 6803 flow
[2024-06-04 18:19:02,534 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6482, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6803, PETRI_PLACES=226, PETRI_TRANSITIONS=387}
[2024-06-04 18:19:02,535 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 183 predicate places.
[2024-06-04 18:19:02,535 INFO  L495      AbstractCegarLoop]: Abstraction has has 226 places, 387 transitions, 6803 flow
[2024-06-04 18:19:02,535 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:19:02,535 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:19:02,535 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-04 18:19:02,535 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-04 18:19:02,536 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-04 18:19:02,536 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:19:02,536 INFO  L85        PathProgramCache]: Analyzing trace with hash -86255425, now seen corresponding path program 3 times
[2024-06-04 18:19:02,536 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:19:02,536 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353168477]
[2024-06-04 18:19:02,536 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:19:02,537 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:19:02,581 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:19:09,796 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:19:09,796 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:19:09,797 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353168477]
[2024-06-04 18:19:09,797 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353168477] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:19:09,797 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:19:09,797 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:19:09,797 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141813252]
[2024-06-04 18:19:09,797 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:19:09,797 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:19:09,797 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:19:09,797 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:19:09,798 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:19:10,010 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:19:10,011 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 387 transitions, 6803 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:19:10,011 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:19:10,011 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:19:10,011 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:19:12,069 INFO  L124   PetriNetUnfolderBase]: 3642/5715 cut-off events.
[2024-06-04 18:19:12,069 INFO  L125   PetriNetUnfolderBase]: For 353255/353255 co-relation queries the response was YES.
[2024-06-04 18:19:12,107 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57056 conditions, 5715 events. 3642/5715 cut-off events. For 353255/353255 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 33690 event pairs, 818 based on Foata normal form. 16/5730 useless extension candidates. Maximal degree in co-relation 56945. Up to 5250 conditions per place. 
[2024-06-04 18:19:12,134 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 382 selfloop transitions, 44 changer transitions 0/431 dead transitions.
[2024-06-04 18:19:12,134 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 431 transitions, 8053 flow
[2024-06-04 18:19:12,134 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:19:12,134 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:19:12,134 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions.
[2024-06-04 18:19:12,135 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5052910052910053
[2024-06-04 18:19:12,135 INFO  L175             Difference]: Start difference. First operand has 226 places, 387 transitions, 6803 flow. Second operand 9 states and 191 transitions.
[2024-06-04 18:19:12,135 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 431 transitions, 8053 flow
[2024-06-04 18:19:12,599 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 431 transitions, 7906 flow, removed 48 selfloop flow, removed 5 redundant places.
[2024-06-04 18:19:12,606 INFO  L231             Difference]: Finished difference. Result has 230 places, 390 transitions, 6887 flow
[2024-06-04 18:19:12,606 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6664, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6887, PETRI_PLACES=230, PETRI_TRANSITIONS=390}
[2024-06-04 18:19:12,606 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 187 predicate places.
[2024-06-04 18:19:12,606 INFO  L495      AbstractCegarLoop]: Abstraction has has 230 places, 390 transitions, 6887 flow
[2024-06-04 18:19:12,607 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:19:12,607 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:19:12,607 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-04 18:19:12,607 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-04 18:19:12,607 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-04 18:19:12,608 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:19:12,608 INFO  L85        PathProgramCache]: Analyzing trace with hash -1037707023, now seen corresponding path program 1 times
[2024-06-04 18:19:12,608 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:19:12,608 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879306534]
[2024-06-04 18:19:12,608 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:19:12,608 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:19:12,663 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:19:19,441 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:19:19,441 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:19:19,442 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879306534]
[2024-06-04 18:19:19,442 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879306534] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:19:19,442 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:19:19,442 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:19:19,442 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121830214]
[2024-06-04 18:19:19,442 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:19:19,442 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:19:19,444 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:19:19,444 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:19:19,444 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:19:19,779 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:19:19,779 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 390 transitions, 6887 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-04 18:19:19,779 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:19:19,780 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:19:19,780 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:19:22,045 INFO  L124   PetriNetUnfolderBase]: 3877/6126 cut-off events.
[2024-06-04 18:19:22,046 INFO  L125   PetriNetUnfolderBase]: For 420005/420005 co-relation queries the response was YES.
[2024-06-04 18:19:22,092 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60357 conditions, 6126 events. 3877/6126 cut-off events. For 420005/420005 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 36725 event pairs, 898 based on Foata normal form. 58/6183 useless extension candidates. Maximal degree in co-relation 60244. Up to 5319 conditions per place. 
[2024-06-04 18:19:22,120 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 387 selfloop transitions, 48 changer transitions 0/440 dead transitions.
[2024-06-04 18:19:22,120 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 440 transitions, 8181 flow
[2024-06-04 18:19:22,121 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:19:22,121 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:19:22,121 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 212 transitions.
[2024-06-04 18:19:22,121 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5047619047619047
[2024-06-04 18:19:22,121 INFO  L175             Difference]: Start difference. First operand has 230 places, 390 transitions, 6887 flow. Second operand 10 states and 212 transitions.
[2024-06-04 18:19:22,121 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 440 transitions, 8181 flow
[2024-06-04 18:19:22,765 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 440 transitions, 8030 flow, removed 34 selfloop flow, removed 7 redundant places.
[2024-06-04 18:19:22,771 INFO  L231             Difference]: Finished difference. Result has 233 places, 392 transitions, 6955 flow
[2024-06-04 18:19:22,771 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6736, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6955, PETRI_PLACES=233, PETRI_TRANSITIONS=392}
[2024-06-04 18:19:22,772 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 190 predicate places.
[2024-06-04 18:19:22,772 INFO  L495      AbstractCegarLoop]: Abstraction has has 233 places, 392 transitions, 6955 flow
[2024-06-04 18:19:22,772 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-04 18:19:22,772 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:19:22,772 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-04 18:19:22,772 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-04 18:19:22,772 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-04 18:19:22,773 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:19:22,773 INFO  L85        PathProgramCache]: Analyzing trace with hash -27625649, now seen corresponding path program 4 times
[2024-06-04 18:19:22,773 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:19:22,773 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392748655]
[2024-06-04 18:19:22,773 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:19:22,773 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:19:22,828 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:19:29,794 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:19:29,794 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:19:29,794 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392748655]
[2024-06-04 18:19:29,794 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392748655] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:19:29,794 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:19:29,794 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:19:29,794 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017296660]
[2024-06-04 18:19:29,794 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:19:29,795 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:19:29,795 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:19:29,795 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:19:29,795 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:19:29,997 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:19:29,997 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 392 transitions, 6955 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:19:29,997 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:19:29,997 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:19:29,997 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:19:32,195 INFO  L124   PetriNetUnfolderBase]: 3986/6288 cut-off events.
[2024-06-04 18:19:32,195 INFO  L125   PetriNetUnfolderBase]: For 397763/397763 co-relation queries the response was YES.
[2024-06-04 18:19:32,242 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 62227 conditions, 6288 events. 3986/6288 cut-off events. For 397763/397763 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 37881 event pairs, 905 based on Foata normal form. 16/6303 useless extension candidates. Maximal degree in co-relation 62113. Up to 5754 conditions per place. 
[2024-06-04 18:19:32,272 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 386 selfloop transitions, 50 changer transitions 0/441 dead transitions.
[2024-06-04 18:19:32,273 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 441 transitions, 8383 flow
[2024-06-04 18:19:32,273 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:19:32,273 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:19:32,273 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions.
[2024-06-04 18:19:32,274 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5026455026455027
[2024-06-04 18:19:32,274 INFO  L175             Difference]: Start difference. First operand has 233 places, 392 transitions, 6955 flow. Second operand 9 states and 190 transitions.
[2024-06-04 18:19:32,274 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 441 transitions, 8383 flow
[2024-06-04 18:19:32,979 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 441 transitions, 8218 flow, removed 37 selfloop flow, removed 8 redundant places.
[2024-06-04 18:19:32,985 INFO  L231             Difference]: Finished difference. Result has 235 places, 401 transitions, 7175 flow
[2024-06-04 18:19:32,985 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6790, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7175, PETRI_PLACES=235, PETRI_TRANSITIONS=401}
[2024-06-04 18:19:32,985 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 192 predicate places.
[2024-06-04 18:19:32,986 INFO  L495      AbstractCegarLoop]: Abstraction has has 235 places, 401 transitions, 7175 flow
[2024-06-04 18:19:32,986 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:19:32,986 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:19:32,986 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-04 18:19:32,986 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-04 18:19:32,986 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-04 18:19:32,986 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:19:32,986 INFO  L85        PathProgramCache]: Analyzing trace with hash 32649407, now seen corresponding path program 5 times
[2024-06-04 18:19:32,986 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:19:32,987 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946568515]
[2024-06-04 18:19:32,987 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:19:32,987 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:19:33,034 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:19:40,006 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:19:40,006 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:19:40,006 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946568515]
[2024-06-04 18:19:40,006 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946568515] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:19:40,006 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:19:40,006 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:19:40,006 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425818147]
[2024-06-04 18:19:40,006 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:19:40,006 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:19:40,007 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:19:40,007 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:19:40,007 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:19:40,227 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:19:40,227 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 401 transitions, 7175 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:19:40,227 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:19:40,227 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:19:40,227 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:19:42,451 INFO  L124   PetriNetUnfolderBase]: 4063/6416 cut-off events.
[2024-06-04 18:19:42,451 INFO  L125   PetriNetUnfolderBase]: For 407617/407617 co-relation queries the response was YES.
[2024-06-04 18:19:42,498 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 63266 conditions, 6416 events. 4063/6416 cut-off events. For 407617/407617 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 38835 event pairs, 914 based on Foata normal form. 16/6431 useless extension candidates. Maximal degree in co-relation 63150. Up to 5877 conditions per place. 
[2024-06-04 18:19:42,528 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 393 selfloop transitions, 50 changer transitions 0/448 dead transitions.
[2024-06-04 18:19:42,528 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 448 transitions, 8643 flow
[2024-06-04 18:19:42,529 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:19:42,529 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:19:42,529 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions.
[2024-06-04 18:19:42,529 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5026455026455027
[2024-06-04 18:19:42,530 INFO  L175             Difference]: Start difference. First operand has 235 places, 401 transitions, 7175 flow. Second operand 9 states and 190 transitions.
[2024-06-04 18:19:42,530 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 448 transitions, 8643 flow
[2024-06-04 18:19:43,239 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 448 transitions, 8459 flow, removed 54 selfloop flow, removed 5 redundant places.
[2024-06-04 18:19:43,245 INFO  L231             Difference]: Finished difference. Result has 240 places, 408 transitions, 7323 flow
[2024-06-04 18:19:43,245 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6995, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7323, PETRI_PLACES=240, PETRI_TRANSITIONS=408}
[2024-06-04 18:19:43,245 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 197 predicate places.
[2024-06-04 18:19:43,245 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 408 transitions, 7323 flow
[2024-06-04 18:19:43,245 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:19:43,245 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:19:43,245 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-04 18:19:43,245 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-04 18:19:43,246 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:19:43,246 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:19:43,246 INFO  L85        PathProgramCache]: Analyzing trace with hash -918956013, now seen corresponding path program 6 times
[2024-06-04 18:19:43,246 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:19:43,246 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541038357]
[2024-06-04 18:19:43,246 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:19:43,246 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:19:43,298 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:19:51,663 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:19:51,663 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:19:51,663 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541038357]
[2024-06-04 18:19:51,663 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541038357] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:19:51,663 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:19:51,663 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:19:51,663 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065320772]
[2024-06-04 18:19:51,664 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:19:51,664 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:19:51,664 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:19:51,664 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:19:51,664 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:19:51,851 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:19:51,852 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 408 transitions, 7323 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:19:51,852 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:19:51,852 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:19:51,852 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:19:54,147 INFO  L124   PetriNetUnfolderBase]: 4225/6666 cut-off events.
[2024-06-04 18:19:54,147 INFO  L125   PetriNetUnfolderBase]: For 444351/444351 co-relation queries the response was YES.
[2024-06-04 18:19:54,197 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 66556 conditions, 6666 events. 4225/6666 cut-off events. For 444351/444351 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 40683 event pairs, 920 based on Foata normal form. 16/6681 useless extension candidates. Maximal degree in co-relation 66438. Up to 5805 conditions per place. 
[2024-06-04 18:19:54,229 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 400 selfloop transitions, 54 changer transitions 0/459 dead transitions.
[2024-06-04 18:19:54,229 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 459 transitions, 9017 flow
[2024-06-04 18:19:54,229 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:19:54,229 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:19:54,230 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 194 transitions.
[2024-06-04 18:19:54,230 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5132275132275133
[2024-06-04 18:19:54,230 INFO  L175             Difference]: Start difference. First operand has 240 places, 408 transitions, 7323 flow. Second operand 9 states and 194 transitions.
[2024-06-04 18:19:54,230 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 459 transitions, 9017 flow
[2024-06-04 18:19:54,980 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 459 transitions, 8853 flow, removed 54 selfloop flow, removed 4 redundant places.
[2024-06-04 18:19:54,988 INFO  L231             Difference]: Finished difference. Result has 246 places, 414 transitions, 7545 flow
[2024-06-04 18:19:54,989 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7159, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7545, PETRI_PLACES=246, PETRI_TRANSITIONS=414}
[2024-06-04 18:19:54,989 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 203 predicate places.
[2024-06-04 18:19:54,989 INFO  L495      AbstractCegarLoop]: Abstraction has has 246 places, 414 transitions, 7545 flow
[2024-06-04 18:19:54,989 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:19:54,989 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:19:54,990 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-04 18:19:54,990 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-04 18:19:54,990 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:19:54,990 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:19:54,990 INFO  L85        PathProgramCache]: Analyzing trace with hash -711881841, now seen corresponding path program 2 times
[2024-06-04 18:19:54,990 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:19:54,991 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537371414]
[2024-06-04 18:19:54,991 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:19:54,991 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:19:55,075 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:20:02,676 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:20:02,677 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:20:02,677 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537371414]
[2024-06-04 18:20:02,677 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537371414] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:20:02,677 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:20:02,677 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:20:02,677 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360184864]
[2024-06-04 18:20:02,677 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:20:02,677 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:20:02,677 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:20:02,678 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:20:02,678 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:20:02,917 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:20:02,918 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 414 transitions, 7545 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-04 18:20:02,918 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:20:02,918 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:20:02,918 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:20:05,638 INFO  L124   PetriNetUnfolderBase]: 4761/7576 cut-off events.
[2024-06-04 18:20:05,638 INFO  L125   PetriNetUnfolderBase]: For 617888/617888 co-relation queries the response was YES.
[2024-06-04 18:20:05,689 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 77332 conditions, 7576 events. 4761/7576 cut-off events. For 617888/617888 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 47666 event pairs, 969 based on Foata normal form. 48/7623 useless extension candidates. Maximal degree in co-relation 77212. Up to 5074 conditions per place. 
[2024-06-04 18:20:05,723 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 352 selfloop transitions, 121 changer transitions 0/478 dead transitions.
[2024-06-04 18:20:05,724 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 478 transitions, 9627 flow
[2024-06-04 18:20:05,724 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:20:05,724 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:20:05,725 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 224 transitions.
[2024-06-04 18:20:05,725 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5333333333333333
[2024-06-04 18:20:05,725 INFO  L175             Difference]: Start difference. First operand has 246 places, 414 transitions, 7545 flow. Second operand 10 states and 224 transitions.
[2024-06-04 18:20:05,726 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 478 transitions, 9627 flow
[2024-06-04 18:20:06,477 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 478 transitions, 9467 flow, removed 59 selfloop flow, removed 4 redundant places.
[2024-06-04 18:20:06,484 INFO  L231             Difference]: Finished difference. Result has 253 places, 419 transitions, 7943 flow
[2024-06-04 18:20:06,484 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7385, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7943, PETRI_PLACES=253, PETRI_TRANSITIONS=419}
[2024-06-04 18:20:06,485 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 210 predicate places.
[2024-06-04 18:20:06,485 INFO  L495      AbstractCegarLoop]: Abstraction has has 253 places, 419 transitions, 7943 flow
[2024-06-04 18:20:06,485 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-04 18:20:06,485 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:20:06,485 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-04 18:20:06,485 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-04 18:20:06,486 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:20:06,486 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:20:06,486 INFO  L85        PathProgramCache]: Analyzing trace with hash 239308799, now seen corresponding path program 3 times
[2024-06-04 18:20:06,486 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:20:06,486 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58370946]
[2024-06-04 18:20:06,486 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:20:06,487 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:20:06,545 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:20:13,792 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:20:13,792 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:20:13,792 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58370946]
[2024-06-04 18:20:13,792 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58370946] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:20:13,792 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:20:13,792 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:20:13,793 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366093382]
[2024-06-04 18:20:13,793 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:20:13,793 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:20:13,793 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:20:13,793 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:20:13,794 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:20:13,981 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:20:13,981 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 419 transitions, 7943 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-04 18:20:13,981 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:20:13,981 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:20:13,981 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:20:16,668 INFO  L124   PetriNetUnfolderBase]: 4818/7674 cut-off events.
[2024-06-04 18:20:16,668 INFO  L125   PetriNetUnfolderBase]: For 609842/609842 co-relation queries the response was YES.
[2024-06-04 18:20:16,728 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 77186 conditions, 7674 events. 4818/7674 cut-off events. For 609842/609842 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 48620 event pairs, 1179 based on Foata normal form. 58/7731 useless extension candidates. Maximal degree in co-relation 77063. Up to 6563 conditions per place. 
[2024-06-04 18:20:16,763 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 351 selfloop transitions, 114 changer transitions 0/470 dead transitions.
[2024-06-04 18:20:16,763 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 470 transitions, 9478 flow
[2024-06-04 18:20:16,764 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:20:16,764 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:20:16,764 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 218 transitions.
[2024-06-04 18:20:16,764 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5190476190476191
[2024-06-04 18:20:16,764 INFO  L175             Difference]: Start difference. First operand has 253 places, 419 transitions, 7943 flow. Second operand 10 states and 218 transitions.
[2024-06-04 18:20:16,764 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 470 transitions, 9478 flow
[2024-06-04 18:20:17,963 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 470 transitions, 9207 flow, removed 52 selfloop flow, removed 7 redundant places.
[2024-06-04 18:20:17,969 INFO  L231             Difference]: Finished difference. Result has 256 places, 419 transitions, 7909 flow
[2024-06-04 18:20:17,969 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7672, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7909, PETRI_PLACES=256, PETRI_TRANSITIONS=419}
[2024-06-04 18:20:17,969 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 213 predicate places.
[2024-06-04 18:20:17,970 INFO  L495      AbstractCegarLoop]: Abstraction has has 256 places, 419 transitions, 7909 flow
[2024-06-04 18:20:17,970 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-04 18:20:17,970 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:20:17,970 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-04 18:20:17,970 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-04 18:20:17,970 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-04 18:20:17,970 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:20:17,970 INFO  L85        PathProgramCache]: Analyzing trace with hash 1302972174, now seen corresponding path program 1 times
[2024-06-04 18:20:17,970 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:20:17,970 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247948680]
[2024-06-04 18:20:17,970 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:20:17,971 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:20:18,006 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:20:25,927 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:20:25,927 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:20:25,927 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247948680]
[2024-06-04 18:20:25,927 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247948680] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:20:25,928 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:20:25,928 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:20:25,928 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088593573]
[2024-06-04 18:20:25,928 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:20:25,928 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:20:25,928 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:20:25,928 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:20:25,929 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:20:26,028 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:20:26,028 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 419 transitions, 7909 flow. Second operand  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:26,028 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:20:26,028 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:20:26,028 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:20:28,443 INFO  L124   PetriNetUnfolderBase]: 4806/7670 cut-off events.
[2024-06-04 18:20:28,443 INFO  L125   PetriNetUnfolderBase]: For 538102/538102 co-relation queries the response was YES.
[2024-06-04 18:20:28,501 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 76661 conditions, 7670 events. 4806/7670 cut-off events. For 538102/538102 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 48729 event pairs, 1317 based on Foata normal form. 4/7673 useless extension candidates. Maximal degree in co-relation 76537. Up to 7202 conditions per place. 
[2024-06-04 18:20:28,536 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 389 selfloop transitions, 48 changer transitions 0/442 dead transitions.
[2024-06-04 18:20:28,536 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 442 transitions, 8982 flow
[2024-06-04 18:20:28,536 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:20:28,537 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:20:28,537 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-04 18:20:28,537 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46130952380952384
[2024-06-04 18:20:28,537 INFO  L175             Difference]: Start difference. First operand has 256 places, 419 transitions, 7909 flow. Second operand 8 states and 155 transitions.
[2024-06-04 18:20:28,537 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 442 transitions, 8982 flow
[2024-06-04 18:20:29,374 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 442 transitions, 8739 flow, removed 40 selfloop flow, removed 6 redundant places.
[2024-06-04 18:20:29,380 INFO  L231             Difference]: Finished difference. Result has 258 places, 419 transitions, 7776 flow
[2024-06-04 18:20:29,380 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7666, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7776, PETRI_PLACES=258, PETRI_TRANSITIONS=419}
[2024-06-04 18:20:29,380 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 215 predicate places.
[2024-06-04 18:20:29,380 INFO  L495      AbstractCegarLoop]: Abstraction has has 258 places, 419 transitions, 7776 flow
[2024-06-04 18:20:29,381 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:29,381 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:20:29,381 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-04 18:20:29,381 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-04 18:20:29,381 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-04 18:20:29,381 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:20:29,381 INFO  L85        PathProgramCache]: Analyzing trace with hash -1646655270, now seen corresponding path program 2 times
[2024-06-04 18:20:29,381 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:20:29,381 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661898899]
[2024-06-04 18:20:29,382 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:20:29,382 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:20:29,415 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:20:37,352 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:20:37,353 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:20:37,353 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661898899]
[2024-06-04 18:20:37,353 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661898899] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:20:37,353 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:20:37,353 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:20:37,353 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590214283]
[2024-06-04 18:20:37,353 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:20:37,353 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:20:37,354 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:20:37,354 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:20:37,354 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:20:37,518 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:20:37,518 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 419 transitions, 7776 flow. Second operand  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:37,518 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:20:37,518 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:20:37,518 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:20:39,816 INFO  L124   PetriNetUnfolderBase]: 4816/7694 cut-off events.
[2024-06-04 18:20:39,816 INFO  L125   PetriNetUnfolderBase]: For 533730/533730 co-relation queries the response was YES.
[2024-06-04 18:20:39,871 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 76171 conditions, 7694 events. 4816/7694 cut-off events. For 533730/533730 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 48982 event pairs, 1337 based on Foata normal form. 2/7695 useless extension candidates. Maximal degree in co-relation 76046. Up to 7355 conditions per place. 
[2024-06-04 18:20:39,902 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 412 selfloop transitions, 26 changer transitions 0/443 dead transitions.
[2024-06-04 18:20:39,902 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 443 transitions, 8862 flow
[2024-06-04 18:20:39,903 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:20:39,903 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:20:39,903 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions.
[2024-06-04 18:20:39,903 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43154761904761907
[2024-06-04 18:20:39,903 INFO  L175             Difference]: Start difference. First operand has 258 places, 419 transitions, 7776 flow. Second operand 8 states and 145 transitions.
[2024-06-04 18:20:39,904 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 443 transitions, 8862 flow
[2024-06-04 18:20:40,814 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 443 transitions, 8784 flow, removed 8 selfloop flow, removed 5 redundant places.
[2024-06-04 18:20:40,821 INFO  L231             Difference]: Finished difference. Result has 261 places, 425 transitions, 7907 flow
[2024-06-04 18:20:40,821 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7703, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7907, PETRI_PLACES=261, PETRI_TRANSITIONS=425}
[2024-06-04 18:20:40,821 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 218 predicate places.
[2024-06-04 18:20:40,821 INFO  L495      AbstractCegarLoop]: Abstraction has has 261 places, 425 transitions, 7907 flow
[2024-06-04 18:20:40,822 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:40,822 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:20:40,822 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-04 18:20:40,822 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-04 18:20:40,822 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:20:40,822 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:20:40,822 INFO  L85        PathProgramCache]: Analyzing trace with hash -1161700385, now seen corresponding path program 7 times
[2024-06-04 18:20:40,822 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:20:40,822 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105925578]
[2024-06-04 18:20:40,822 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:20:40,823 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:20:40,871 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:20:47,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-04 18:20:47,844 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:20:47,844 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105925578]
[2024-06-04 18:20:47,844 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105925578] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:20:47,844 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:20:47,844 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:20:47,844 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181471102]
[2024-06-04 18:20:47,845 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:20:47,845 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:20:47,845 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:20:47,845 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:20:47,845 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:20:48,014 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:20:48,015 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 425 transitions, 7907 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:48,015 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:20:48,015 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:20:48,015 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:20:50,587 INFO  L124   PetriNetUnfolderBase]: 4925/7869 cut-off events.
[2024-06-04 18:20:50,587 INFO  L125   PetriNetUnfolderBase]: For 579135/579135 co-relation queries the response was YES.
[2024-06-04 18:20:50,651 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 78038 conditions, 7869 events. 4925/7869 cut-off events. For 579135/579135 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 50225 event pairs, 1178 based on Foata normal form. 16/7883 useless extension candidates. Maximal degree in co-relation 77912. Up to 6773 conditions per place. 
[2024-06-04 18:20:50,687 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 371 selfloop transitions, 100 changer transitions 0/476 dead transitions.
[2024-06-04 18:20:50,687 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 476 transitions, 9610 flow
[2024-06-04 18:20:50,688 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:20:50,688 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:20:50,688 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions.
[2024-06-04 18:20:50,688 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5079365079365079
[2024-06-04 18:20:50,688 INFO  L175             Difference]: Start difference. First operand has 261 places, 425 transitions, 7907 flow. Second operand 9 states and 192 transitions.
[2024-06-04 18:20:50,689 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 476 transitions, 9610 flow
[2024-06-04 18:20:51,433 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 476 transitions, 9562 flow, removed 8 selfloop flow, removed 4 redundant places.
[2024-06-04 18:20:51,440 INFO  L231             Difference]: Finished difference. Result has 267 places, 434 transitions, 8347 flow
[2024-06-04 18:20:51,440 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7859, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8347, PETRI_PLACES=267, PETRI_TRANSITIONS=434}
[2024-06-04 18:20:51,440 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 224 predicate places.
[2024-06-04 18:20:51,440 INFO  L495      AbstractCegarLoop]: Abstraction has has 267 places, 434 transitions, 8347 flow
[2024-06-04 18:20:51,440 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:51,440 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:20:51,440 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-04 18:20:51,441 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-04 18:20:51,441 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-04 18:20:51,441 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:20:51,441 INFO  L85        PathProgramCache]: Analyzing trace with hash -123840773, now seen corresponding path program 8 times
[2024-06-04 18:20:51,441 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:20:51,441 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101780698]
[2024-06-04 18:20:51,441 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:20:51,441 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:20:51,508 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:20:58,252 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:20:58,252 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:20:58,252 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101780698]
[2024-06-04 18:20:58,252 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101780698] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:20:58,253 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:20:58,253 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:20:58,253 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327068497]
[2024-06-04 18:20:58,253 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:20:58,253 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:20:58,253 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:20:58,254 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:20:58,254 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:20:58,467 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:20:58,467 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 434 transitions, 8347 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:58,467 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:20:58,467 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:20:58,467 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:21:01,150 INFO  L124   PetriNetUnfolderBase]: 5002/7987 cut-off events.
[2024-06-04 18:21:01,151 INFO  L125   PetriNetUnfolderBase]: For 608164/608164 co-relation queries the response was YES.
[2024-06-04 18:21:01,217 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 80479 conditions, 7987 events. 5002/7987 cut-off events. For 608164/608164 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 51128 event pairs, 1175 based on Foata normal form. 16/8001 useless extension candidates. Maximal degree in co-relation 80351. Up to 6896 conditions per place. 
[2024-06-04 18:21:01,254 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 377 selfloop transitions, 98 changer transitions 0/480 dead transitions.
[2024-06-04 18:21:01,255 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 480 transitions, 10079 flow
[2024-06-04 18:21:01,255 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:21:01,255 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:21:01,255 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions.
[2024-06-04 18:21:01,256 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5079365079365079
[2024-06-04 18:21:01,256 INFO  L175             Difference]: Start difference. First operand has 267 places, 434 transitions, 8347 flow. Second operand 9 states and 192 transitions.
[2024-06-04 18:21:01,256 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 480 transitions, 10079 flow
[2024-06-04 18:21:02,234 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 480 transitions, 9813 flow, removed 65 selfloop flow, removed 5 redundant places.
[2024-06-04 18:21:02,240 INFO  L231             Difference]: Finished difference. Result has 272 places, 439 transitions, 8525 flow
[2024-06-04 18:21:02,241 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8081, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8525, PETRI_PLACES=272, PETRI_TRANSITIONS=439}
[2024-06-04 18:21:02,241 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 229 predicate places.
[2024-06-04 18:21:02,241 INFO  L495      AbstractCegarLoop]: Abstraction has has 272 places, 439 transitions, 8525 flow
[2024-06-04 18:21:02,241 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:21:02,241 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:21:02,241 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-04 18:21:02,241 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-04 18:21:02,241 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-04 18:21:02,242 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:21:02,242 INFO  L85        PathProgramCache]: Analyzing trace with hash 716093263, now seen corresponding path program 9 times
[2024-06-04 18:21:02,242 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:21:02,242 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546064821]
[2024-06-04 18:21:02,242 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:21:02,242 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:21:02,295 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:21:09,142 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:21:09,142 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:21:09,142 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546064821]
[2024-06-04 18:21:09,142 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546064821] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:21:09,143 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:21:09,143 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:21:09,143 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521514715]
[2024-06-04 18:21:09,143 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:21:09,143 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:21:09,143 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:21:09,143 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:21:09,144 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:21:09,318 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:21:09,318 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 439 transitions, 8525 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:21:09,318 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:21:09,318 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:21:09,318 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:21:11,931 INFO  L124   PetriNetUnfolderBase]: 5076/8108 cut-off events.
[2024-06-04 18:21:11,931 INFO  L125   PetriNetUnfolderBase]: For 631570/631570 co-relation queries the response was YES.
[2024-06-04 18:21:11,992 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 81911 conditions, 8108 events. 5076/8108 cut-off events. For 631570/631570 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 52046 event pairs, 1194 based on Foata normal form. 16/8122 useless extension candidates. Maximal degree in co-relation 81781. Up to 7016 conditions per place. 
[2024-06-04 18:21:12,029 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 367 selfloop transitions, 110 changer transitions 0/482 dead transitions.
[2024-06-04 18:21:12,029 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 482 transitions, 10109 flow
[2024-06-04 18:21:12,030 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:21:12,030 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:21:12,030 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions.
[2024-06-04 18:21:12,030 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5052910052910053
[2024-06-04 18:21:12,030 INFO  L175             Difference]: Start difference. First operand has 272 places, 439 transitions, 8525 flow. Second operand 9 states and 191 transitions.
[2024-06-04 18:21:12,030 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 482 transitions, 10109 flow
[2024-06-04 18:21:12,822 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 482 transitions, 9762 flow, removed 71 selfloop flow, removed 6 redundant places.
[2024-06-04 18:21:12,828 INFO  L231             Difference]: Finished difference. Result has 275 places, 442 transitions, 8577 flow
[2024-06-04 18:21:12,829 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8178, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8577, PETRI_PLACES=275, PETRI_TRANSITIONS=442}
[2024-06-04 18:21:12,829 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 232 predicate places.
[2024-06-04 18:21:12,829 INFO  L495      AbstractCegarLoop]: Abstraction has has 275 places, 442 transitions, 8577 flow
[2024-06-04 18:21:12,829 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:21:12,829 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:21:12,830 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-04 18:21:12,830 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-04 18:21:12,830 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-04 18:21:12,830 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:21:12,830 INFO  L85        PathProgramCache]: Analyzing trace with hash -1167210635, now seen corresponding path program 10 times
[2024-06-04 18:21:12,830 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:21:12,831 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819767397]
[2024-06-04 18:21:12,831 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:21:12,831 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:21:12,890 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:21:19,726 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:21:19,727 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:21:19,727 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819767397]
[2024-06-04 18:21:19,727 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819767397] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:21:19,727 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:21:19,727 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:21:19,727 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822685428]
[2024-06-04 18:21:19,727 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:21:19,727 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:21:19,727 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:21:19,728 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:21:19,728 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:21:19,892 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:21:19,893 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 442 transitions, 8577 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:21:19,893 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:21:19,893 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:21:19,893 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:21:22,692 INFO  L124   PetriNetUnfolderBase]: 5246/8367 cut-off events.
[2024-06-04 18:21:22,692 INFO  L125   PetriNetUnfolderBase]: For 680575/680575 co-relation queries the response was YES.
[2024-06-04 18:21:22,760 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 85204 conditions, 8367 events. 5246/8367 cut-off events. For 680575/680575 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 53974 event pairs, 1189 based on Foata normal form. 16/8381 useless extension candidates. Maximal degree in co-relation 85074. Up to 6791 conditions per place. 
[2024-06-04 18:21:22,797 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 385 selfloop transitions, 104 changer transitions 0/494 dead transitions.
[2024-06-04 18:21:22,797 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 494 transitions, 10605 flow
[2024-06-04 18:21:22,798 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:21:22,798 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:21:22,798 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 196 transitions.
[2024-06-04 18:21:22,798 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5185185185185185
[2024-06-04 18:21:22,798 INFO  L175             Difference]: Start difference. First operand has 275 places, 442 transitions, 8577 flow. Second operand 9 states and 196 transitions.
[2024-06-04 18:21:22,798 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 494 transitions, 10605 flow
[2024-06-04 18:21:24,050 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 494 transitions, 10303 flow, removed 67 selfloop flow, removed 6 redundant places.
[2024-06-04 18:21:24,056 INFO  L231             Difference]: Finished difference. Result has 279 places, 448 transitions, 8810 flow
[2024-06-04 18:21:24,057 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8275, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8810, PETRI_PLACES=279, PETRI_TRANSITIONS=448}
[2024-06-04 18:21:24,057 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 236 predicate places.
[2024-06-04 18:21:24,057 INFO  L495      AbstractCegarLoop]: Abstraction has has 279 places, 448 transitions, 8810 flow
[2024-06-04 18:21:24,057 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:21:24,057 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:21:24,057 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-04 18:21:24,057 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-04 18:21:24,058 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-04 18:21:24,058 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:21:24,058 INFO  L85        PathProgramCache]: Analyzing trace with hash -967755023, now seen corresponding path program 4 times
[2024-06-04 18:21:24,058 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:21:24,058 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682175239]
[2024-06-04 18:21:24,058 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:21:24,058 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:21:24,126 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:21:31,500 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:21:31,500 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:21:31,500 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682175239]
[2024-06-04 18:21:31,500 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682175239] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:21:31,500 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:21:31,501 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:21:31,501 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501790883]
[2024-06-04 18:21:31,501 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:21:31,501 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:21:31,501 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:21:31,501 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:21:31,501 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:21:31,642 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:21:31,642 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 448 transitions, 8810 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-04 18:21:31,643 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:21:31,643 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:21:31,643 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:21:34,557 INFO  L124   PetriNetUnfolderBase]: 5513/8807 cut-off events.
[2024-06-04 18:21:34,557 INFO  L125   PetriNetUnfolderBase]: For 793664/793664 co-relation queries the response was YES.
[2024-06-04 18:21:34,633 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 89556 conditions, 8807 events. 5513/8807 cut-off events. For 793664/793664 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 57427 event pairs, 1307 based on Foata normal form. 58/8863 useless extension candidates. Maximal degree in co-relation 89425. Up to 7391 conditions per place. 
[2024-06-04 18:21:34,673 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 393 selfloop transitions, 104 changer transitions 0/502 dead transitions.
[2024-06-04 18:21:34,673 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 502 transitions, 10530 flow
[2024-06-04 18:21:34,673 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:21:34,674 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:21:34,674 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 213 transitions.
[2024-06-04 18:21:34,674 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5071428571428571
[2024-06-04 18:21:34,674 INFO  L175             Difference]: Start difference. First operand has 279 places, 448 transitions, 8810 flow. Second operand 10 states and 213 transitions.
[2024-06-04 18:21:34,674 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 502 transitions, 10530 flow
[2024-06-04 18:21:35,806 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 502 transitions, 10194 flow, removed 77 selfloop flow, removed 6 redundant places.
[2024-06-04 18:21:35,812 INFO  L231             Difference]: Finished difference. Result has 284 places, 455 transitions, 8921 flow
[2024-06-04 18:21:35,813 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8476, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8921, PETRI_PLACES=284, PETRI_TRANSITIONS=455}
[2024-06-04 18:21:35,813 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 241 predicate places.
[2024-06-04 18:21:35,813 INFO  L495      AbstractCegarLoop]: Abstraction has has 284 places, 455 transitions, 8921 flow
[2024-06-04 18:21:35,813 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-04 18:21:35,813 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:21:35,813 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-04 18:21:35,813 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-04 18:21:35,813 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-04 18:21:35,815 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:21:35,815 INFO  L85        PathProgramCache]: Analyzing trace with hash 1615625571, now seen corresponding path program 5 times
[2024-06-04 18:21:35,816 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:21:35,816 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918416915]
[2024-06-04 18:21:35,816 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:21:35,816 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:21:35,880 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:21:42,913 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:21:42,913 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:21:42,913 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918416915]
[2024-06-04 18:21:42,913 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918416915] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:21:42,913 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:21:42,913 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:21:42,914 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844589127]
[2024-06-04 18:21:42,914 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:21:42,914 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:21:42,915 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:21:42,915 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:21:42,915 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:21:43,071 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:21:43,071 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 455 transitions, 8921 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-04 18:21:43,071 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:21:43,071 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:21:43,071 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:21:46,114 INFO  L124   PetriNetUnfolderBase]: 5745/9217 cut-off events.
[2024-06-04 18:21:46,114 INFO  L125   PetriNetUnfolderBase]: For 826392/826392 co-relation queries the response was YES.
[2024-06-04 18:21:46,185 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 92370 conditions, 9217 events. 5745/9217 cut-off events. For 826392/826392 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 60904 event pairs, 1392 based on Foata normal form. 58/9273 useless extension candidates. Maximal degree in co-relation 92237. Up to 7751 conditions per place. 
[2024-06-04 18:21:46,224 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 379 selfloop transitions, 123 changer transitions 0/507 dead transitions.
[2024-06-04 18:21:46,225 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 507 transitions, 10615 flow
[2024-06-04 18:21:46,225 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:21:46,225 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:21:46,225 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions.
[2024-06-04 18:21:46,225 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5095238095238095
[2024-06-04 18:21:46,226 INFO  L175             Difference]: Start difference. First operand has 284 places, 455 transitions, 8921 flow. Second operand 10 states and 214 transitions.
[2024-06-04 18:21:46,226 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 507 transitions, 10615 flow
[2024-06-04 18:21:47,250 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 507 transitions, 10320 flow, removed 57 selfloop flow, removed 6 redundant places.
[2024-06-04 18:21:47,257 INFO  L231             Difference]: Finished difference. Result has 289 places, 460 transitions, 9067 flow
[2024-06-04 18:21:47,257 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8626, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9067, PETRI_PLACES=289, PETRI_TRANSITIONS=460}
[2024-06-04 18:21:47,257 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 246 predicate places.
[2024-06-04 18:21:47,257 INFO  L495      AbstractCegarLoop]: Abstraction has has 289 places, 460 transitions, 9067 flow
[2024-06-04 18:21:47,257 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-04 18:21:47,258 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:21:47,258 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-04 18:21:47,258 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-04 18:21:47,258 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-04 18:21:47,258 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:21:47,258 INFO  L85        PathProgramCache]: Analyzing trace with hash 971879153, now seen corresponding path program 6 times
[2024-06-04 18:21:47,258 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:21:47,258 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135049721]
[2024-06-04 18:21:47,258 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:21:47,258 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:21:47,327 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:21:55,175 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:21:55,176 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:21:55,176 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135049721]
[2024-06-04 18:21:55,176 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135049721] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:21:55,176 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:21:55,176 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:21:55,176 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431922109]
[2024-06-04 18:21:55,176 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:21:55,176 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:21:55,176 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:21:55,177 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:21:55,177 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:21:55,363 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:21:55,363 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 460 transitions, 9067 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-04 18:21:55,363 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:21:55,363 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:21:55,363 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:21:58,829 INFO  L124   PetriNetUnfolderBase]: 6376/10290 cut-off events.
[2024-06-04 18:21:58,829 INFO  L125   PetriNetUnfolderBase]: For 985819/985819 co-relation queries the response was YES.
[2024-06-04 18:21:58,913 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 104494 conditions, 10290 events. 6376/10290 cut-off events. For 985819/985819 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 69907 event pairs, 1486 based on Foata normal form. 54/10342 useless extension candidates. Maximal degree in co-relation 104359. Up to 7173 conditions per place. 
[2024-06-04 18:21:58,958 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 353 selfloop transitions, 183 changer transitions 0/541 dead transitions.
[2024-06-04 18:21:58,958 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 541 transitions, 11659 flow
[2024-06-04 18:21:58,958 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-04 18:21:58,959 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-04 18:21:58,959 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 245 transitions.
[2024-06-04 18:21:58,959 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5303030303030303
[2024-06-04 18:21:58,959 INFO  L175             Difference]: Start difference. First operand has 289 places, 460 transitions, 9067 flow. Second operand 11 states and 245 transitions.
[2024-06-04 18:21:58,959 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 541 transitions, 11659 flow
[2024-06-04 18:22:00,230 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 541 transitions, 11257 flow, removed 55 selfloop flow, removed 8 redundant places.
[2024-06-04 18:22:00,237 INFO  L231             Difference]: Finished difference. Result has 295 places, 479 transitions, 9706 flow
[2024-06-04 18:22:00,238 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8665, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9706, PETRI_PLACES=295, PETRI_TRANSITIONS=479}
[2024-06-04 18:22:00,238 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 252 predicate places.
[2024-06-04 18:22:00,238 INFO  L495      AbstractCegarLoop]: Abstraction has has 295 places, 479 transitions, 9706 flow
[2024-06-04 18:22:00,238 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-04 18:22:00,238 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:22:00,238 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-04 18:22:00,238 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-04 18:22:00,238 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-04 18:22:00,239 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:22:00,239 INFO  L85        PathProgramCache]: Analyzing trace with hash -960136463, now seen corresponding path program 7 times
[2024-06-04 18:22:00,239 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:22:00,239 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915300149]
[2024-06-04 18:22:00,239 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:22:00,239 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:22:00,290 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:22:08,020 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:22:08,020 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:22:08,021 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915300149]
[2024-06-04 18:22:08,021 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915300149] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:22:08,021 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:22:08,021 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:22:08,021 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98032528]
[2024-06-04 18:22:08,021 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:22:08,021 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:22:08,021 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:22:08,021 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:22:08,021 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:22:08,197 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:22:08,197 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 479 transitions, 9706 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-04 18:22:08,197 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:22:08,197 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:22:08,197 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:22:12,318 INFO  L124   PetriNetUnfolderBase]: 6904/11196 cut-off events.
[2024-06-04 18:22:12,318 INFO  L125   PetriNetUnfolderBase]: For 1146434/1146434 co-relation queries the response was YES.
[2024-06-04 18:22:12,420 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 116217 conditions, 11196 events. 6904/11196 cut-off events. For 1146434/1146434 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 77877 event pairs, 1783 based on Foata normal form. 48/11242 useless extension candidates. Maximal degree in co-relation 116078. Up to 8686 conditions per place. 
[2024-06-04 18:22:12,473 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 411 selfloop transitions, 124 changer transitions 0/540 dead transitions.
[2024-06-04 18:22:12,473 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 540 transitions, 11938 flow
[2024-06-04 18:22:12,474 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:22:12,474 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:22:12,474 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 220 transitions.
[2024-06-04 18:22:12,474 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5238095238095238
[2024-06-04 18:22:12,474 INFO  L175             Difference]: Start difference. First operand has 295 places, 479 transitions, 9706 flow. Second operand 10 states and 220 transitions.
[2024-06-04 18:22:12,474 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 540 transitions, 11938 flow
[2024-06-04 18:22:14,389 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 540 transitions, 11645 flow, removed 72 selfloop flow, removed 5 redundant places.
[2024-06-04 18:22:14,396 INFO  L231             Difference]: Finished difference. Result has 301 places, 484 transitions, 10016 flow
[2024-06-04 18:22:14,397 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9413, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10016, PETRI_PLACES=301, PETRI_TRANSITIONS=484}
[2024-06-04 18:22:14,397 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 258 predicate places.
[2024-06-04 18:22:14,397 INFO  L495      AbstractCegarLoop]: Abstraction has has 301 places, 484 transitions, 10016 flow
[2024-06-04 18:22:14,397 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-04 18:22:14,397 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:22:14,398 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-04 18:22:14,398 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-04 18:22:14,398 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:22:14,398 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:22:14,398 INFO  L85        PathProgramCache]: Analyzing trace with hash -960403373, now seen corresponding path program 8 times
[2024-06-04 18:22:14,399 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:22:14,399 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780351665]
[2024-06-04 18:22:14,399 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:22:14,399 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:22:14,465 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:22:21,678 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:22:21,678 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:22:21,678 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780351665]
[2024-06-04 18:22:21,678 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780351665] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:22:21,678 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:22:21,679 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:22:21,679 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530428387]
[2024-06-04 18:22:21,679 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:22:21,679 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:22:21,679 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:22:21,679 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:22:21,679 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:22:21,877 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:22:21,878 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 484 transitions, 10016 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-04 18:22:21,878 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:22:21,878 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:22:21,878 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:22:26,231 INFO  L124   PetriNetUnfolderBase]: 7139/11594 cut-off events.
[2024-06-04 18:22:26,232 INFO  L125   PetriNetUnfolderBase]: For 1213121/1213121 co-relation queries the response was YES.
[2024-06-04 18:22:26,320 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 120375 conditions, 11594 events. 7139/11594 cut-off events. For 1213121/1213121 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 81375 event pairs, 1960 based on Foata normal form. 58/11650 useless extension candidates. Maximal degree in co-relation 120233. Up to 10011 conditions per place. 
[2024-06-04 18:22:26,368 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 410 selfloop transitions, 118 changer transitions 0/533 dead transitions.
[2024-06-04 18:22:26,369 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 533 transitions, 11764 flow
[2024-06-04 18:22:26,369 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:22:26,369 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:22:26,370 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions.
[2024-06-04 18:22:26,370 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5095238095238095
[2024-06-04 18:22:26,370 INFO  L175             Difference]: Start difference. First operand has 301 places, 484 transitions, 10016 flow. Second operand 10 states and 214 transitions.
[2024-06-04 18:22:26,370 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 533 transitions, 11764 flow
[2024-06-04 18:22:28,066 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 533 transitions, 11485 flow, removed 75 selfloop flow, removed 5 redundant places.
[2024-06-04 18:22:28,074 INFO  L231             Difference]: Finished difference. Result has 306 places, 486 transitions, 10146 flow
[2024-06-04 18:22:28,074 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9753, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10146, PETRI_PLACES=306, PETRI_TRANSITIONS=486}
[2024-06-04 18:22:28,074 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 263 predicate places.
[2024-06-04 18:22:28,074 INFO  L495      AbstractCegarLoop]: Abstraction has has 306 places, 486 transitions, 10146 flow
[2024-06-04 18:22:28,074 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-04 18:22:28,074 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:22:28,075 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-04 18:22:28,075 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-04 18:22:28,075 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:22:28,075 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:22:28,075 INFO  L85        PathProgramCache]: Analyzing trace with hash -1167056813, now seen corresponding path program 9 times
[2024-06-04 18:22:28,075 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:22:28,075 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751303205]
[2024-06-04 18:22:28,075 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:22:28,075 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:22:28,136 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:22:35,952 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:22:35,952 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:22:35,952 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751303205]
[2024-06-04 18:22:35,952 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751303205] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:22:35,952 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:22:35,953 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:22:35,953 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653108304]
[2024-06-04 18:22:35,953 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:22:35,953 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:22:35,953 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:22:35,953 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:22:35,953 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:22:36,183 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:22:36,184 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 486 transitions, 10146 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-04 18:22:36,184 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:22:36,184 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:22:36,184 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:22:40,313 INFO  L124   PetriNetUnfolderBase]: 7069/11503 cut-off events.
[2024-06-04 18:22:40,313 INFO  L125   PetriNetUnfolderBase]: For 1112359/1112359 co-relation queries the response was YES.
[2024-06-04 18:22:40,403 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 116093 conditions, 11503 events. 7069/11503 cut-off events. For 1112359/1112359 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 80988 event pairs, 1931 based on Foata normal form. 58/11559 useless extension candidates. Maximal degree in co-relation 115949. Up to 9997 conditions per place. 
[2024-06-04 18:22:40,450 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 427 selfloop transitions, 102 changer transitions 0/534 dead transitions.
[2024-06-04 18:22:40,450 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 534 transitions, 11870 flow
[2024-06-04 18:22:40,451 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:22:40,451 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:22:40,451 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 213 transitions.
[2024-06-04 18:22:40,451 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5071428571428571
[2024-06-04 18:22:40,451 INFO  L175             Difference]: Start difference. First operand has 306 places, 486 transitions, 10146 flow. Second operand 10 states and 213 transitions.
[2024-06-04 18:22:40,451 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 534 transitions, 11870 flow
[2024-06-04 18:22:42,281 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 534 transitions, 11447 flow, removed 97 selfloop flow, removed 7 redundant places.
[2024-06-04 18:22:42,288 INFO  L231             Difference]: Finished difference. Result has 309 places, 486 transitions, 9936 flow
[2024-06-04 18:22:42,289 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9723, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9936, PETRI_PLACES=309, PETRI_TRANSITIONS=486}
[2024-06-04 18:22:42,289 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 266 predicate places.
[2024-06-04 18:22:42,289 INFO  L495      AbstractCegarLoop]: Abstraction has has 309 places, 486 transitions, 9936 flow
[2024-06-04 18:22:42,289 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-04 18:22:42,289 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:22:42,290 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-04 18:22:42,290 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-04 18:22:42,290 INFO  L420      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:22:42,290 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:22:42,290 INFO  L85        PathProgramCache]: Analyzing trace with hash 716099215, now seen corresponding path program 10 times
[2024-06-04 18:22:42,290 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:22:42,290 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992186060]
[2024-06-04 18:22:42,290 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:22:42,291 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:22:42,348 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:22:49,980 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:22:49,981 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:22:49,981 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992186060]
[2024-06-04 18:22:49,981 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992186060] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:22:49,981 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:22:49,981 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:22:49,981 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173231271]
[2024-06-04 18:22:49,982 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:22:49,982 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:22:49,982 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:22:49,982 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:22:49,982 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:22:50,206 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:22:50,207 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 486 transitions, 9936 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-04 18:22:50,207 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:22:50,207 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:22:50,207 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:22:54,158 INFO  L124   PetriNetUnfolderBase]: 7294/11883 cut-off events.
[2024-06-04 18:22:54,158 INFO  L125   PetriNetUnfolderBase]: For 1124130/1124130 co-relation queries the response was YES.
[2024-06-04 18:22:54,265 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 117900 conditions, 11883 events. 7294/11883 cut-off events. For 1124130/1124130 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 84273 event pairs, 2025 based on Foata normal form. 58/11939 useless extension candidates. Maximal degree in co-relation 117755. Up to 10393 conditions per place. 
[2024-06-04 18:22:54,318 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 416 selfloop transitions, 114 changer transitions 0/535 dead transitions.
[2024-06-04 18:22:54,319 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 535 transitions, 11688 flow
[2024-06-04 18:22:54,319 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:22:54,319 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:22:54,319 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 212 transitions.
[2024-06-04 18:22:54,320 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5047619047619047
[2024-06-04 18:22:54,320 INFO  L175             Difference]: Start difference. First operand has 309 places, 486 transitions, 9936 flow. Second operand 10 states and 212 transitions.
[2024-06-04 18:22:54,320 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 535 transitions, 11688 flow
[2024-06-04 18:22:56,330 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 535 transitions, 11480 flow, removed 16 selfloop flow, removed 7 redundant places.
[2024-06-04 18:22:56,337 INFO  L231             Difference]: Finished difference. Result has 312 places, 488 transitions, 10121 flow
[2024-06-04 18:22:56,338 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9728, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10121, PETRI_PLACES=312, PETRI_TRANSITIONS=488}
[2024-06-04 18:22:56,338 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 269 predicate places.
[2024-06-04 18:22:56,338 INFO  L495      AbstractCegarLoop]: Abstraction has has 312 places, 488 transitions, 10121 flow
[2024-06-04 18:22:56,338 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-04 18:22:56,339 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:22:56,339 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-04 18:22:56,339 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-04 18:22:56,339 INFO  L420      AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:22:56,339 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:22:56,339 INFO  L85        PathProgramCache]: Analyzing trace with hash -1386769063, now seen corresponding path program 11 times
[2024-06-04 18:22:56,339 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:22:56,339 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573426410]
[2024-06-04 18:22:56,340 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:22:56,340 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:22:56,417 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:23:03,984 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:23:03,984 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:23:03,984 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573426410]
[2024-06-04 18:23:03,984 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573426410] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:23:03,985 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:23:03,985 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:23:03,985 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562190040]
[2024-06-04 18:23:03,985 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:23:03,985 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:23:03,985 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:23:03,985 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:23:03,985 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:23:04,228 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:23:04,228 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 488 transitions, 10121 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-04 18:23:04,228 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:23:04,228 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:23:04,228 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:23:09,200 INFO  L124   PetriNetUnfolderBase]: 7556/12326 cut-off events.
[2024-06-04 18:23:09,200 INFO  L125   PetriNetUnfolderBase]: For 1206073/1206073 co-relation queries the response was YES.
[2024-06-04 18:23:09,299 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 120867 conditions, 12326 events. 7556/12326 cut-off events. For 1206073/1206073 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 88127 event pairs, 2021 based on Foata normal form. 84/12407 useless extension candidates. Maximal degree in co-relation 120722. Up to 9969 conditions per place. 
[2024-06-04 18:23:09,344 INFO  L140   encePairwiseOnDemand]: 28/42 looper letters, 271 selfloop transitions, 261 changer transitions 0/537 dead transitions.
[2024-06-04 18:23:09,344 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 537 transitions, 12103 flow
[2024-06-04 18:23:09,344 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:23:09,345 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:23:09,345 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 218 transitions.
[2024-06-04 18:23:09,345 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5190476190476191
[2024-06-04 18:23:09,345 INFO  L175             Difference]: Start difference. First operand has 312 places, 488 transitions, 10121 flow. Second operand 10 states and 218 transitions.
[2024-06-04 18:23:09,345 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 537 transitions, 12103 flow
[2024-06-04 18:23:11,124 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 537 transitions, 11762 flow, removed 62 selfloop flow, removed 7 redundant places.
[2024-06-04 18:23:11,133 INFO  L231             Difference]: Finished difference. Result has 315 places, 490 transitions, 10474 flow
[2024-06-04 18:23:11,133 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9780, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=259, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10474, PETRI_PLACES=315, PETRI_TRANSITIONS=490}
[2024-06-04 18:23:11,133 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 272 predicate places.
[2024-06-04 18:23:11,133 INFO  L495      AbstractCegarLoop]: Abstraction has has 315 places, 490 transitions, 10474 flow
[2024-06-04 18:23:11,134 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-04 18:23:11,134 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:23:11,134 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-04 18:23:11,134 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-04 18:23:11,134 INFO  L420      AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:23:11,134 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:23:11,134 INFO  L85        PathProgramCache]: Analyzing trace with hash -1377564853, now seen corresponding path program 12 times
[2024-06-04 18:23:11,134 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:23:11,135 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678071835]
[2024-06-04 18:23:11,135 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:23:11,135 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:23:11,217 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:23:17,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-04 18:23:17,694 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:23:17,694 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678071835]
[2024-06-04 18:23:17,694 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678071835] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:23:17,695 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:23:17,695 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:23:17,695 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152184372]
[2024-06-04 18:23:17,695 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:23:17,695 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:23:17,695 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:23:17,695 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:23:17,695 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:23:17,992 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:23:17,992 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 490 transitions, 10474 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-04 18:23:17,992 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:23:17,992 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:23:17,993 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:23:22,818 INFO  L124   PetriNetUnfolderBase]: 8266/13651 cut-off events.
[2024-06-04 18:23:22,818 INFO  L125   PetriNetUnfolderBase]: For 1274087/1274087 co-relation queries the response was YES.
[2024-06-04 18:23:23,173 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 132131 conditions, 13651 events. 8266/13651 cut-off events. For 1274087/1274087 co-relation queries the response was YES. Maximal size of possible extension queue 761. Compared 100759 event pairs, 2397 based on Foata normal form. 48/13697 useless extension candidates. Maximal degree in co-relation 131985. Up to 6399 conditions per place. 
[2024-06-04 18:23:23,226 INFO  L140   encePairwiseOnDemand]: 27/42 looper letters, 371 selfloop transitions, 179 changer transitions 0/555 dead transitions.
[2024-06-04 18:23:23,226 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 555 transitions, 12746 flow
[2024-06-04 18:23:23,226 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:23:23,226 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:23:23,226 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 223 transitions.
[2024-06-04 18:23:23,227 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.530952380952381
[2024-06-04 18:23:23,227 INFO  L175             Difference]: Start difference. First operand has 315 places, 490 transitions, 10474 flow. Second operand 10 states and 223 transitions.
[2024-06-04 18:23:23,227 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 555 transitions, 12746 flow
[2024-06-04 18:23:25,087 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 555 transitions, 12223 flow, removed 57 selfloop flow, removed 7 redundant places.
[2024-06-04 18:23:25,095 INFO  L231             Difference]: Finished difference. Result has 320 places, 494 transitions, 10581 flow
[2024-06-04 18:23:25,095 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9951, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10581, PETRI_PLACES=320, PETRI_TRANSITIONS=494}
[2024-06-04 18:23:25,096 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 277 predicate places.
[2024-06-04 18:23:25,096 INFO  L495      AbstractCegarLoop]: Abstraction has has 320 places, 494 transitions, 10581 flow
[2024-06-04 18:23:25,096 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-04 18:23:25,096 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:23:25,096 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-04 18:23:25,097 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-04 18:23:25,097 INFO  L420      AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:23:25,097 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:23:25,097 INFO  L85        PathProgramCache]: Analyzing trace with hash 464484344, now seen corresponding path program 3 times
[2024-06-04 18:23:25,097 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:23:25,097 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805573013]
[2024-06-04 18:23:25,098 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:23:25,098 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:23:25,131 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:23:33,646 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:23:33,646 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:23:33,647 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805573013]
[2024-06-04 18:23:33,647 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805573013] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:23:33,647 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:23:33,647 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:23:33,647 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915225410]
[2024-06-04 18:23:33,647 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:23:33,647 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:23:33,647 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:23:33,648 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:23:33,648 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:23:33,790 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-04 18:23:33,790 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 494 transitions, 10581 flow. Second operand  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:23:33,790 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:23:33,790 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-04 18:23:33,790 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:23:37,946 INFO  L124   PetriNetUnfolderBase]: 8286/13694 cut-off events.
[2024-06-04 18:23:37,946 INFO  L125   PetriNetUnfolderBase]: For 1199552/1199552 co-relation queries the response was YES.
[2024-06-04 18:23:38,073 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 132489 conditions, 13694 events. 8286/13694 cut-off events. For 1199552/1199552 co-relation queries the response was YES. Maximal size of possible extension queue 761. Compared 102081 event pairs, 2599 based on Foata normal form. 4/13697 useless extension candidates. Maximal degree in co-relation 132340. Up to 12476 conditions per place. 
[2024-06-04 18:23:38,129 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 422 selfloop transitions, 104 changer transitions 0/531 dead transitions.
[2024-06-04 18:23:38,129 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 531 transitions, 12239 flow
[2024-06-04 18:23:38,130 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:23:38,130 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:23:38,130 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions.
[2024-06-04 18:23:38,130 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49107142857142855
[2024-06-04 18:23:38,130 INFO  L175             Difference]: Start difference. First operand has 320 places, 494 transitions, 10581 flow. Second operand 8 states and 165 transitions.
[2024-06-04 18:23:38,130 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 531 transitions, 12239 flow
[2024-06-04 18:23:40,673 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 531 transitions, 11792 flow, removed 61 selfloop flow, removed 7 redundant places.
[2024-06-04 18:23:40,681 INFO  L231             Difference]: Finished difference. Result has 321 places, 501 transitions, 10531 flow
[2024-06-04 18:23:40,681 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=10144, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10531, PETRI_PLACES=321, PETRI_TRANSITIONS=501}
[2024-06-04 18:23:40,681 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 278 predicate places.
[2024-06-04 18:23:40,682 INFO  L495      AbstractCegarLoop]: Abstraction has has 321 places, 501 transitions, 10531 flow
[2024-06-04 18:23:40,682 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:23:40,682 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:23:40,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-04 18:23:40,682 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-04 18:23:40,682 INFO  L420      AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:23:40,682 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:23:40,682 INFO  L85        PathProgramCache]: Analyzing trace with hash 476864504, now seen corresponding path program 4 times
[2024-06-04 18:23:40,683 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:23:40,683 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813135861]
[2024-06-04 18:23:40,683 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:23:40,683 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:23:40,726 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat