./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe025_power.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/protection/safe025_power.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/safe025_power.i ./goblint.2024-05-21_14-57-05.files/protection/safe025_power.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-03 20:14:11,079 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 20:14:11,153 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 20:14:11,159 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 20:14:11,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 20:14:11,190 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 20:14:11,190 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 20:14:11,191 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 20:14:11,191 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 20:14:11,195 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 20:14:11,195 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 20:14:11,196 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 20:14:11,197 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 20:14:11,198 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 20:14:11,198 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 20:14:11,199 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 20:14:11,199 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 20:14:11,199 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 20:14:11,200 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 20:14:11,200 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 20:14:11,200 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 20:14:11,201 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 20:14:11,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 20:14:11,201 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 20:14:11,201 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 20:14:11,202 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 20:14:11,202 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 20:14:11,202 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 20:14:11,203 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 20:14:11,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 20:14:11,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 20:14:11,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 20:14:11,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 20:14:11,205 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 20:14:11,205 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 20:14:11,205 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 20:14:11,205 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 20:14:11,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 20:14:11,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 20:14:11,215 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 20:14:11,215 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 20:14:11,215 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 20:14:11,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 20:14:11,216 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-03 20:14:11,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 20:14:11,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 20:14:11,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 20:14:11,513 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 20:14:11,513 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 20:14:11,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe025_power.i [2024-06-03 20:14:12,606 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 20:14:12,856 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 20:14:12,856 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe025_power.i [2024-06-03 20:14:12,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398a649b8/48b905b814be431095f57632142875a0/FLAG6f435bebb [2024-06-03 20:14:12,885 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398a649b8/48b905b814be431095f57632142875a0 [2024-06-03 20:14:12,887 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 20:14:12,888 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 20:14:12,889 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/protection/safe025_power.yml/witness.yml [2024-06-03 20:14:13,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 20:14:13,116 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 20:14:13,117 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 20:14:13,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 20:14:13,122 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 20:14:13,122 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:14:12" (1/2) ... [2024-06-03 20:14:13,123 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69fa141a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:14:13, skipping insertion in model container [2024-06-03 20:14:13,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:14:12" (1/2) ... [2024-06-03 20:14:13,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@219723d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:14:13, skipping insertion in model container [2024-06-03 20:14:13,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:14:13" (2/2) ... [2024-06-03 20:14:13,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69fa141a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:14:13, skipping insertion in model container [2024-06-03 20:14:13,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:14:13" (2/2) ... [2024-06-03 20:14:13,127 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 20:14:13,259 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 20:14:13,260 INFO L97 edCorrectnessWitness]: Location invariant before [L876-L876] ((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 2) && x$w_buff1 <= 127) && ((x$w_buff1 == 0 || x$w_buff1 == 1) || x$w_buff1 == 2)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 2) && x$w_buff0 <= 127) && ((x$w_buff0 == 0 || x$w_buff0 == 1) || x$w_buff0 == 2))) [2024-06-03 20:14:13,261 INFO L97 edCorrectnessWitness]: Location invariant before [L879-L879] ((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 2) && x$w_buff1 <= 127) && ((x$w_buff1 == 0 || x$w_buff1 == 1) || x$w_buff1 == 2)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 2) && x$w_buff0 <= 127) && ((x$w_buff0 == 0 || x$w_buff0 == 1) || x$w_buff0 == 2))) [2024-06-03 20:14:13,261 INFO L97 edCorrectnessWitness]: Location invariant before [L878-L878] ((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 2) && x$w_buff1 <= 127) && ((x$w_buff1 == 0 || x$w_buff1 == 1) || x$w_buff1 == 2)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 2) && x$w_buff0 <= 127) && ((x$w_buff0 == 0 || x$w_buff0 == 1) || x$w_buff0 == 2))) [2024-06-03 20:14:13,261 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 20:14:13,261 INFO L106 edCorrectnessWitness]: ghost_update [L874-L874] multithreaded = 1; [2024-06-03 20:14:13,308 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 20:14:13,748 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 20:14:13,767 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 20:14:13,954 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 20:14:13,997 INFO L206 MainTranslator]: Completed translation [2024-06-03 20:14:13,997 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:14:13 WrapperNode [2024-06-03 20:14:13,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 20:14:13,998 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 20:14:13,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 20:14:13,999 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 20:14:14,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:14:13" (1/1) ... [2024-06-03 20:14:14,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:14:13" (1/1) ... [2024-06-03 20:14:14,081 INFO L138 Inliner]: procedures = 175, calls = 111, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 339 [2024-06-03 20:14:14,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 20:14:14,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 20:14:14,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 20:14:14,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 20:14:14,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:14:13" (1/1) ... [2024-06-03 20:14:14,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:14:13" (1/1) ... [2024-06-03 20:14:14,107 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:14:13" (1/1) ... [2024-06-03 20:14:14,141 INFO L175 MemorySlicer]: Split 66 memory accesses to 2 slices as follows [2, 64]. 97 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 9 writes are split as follows [0, 9]. [2024-06-03 20:14:14,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:14:13" (1/1) ... [2024-06-03 20:14:14,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:14:13" (1/1) ... [2024-06-03 20:14:14,172 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:14:13" (1/1) ... [2024-06-03 20:14:14,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:14:13" (1/1) ... [2024-06-03 20:14:14,178 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:14:13" (1/1) ... [2024-06-03 20:14:14,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:14:13" (1/1) ... [2024-06-03 20:14:14,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 20:14:14,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 20:14:14,186 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 20:14:14,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 20:14:14,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:14:13" (1/1) ... [2024-06-03 20:14:14,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 20:14:14,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 20:14:14,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-03 20:14:14,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-03 20:14:14,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-03 20:14:14,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-03 20:14:14,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-03 20:14:14,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-03 20:14:14,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 20:14:14,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 20:14:14,278 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 20:14:14,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 20:14:14,279 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 20:14:14,279 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 20:14:14,279 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-03 20:14:14,279 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-03 20:14:14,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 20:14:14,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-03 20:14:14,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 20:14:14,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 20:14:14,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 20:14:14,284 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 20:14:14,454 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 20:14:14,456 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 20:14:15,133 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 20:14:15,133 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 20:14:15,729 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 20:14:15,730 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 20:14:15,730 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 08:14:15 BoogieIcfgContainer [2024-06-03 20:14:15,730 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 20:14:15,733 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 20:14:15,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 20:14:15,736 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 20:14:15,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 08:14:12" (1/4) ... [2024-06-03 20:14:15,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22597b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 08:14:15, skipping insertion in model container [2024-06-03 20:14:15,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:14:13" (2/4) ... [2024-06-03 20:14:15,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22597b9a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 08:14:15, skipping insertion in model container [2024-06-03 20:14:15,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:14:13" (3/4) ... [2024-06-03 20:14:15,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22597b9a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 08:14:15, skipping insertion in model container [2024-06-03 20:14:15,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 08:14:15" (4/4) ... [2024-06-03 20:14:15,739 INFO L112 eAbstractionObserver]: Analyzing ICFG safe025_power.i [2024-06-03 20:14:15,755 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 20:14:15,755 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-03 20:14:15,755 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 20:14:15,827 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 20:14:15,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow [2024-06-03 20:14:15,930 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2024-06-03 20:14:15,931 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 20:14:15,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 20:14:15,933 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow [2024-06-03 20:14:15,937 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2024-06-03 20:14:15,951 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 20:14:15,960 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;@678f85b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 20:14:15,960 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-03 20:14:15,967 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 20:14:15,967 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 20:14:15,967 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 20:14:15,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:14:15,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 20:14:15,969 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:14:15,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:14:15,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1090535608, now seen corresponding path program 1 times [2024-06-03 20:14:15,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:14:15,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483727919] [2024-06-03 20:14:15,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:14:15,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:14:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:14:18,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:14:18,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:14:18,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483727919] [2024-06-03 20:14:18,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483727919] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:14:18,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:14:18,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 20:14:18,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383661822] [2024-06-03 20:14:18,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:14:18,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 20:14:18,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:14:18,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 20:14:18,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-03 20:14:18,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 20:14:18,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:18,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:14:18,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 20:14:18,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:14:19,087 INFO L124 PetriNetUnfolderBase]: 743/1226 cut-off events. [2024-06-03 20:14:19,087 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-06-03 20:14:19,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2458 conditions, 1226 events. 743/1226 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5811 event pairs, 414 based on Foata normal form. 0/1211 useless extension candidates. Maximal degree in co-relation 2443. Up to 1145 conditions per place. [2024-06-03 20:14:19,099 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 29 selfloop transitions, 7 changer transitions 0/44 dead transitions. [2024-06-03 20:14:19,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 175 flow [2024-06-03 20:14:19,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 20:14:19,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 20:14:19,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2024-06-03 20:14:19,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2024-06-03 20:14:19,112 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 4 states and 81 transitions. [2024-06-03 20:14:19,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 175 flow [2024-06-03 20:14:19,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-03 20:14:19,117 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 119 flow [2024-06-03 20:14:19,118 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2024-06-03 20:14:19,121 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2024-06-03 20:14:19,121 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 119 flow [2024-06-03 20:14:19,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:19,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:14:19,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:14:19,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 20:14:19,122 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:14:19,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:14:19,123 INFO L85 PathProgramCache]: Analyzing trace with hash -32646425, now seen corresponding path program 1 times [2024-06-03 20:14:19,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:14:19,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380932522] [2024-06-03 20:14:19,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:14:19,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:14:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:14:20,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:14:20,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:14:20,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380932522] [2024-06-03 20:14:20,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380932522] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:14:20,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:14:20,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 20:14:20,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126523769] [2024-06-03 20:14:20,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:14:20,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 20:14:20,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:14:20,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 20:14:20,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-03 20:14:21,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:14:21,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:21,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:14:21,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:14:21,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:14:21,756 INFO L124 PetriNetUnfolderBase]: 873/1368 cut-off events. [2024-06-03 20:14:21,756 INFO L125 PetriNetUnfolderBase]: For 207/207 co-relation queries the response was YES. [2024-06-03 20:14:21,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3054 conditions, 1368 events. 873/1368 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6314 event pairs, 317 based on Foata normal form. 0/1363 useless extension candidates. Maximal degree in co-relation 3038. Up to 1301 conditions per place. [2024-06-03 20:14:21,764 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 35 selfloop transitions, 14 changer transitions 0/56 dead transitions. [2024-06-03 20:14:21,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 56 transitions, 267 flow [2024-06-03 20:14:21,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:14:21,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:14:21,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2024-06-03 20:14:21,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-06-03 20:14:21,767 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 119 flow. Second operand 5 states and 96 transitions. [2024-06-03 20:14:21,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 56 transitions, 267 flow [2024-06-03 20:14:21,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 267 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-03 20:14:21,770 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 199 flow [2024-06-03 20:14:21,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2024-06-03 20:14:21,771 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2024-06-03 20:14:21,771 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 199 flow [2024-06-03 20:14:21,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:21,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:14:21,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:14:21,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 20:14:21,772 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:14:21,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:14:21,773 INFO L85 PathProgramCache]: Analyzing trace with hash -31693175, now seen corresponding path program 2 times [2024-06-03 20:14:21,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:14:21,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189988960] [2024-06-03 20:14:21,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:14:21,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:14:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:14:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:14:23,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:14:23,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189988960] [2024-06-03 20:14:23,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189988960] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:14:23,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:14:23,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 20:14:23,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881256927] [2024-06-03 20:14:23,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:14:23,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 20:14:23,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:14:23,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 20:14:23,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-03 20:14:23,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:14:23,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:23,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:14:23,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:14:23,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:14:24,162 INFO L124 PetriNetUnfolderBase]: 871/1364 cut-off events. [2024-06-03 20:14:24,162 INFO L125 PetriNetUnfolderBase]: For 529/531 co-relation queries the response was YES. [2024-06-03 20:14:24,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3326 conditions, 1364 events. 871/1364 cut-off events. For 529/531 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6182 event pairs, 351 based on Foata normal form. 4/1368 useless extension candidates. Maximal degree in co-relation 3306. Up to 1300 conditions per place. [2024-06-03 20:14:24,171 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 40 selfloop transitions, 12 changer transitions 0/59 dead transitions. [2024-06-03 20:14:24,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 335 flow [2024-06-03 20:14:24,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:14:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:14:24,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-06-03 20:14:24,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2024-06-03 20:14:24,174 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 199 flow. Second operand 5 states and 101 transitions. [2024-06-03 20:14:24,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 335 flow [2024-06-03 20:14:24,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 59 transitions, 327 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-03 20:14:24,178 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 220 flow [2024-06-03 20:14:24,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=220, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2024-06-03 20:14:24,179 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2024-06-03 20:14:24,179 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 220 flow [2024-06-03 20:14:24,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:24,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:14:24,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:14:24,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 20:14:24,180 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:14:24,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:14:24,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1012522697, now seen corresponding path program 1 times [2024-06-03 20:14:24,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:14:24,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129933114] [2024-06-03 20:14:24,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:14:24,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:14:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:14:25,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:14:25,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:14:25,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129933114] [2024-06-03 20:14:25,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129933114] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:14:25,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:14:25,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:14:25,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624002803] [2024-06-03 20:14:25,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:14:25,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:14:25,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:14:25,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:14:25,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:14:26,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 20:14:26,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 220 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-03 20:14:26,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:14:26,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 20:14:26,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:14:26,845 INFO L124 PetriNetUnfolderBase]: 789/1281 cut-off events. [2024-06-03 20:14:26,845 INFO L125 PetriNetUnfolderBase]: For 415/417 co-relation queries the response was YES. [2024-06-03 20:14:26,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3046 conditions, 1281 events. 789/1281 cut-off events. For 415/417 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6122 event pairs, 425 based on Foata normal form. 0/1245 useless extension candidates. Maximal degree in co-relation 3023. Up to 1218 conditions per place. [2024-06-03 20:14:26,854 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 36 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2024-06-03 20:14:26,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 54 transitions, 343 flow [2024-06-03 20:14:26,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:14:26,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:14:26,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2024-06-03 20:14:26,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2024-06-03 20:14:26,857 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 220 flow. Second operand 5 states and 93 transitions. [2024-06-03 20:14:26,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 54 transitions, 343 flow [2024-06-03 20:14:26,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 305 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-03 20:14:26,863 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 240 flow [2024-06-03 20:14:26,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=240, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-06-03 20:14:26,864 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places. [2024-06-03 20:14:26,864 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 240 flow [2024-06-03 20:14:26,865 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-03 20:14:26,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:14:26,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:14:26,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 20:14:26,866 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:14:26,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:14:26,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1902657544, now seen corresponding path program 1 times [2024-06-03 20:14:26,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:14:26,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027669913] [2024-06-03 20:14:26,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:14:26,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:14:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:14:28,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:14:28,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:14:28,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027669913] [2024-06-03 20:14:28,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027669913] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:14:28,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:14:28,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:14:28,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823644177] [2024-06-03 20:14:28,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:14:28,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:14:28,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:14:28,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:14:28,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:14:28,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:14:28,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:28,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:14:28,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:14:28,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:14:29,978 INFO L124 PetriNetUnfolderBase]: 921/1443 cut-off events. [2024-06-03 20:14:29,979 INFO L125 PetriNetUnfolderBase]: For 460/462 co-relation queries the response was YES. [2024-06-03 20:14:29,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3496 conditions, 1443 events. 921/1443 cut-off events. For 460/462 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6686 event pairs, 401 based on Foata normal form. 0/1413 useless extension candidates. Maximal degree in co-relation 3471. Up to 1373 conditions per place. [2024-06-03 20:14:29,989 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 41 selfloop transitions, 17 changer transitions 0/65 dead transitions. [2024-06-03 20:14:29,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 65 transitions, 408 flow [2024-06-03 20:14:29,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:14:29,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:14:29,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2024-06-03 20:14:29,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44841269841269843 [2024-06-03 20:14:29,995 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 240 flow. Second operand 6 states and 113 transitions. [2024-06-03 20:14:29,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 65 transitions, 408 flow [2024-06-03 20:14:29,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 65 transitions, 399 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 20:14:30,004 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 305 flow [2024-06-03 20:14:30,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2024-06-03 20:14:30,007 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2024-06-03 20:14:30,007 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 305 flow [2024-06-03 20:14:30,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:30,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:14:30,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:14:30,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 20:14:30,008 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:14:30,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:14:30,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1923302614, now seen corresponding path program 2 times [2024-06-03 20:14:30,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:14:30,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468171178] [2024-06-03 20:14:30,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:14:30,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:14:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:14:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:14:31,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:14:31,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468171178] [2024-06-03 20:14:31,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468171178] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:14:31,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:14:31,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:14:31,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371809368] [2024-06-03 20:14:31,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:14:31,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:14:31,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:14:31,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:14:31,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:14:32,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:14:32,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 305 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:32,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:14:32,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:14:32,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:14:33,063 INFO L124 PetriNetUnfolderBase]: 917/1437 cut-off events. [2024-06-03 20:14:33,063 INFO L125 PetriNetUnfolderBase]: For 700/702 co-relation queries the response was YES. [2024-06-03 20:14:33,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3622 conditions, 1437 events. 917/1437 cut-off events. For 700/702 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6720 event pairs, 346 based on Foata normal form. 0/1408 useless extension candidates. Maximal degree in co-relation 3594. Up to 1370 conditions per place. [2024-06-03 20:14:33,072 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 37 selfloop transitions, 20 changer transitions 0/64 dead transitions. [2024-06-03 20:14:33,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 64 transitions, 459 flow [2024-06-03 20:14:33,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:14:33,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:14:33,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-03 20:14:33,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4246031746031746 [2024-06-03 20:14:33,075 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 305 flow. Second operand 6 states and 107 transitions. [2024-06-03 20:14:33,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 64 transitions, 459 flow [2024-06-03 20:14:33,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 433 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-03 20:14:33,079 INFO L231 Difference]: Finished difference. Result has 66 places, 58 transitions, 351 flow [2024-06-03 20:14:33,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=351, PETRI_PLACES=66, PETRI_TRANSITIONS=58} [2024-06-03 20:14:33,082 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2024-06-03 20:14:33,082 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 351 flow [2024-06-03 20:14:33,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:33,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:14:33,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:14:33,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 20:14:33,083 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:14:33,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:14:33,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1924289778, now seen corresponding path program 1 times [2024-06-03 20:14:33,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:14:33,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472163967] [2024-06-03 20:14:33,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:14:33,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:14:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:14:35,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:14:35,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:14:35,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472163967] [2024-06-03 20:14:35,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472163967] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:14:35,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:14:35,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:14:35,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810962899] [2024-06-03 20:14:35,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:14:35,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:14:35,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:14:35,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:14:35,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:14:35,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 20:14:35,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 351 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:35,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:14:35,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 20:14:35,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:14:35,832 INFO L124 PetriNetUnfolderBase]: 791/1286 cut-off events. [2024-06-03 20:14:35,833 INFO L125 PetriNetUnfolderBase]: For 774/776 co-relation queries the response was YES. [2024-06-03 20:14:35,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3321 conditions, 1286 events. 791/1286 cut-off events. For 774/776 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6111 event pairs, 416 based on Foata normal form. 0/1252 useless extension candidates. Maximal degree in co-relation 3292. Up to 1220 conditions per place. [2024-06-03 20:14:35,840 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 43 selfloop transitions, 13 changer transitions 0/64 dead transitions. [2024-06-03 20:14:35,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 64 transitions, 487 flow [2024-06-03 20:14:35,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:14:35,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:14:35,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-03 20:14:35,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4246031746031746 [2024-06-03 20:14:35,842 INFO L175 Difference]: Start difference. First operand has 66 places, 58 transitions, 351 flow. Second operand 6 states and 107 transitions. [2024-06-03 20:14:35,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 64 transitions, 487 flow [2024-06-03 20:14:35,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 64 transitions, 460 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-03 20:14:35,846 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 376 flow [2024-06-03 20:14:35,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2024-06-03 20:14:35,847 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2024-06-03 20:14:35,847 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 376 flow [2024-06-03 20:14:35,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:35,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:14:35,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:14:35,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 20:14:35,848 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:14:35,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:14:35,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1924322328, now seen corresponding path program 2 times [2024-06-03 20:14:35,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:14:35,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077418483] [2024-06-03 20:14:35,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:14:35,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:14:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:14:37,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:14:37,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:14:37,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077418483] [2024-06-03 20:14:37,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077418483] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:14:37,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:14:37,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:14:37,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498525234] [2024-06-03 20:14:37,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:14:37,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:14:37,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:14:37,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:14:37,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:14:37,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 20:14:37,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 376 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:37,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:14:37,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 20:14:37,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:14:38,604 INFO L124 PetriNetUnfolderBase]: 789/1309 cut-off events. [2024-06-03 20:14:38,604 INFO L125 PetriNetUnfolderBase]: For 1108/1110 co-relation queries the response was YES. [2024-06-03 20:14:38,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3521 conditions, 1309 events. 789/1309 cut-off events. For 1108/1110 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6293 event pairs, 408 based on Foata normal form. 0/1282 useless extension candidates. Maximal degree in co-relation 3490. Up to 1208 conditions per place. [2024-06-03 20:14:38,613 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 48 selfloop transitions, 17 changer transitions 0/73 dead transitions. [2024-06-03 20:14:38,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 73 transitions, 562 flow [2024-06-03 20:14:38,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:14:38,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:14:38,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2024-06-03 20:14:38,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-03 20:14:38,615 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 376 flow. Second operand 6 states and 112 transitions. [2024-06-03 20:14:38,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 73 transitions, 562 flow [2024-06-03 20:14:38,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 73 transitions, 532 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-03 20:14:38,619 INFO L231 Difference]: Finished difference. Result has 72 places, 68 transitions, 445 flow [2024-06-03 20:14:38,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=445, PETRI_PLACES=72, PETRI_TRANSITIONS=68} [2024-06-03 20:14:38,619 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2024-06-03 20:14:38,620 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 68 transitions, 445 flow [2024-06-03 20:14:38,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:38,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:14:38,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:14:38,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 20:14:38,620 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:14:38,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:14:38,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1063904805, now seen corresponding path program 1 times [2024-06-03 20:14:38,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:14:38,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483498291] [2024-06-03 20:14:38,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:14:38,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:14:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:14:41,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:14:41,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:14:41,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483498291] [2024-06-03 20:14:41,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483498291] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:14:41,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:14:41,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:14:41,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220856014] [2024-06-03 20:14:41,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:14:41,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:14:41,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:14:41,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:14:41,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:14:41,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:14:41,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 68 transitions, 445 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:41,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:14:41,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:14:41,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:14:41,752 INFO L124 PetriNetUnfolderBase]: 892/1412 cut-off events. [2024-06-03 20:14:41,753 INFO L125 PetriNetUnfolderBase]: For 1963/2059 co-relation queries the response was YES. [2024-06-03 20:14:41,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4052 conditions, 1412 events. 892/1412 cut-off events. For 1963/2059 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6550 event pairs, 316 based on Foata normal form. 2/1408 useless extension candidates. Maximal degree in co-relation 4019. Up to 1335 conditions per place. [2024-06-03 20:14:41,763 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 48 selfloop transitions, 22 changer transitions 0/77 dead transitions. [2024-06-03 20:14:41,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 77 transitions, 615 flow [2024-06-03 20:14:41,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:14:41,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:14:41,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-03 20:14:41,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4013605442176871 [2024-06-03 20:14:41,764 INFO L175 Difference]: Start difference. First operand has 72 places, 68 transitions, 445 flow. Second operand 7 states and 118 transitions. [2024-06-03 20:14:41,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 77 transitions, 615 flow [2024-06-03 20:14:41,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 77 transitions, 575 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-03 20:14:41,770 INFO L231 Difference]: Finished difference. Result has 77 places, 71 transitions, 474 flow [2024-06-03 20:14:41,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=474, PETRI_PLACES=77, PETRI_TRANSITIONS=71} [2024-06-03 20:14:41,772 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2024-06-03 20:14:41,772 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 71 transitions, 474 flow [2024-06-03 20:14:41,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:41,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:14:41,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:14:41,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 20:14:41,773 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:14:41,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:14:41,773 INFO L85 PathProgramCache]: Analyzing trace with hash 942002375, now seen corresponding path program 2 times [2024-06-03 20:14:41,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:14:41,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332112889] [2024-06-03 20:14:41,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:14:41,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:14:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:14:44,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:14:44,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:14:44,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332112889] [2024-06-03 20:14:44,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332112889] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:14:44,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:14:44,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:14:44,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729913089] [2024-06-03 20:14:44,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:14:44,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:14:44,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:14:44,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:14:44,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:14:44,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:14:44,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 71 transitions, 474 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:44,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:14:44,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:14:44,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:14:44,814 INFO L124 PetriNetUnfolderBase]: 894/1417 cut-off events. [2024-06-03 20:14:44,814 INFO L125 PetriNetUnfolderBase]: For 1957/2055 co-relation queries the response was YES. [2024-06-03 20:14:44,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4113 conditions, 1417 events. 894/1417 cut-off events. For 1957/2055 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6546 event pairs, 370 based on Foata normal form. 4/1416 useless extension candidates. Maximal degree in co-relation 4079. Up to 1339 conditions per place. [2024-06-03 20:14:44,827 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 54 selfloop transitions, 22 changer transitions 0/83 dead transitions. [2024-06-03 20:14:44,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 83 transitions, 683 flow [2024-06-03 20:14:44,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:14:44,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:14:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-03 20:14:44,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42517006802721086 [2024-06-03 20:14:44,829 INFO L175 Difference]: Start difference. First operand has 77 places, 71 transitions, 474 flow. Second operand 7 states and 125 transitions. [2024-06-03 20:14:44,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 83 transitions, 683 flow [2024-06-03 20:14:44,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 83 transitions, 635 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-03 20:14:44,834 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 513 flow [2024-06-03 20:14:44,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=513, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2024-06-03 20:14:44,836 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places. [2024-06-03 20:14:44,836 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 513 flow [2024-06-03 20:14:44,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:44,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:14:44,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:14:44,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 20:14:44,837 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:14:44,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:14:44,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1915274345, now seen corresponding path program 3 times [2024-06-03 20:14:44,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:14:44,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809084658] [2024-06-03 20:14:44,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:14:44,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:14:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:14:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:14:47,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:14:47,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809084658] [2024-06-03 20:14:47,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809084658] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:14:47,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:14:47,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:14:47,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275030347] [2024-06-03 20:14:47,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:14:47,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:14:47,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:14:47,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:14:47,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:14:47,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:14:47,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 75 transitions, 513 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:47,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:14:47,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:14:47,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:14:47,966 INFO L124 PetriNetUnfolderBase]: 895/1421 cut-off events. [2024-06-03 20:14:47,966 INFO L125 PetriNetUnfolderBase]: For 2174/2272 co-relation queries the response was YES. [2024-06-03 20:14:47,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4237 conditions, 1421 events. 895/1421 cut-off events. For 2174/2272 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6603 event pairs, 310 based on Foata normal form. 2/1418 useless extension candidates. Maximal degree in co-relation 4201. Up to 1342 conditions per place. [2024-06-03 20:14:47,976 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 62 selfloop transitions, 27 changer transitions 0/96 dead transitions. [2024-06-03 20:14:47,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 96 transitions, 822 flow [2024-06-03 20:14:47,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:14:47,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:14:47,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-03 20:14:47,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517 [2024-06-03 20:14:47,977 INFO L175 Difference]: Start difference. First operand has 81 places, 75 transitions, 513 flow. Second operand 7 states and 131 transitions. [2024-06-03 20:14:47,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 96 transitions, 822 flow [2024-06-03 20:14:47,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 96 transitions, 762 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-03 20:14:47,983 INFO L231 Difference]: Finished difference. Result has 87 places, 83 transitions, 626 flow [2024-06-03 20:14:47,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=626, PETRI_PLACES=87, PETRI_TRANSITIONS=83} [2024-06-03 20:14:47,983 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places. [2024-06-03 20:14:47,983 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 83 transitions, 626 flow [2024-06-03 20:14:47,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:47,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:14:47,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:14:47,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 20:14:47,984 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:14:47,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:14:47,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1916346635, now seen corresponding path program 4 times [2024-06-03 20:14:47,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:14:47,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401715002] [2024-06-03 20:14:47,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:14:47,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:14:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:14:50,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:14:50,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:14:50,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401715002] [2024-06-03 20:14:50,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401715002] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:14:50,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:14:50,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:14:50,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687551072] [2024-06-03 20:14:50,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:14:50,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:14:50,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:14:50,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:14:50,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:14:50,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:14:50,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 83 transitions, 626 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:50,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:14:50,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:14:50,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:14:51,186 INFO L124 PetriNetUnfolderBase]: 894/1418 cut-off events. [2024-06-03 20:14:51,187 INFO L125 PetriNetUnfolderBase]: For 2460/2548 co-relation queries the response was YES. [2024-06-03 20:14:51,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4363 conditions, 1418 events. 894/1418 cut-off events. For 2460/2548 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6607 event pairs, 207 based on Foata normal form. 2/1415 useless extension candidates. Maximal degree in co-relation 4323. Up to 1298 conditions per place. [2024-06-03 20:14:51,195 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 67 selfloop transitions, 28 changer transitions 0/102 dead transitions. [2024-06-03 20:14:51,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 102 transitions, 891 flow [2024-06-03 20:14:51,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:14:51,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:14:51,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-03 20:14:51,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45918367346938777 [2024-06-03 20:14:51,197 INFO L175 Difference]: Start difference. First operand has 87 places, 83 transitions, 626 flow. Second operand 7 states and 135 transitions. [2024-06-03 20:14:51,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 102 transitions, 891 flow [2024-06-03 20:14:51,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 102 transitions, 840 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-03 20:14:51,204 INFO L231 Difference]: Finished difference. Result has 88 places, 84 transitions, 641 flow [2024-06-03 20:14:51,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=641, PETRI_PLACES=88, PETRI_TRANSITIONS=84} [2024-06-03 20:14:51,206 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 45 predicate places. [2024-06-03 20:14:51,206 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 84 transitions, 641 flow [2024-06-03 20:14:51,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:51,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:14:51,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:14:51,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 20:14:51,207 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:14:51,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:14:51,207 INFO L85 PathProgramCache]: Analyzing trace with hash -506944373, now seen corresponding path program 1 times [2024-06-03 20:14:51,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:14:51,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199232167] [2024-06-03 20:14:51,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:14:51,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:14:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:14:53,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:14:53,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:14:53,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199232167] [2024-06-03 20:14:53,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199232167] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:14:53,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:14:53,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:14:53,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328662056] [2024-06-03 20:14:53,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:14:53,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:14:53,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:14:53,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:14:53,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:14:53,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 20:14:53,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 84 transitions, 641 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:53,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:14:53,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 20:14:53,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:14:54,482 INFO L124 PetriNetUnfolderBase]: 801/1316 cut-off events. [2024-06-03 20:14:54,482 INFO L125 PetriNetUnfolderBase]: For 2411/2413 co-relation queries the response was YES. [2024-06-03 20:14:54,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4199 conditions, 1316 events. 801/1316 cut-off events. For 2411/2413 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6300 event pairs, 254 based on Foata normal form. 0/1289 useless extension candidates. Maximal degree in co-relation 4161. Up to 1215 conditions per place. [2024-06-03 20:14:54,491 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 65 selfloop transitions, 33 changer transitions 0/105 dead transitions. [2024-06-03 20:14:54,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 105 transitions, 975 flow [2024-06-03 20:14:54,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:14:54,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:14:54,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-06-03 20:14:54,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4126984126984127 [2024-06-03 20:14:54,493 INFO L175 Difference]: Start difference. First operand has 88 places, 84 transitions, 641 flow. Second operand 9 states and 156 transitions. [2024-06-03 20:14:54,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 105 transitions, 975 flow [2024-06-03 20:14:54,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 105 transitions, 897 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-03 20:14:54,500 INFO L231 Difference]: Finished difference. Result has 91 places, 100 transitions, 774 flow [2024-06-03 20:14:54,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=774, PETRI_PLACES=91, PETRI_TRANSITIONS=100} [2024-06-03 20:14:54,500 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 48 predicate places. [2024-06-03 20:14:54,501 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 100 transitions, 774 flow [2024-06-03 20:14:54,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:54,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:14:54,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:14:54,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 20:14:54,501 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:14:54,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:14:54,502 INFO L85 PathProgramCache]: Analyzing trace with hash -475548503, now seen corresponding path program 2 times [2024-06-03 20:14:54,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:14:54,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045877250] [2024-06-03 20:14:54,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:14:54,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:14:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:14:56,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:14:56,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:14:56,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045877250] [2024-06-03 20:14:56,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045877250] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:14:56,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:14:56,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:14:56,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143828928] [2024-06-03 20:14:56,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:14:56,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:14:56,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:14:56,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:14:56,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:14:56,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 20:14:56,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 100 transitions, 774 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:56,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:14:56,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 20:14:56,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:14:57,587 INFO L124 PetriNetUnfolderBase]: 805/1320 cut-off events. [2024-06-03 20:14:57,587 INFO L125 PetriNetUnfolderBase]: For 3571/3575 co-relation queries the response was YES. [2024-06-03 20:14:57,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4572 conditions, 1320 events. 805/1320 cut-off events. For 3571/3575 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6303 event pairs, 246 based on Foata normal form. 4/1324 useless extension candidates. Maximal degree in co-relation 4533. Up to 1223 conditions per place. [2024-06-03 20:14:57,596 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 75 selfloop transitions, 30 changer transitions 0/112 dead transitions. [2024-06-03 20:14:57,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 112 transitions, 1069 flow [2024-06-03 20:14:57,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:14:57,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:14:57,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-03 20:14:57,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4255952380952381 [2024-06-03 20:14:57,598 INFO L175 Difference]: Start difference. First operand has 91 places, 100 transitions, 774 flow. Second operand 8 states and 143 transitions. [2024-06-03 20:14:57,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 112 transitions, 1069 flow [2024-06-03 20:14:57,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 112 transitions, 1025 flow, removed 19 selfloop flow, removed 2 redundant places. [2024-06-03 20:14:57,612 INFO L231 Difference]: Finished difference. Result has 98 places, 106 transitions, 863 flow [2024-06-03 20:14:57,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=863, PETRI_PLACES=98, PETRI_TRANSITIONS=106} [2024-06-03 20:14:57,613 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 55 predicate places. [2024-06-03 20:14:57,614 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 106 transitions, 863 flow [2024-06-03 20:14:57,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:57,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:14:57,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:14:57,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 20:14:57,614 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:14:57,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:14:57,615 INFO L85 PathProgramCache]: Analyzing trace with hash -475515023, now seen corresponding path program 3 times [2024-06-03 20:14:57,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:14:57,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996216543] [2024-06-03 20:14:57,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:14:57,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:14:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:14:57,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:14:57,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:14:57,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996216543] [2024-06-03 20:14:57,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996216543] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:14:57,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:14:57,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 20:14:57,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489426036] [2024-06-03 20:14:57,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:14:57,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 20:14:57,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:14:57,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 20:14:57,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 20:14:57,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 42 [2024-06-03 20:14:57,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 106 transitions, 863 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:57,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:14:57,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 42 [2024-06-03 20:14:57,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:14:57,911 INFO L124 PetriNetUnfolderBase]: 434/890 cut-off events. [2024-06-03 20:14:57,912 INFO L125 PetriNetUnfolderBase]: For 1957/2023 co-relation queries the response was YES. [2024-06-03 20:14:57,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2705 conditions, 890 events. 434/890 cut-off events. For 1957/2023 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5088 event pairs, 176 based on Foata normal form. 61/925 useless extension candidates. Maximal degree in co-relation 2662. Up to 508 conditions per place. [2024-06-03 20:14:57,916 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 51 selfloop transitions, 16 changer transitions 0/91 dead transitions. [2024-06-03 20:14:57,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 91 transitions, 816 flow [2024-06-03 20:14:57,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 20:14:57,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 20:14:57,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-06-03 20:14:57,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.626984126984127 [2024-06-03 20:14:57,917 INFO L175 Difference]: Start difference. First operand has 98 places, 106 transitions, 863 flow. Second operand 3 states and 79 transitions. [2024-06-03 20:14:57,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 91 transitions, 816 flow [2024-06-03 20:14:57,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 91 transitions, 764 flow, removed 5 selfloop flow, removed 11 redundant places. [2024-06-03 20:14:57,922 INFO L231 Difference]: Finished difference. Result has 85 places, 85 transitions, 654 flow [2024-06-03 20:14:57,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=654, PETRI_PLACES=85, PETRI_TRANSITIONS=85} [2024-06-03 20:14:57,923 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places. [2024-06-03 20:14:57,923 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 85 transitions, 654 flow [2024-06-03 20:14:57,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:57,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:14:57,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:14:57,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 20:14:57,924 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:14:57,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:14:57,924 INFO L85 PathProgramCache]: Analyzing trace with hash -507202173, now seen corresponding path program 1 times [2024-06-03 20:14:57,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:14:57,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249263330] [2024-06-03 20:14:57,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:14:57,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:14:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:14:59,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:14:59,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:14:59,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249263330] [2024-06-03 20:14:59,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249263330] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:14:59,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:14:59,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:14:59,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216683544] [2024-06-03 20:14:59,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:14:59,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:14:59,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:14:59,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:14:59,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:14:59,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 20:14:59,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 85 transitions, 654 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:14:59,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:14:59,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 20:14:59,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:00,108 INFO L124 PetriNetUnfolderBase]: 1212/1929 cut-off events. [2024-06-03 20:15:00,108 INFO L125 PetriNetUnfolderBase]: For 4916/5002 co-relation queries the response was YES. [2024-06-03 20:15:00,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6552 conditions, 1929 events. 1212/1929 cut-off events. For 4916/5002 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9807 event pairs, 704 based on Foata normal form. 1/1927 useless extension candidates. Maximal degree in co-relation 6515. Up to 1855 conditions per place. [2024-06-03 20:15:00,122 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 72 selfloop transitions, 12 changer transitions 0/91 dead transitions. [2024-06-03 20:15:00,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 91 transitions, 870 flow [2024-06-03 20:15:00,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:15:00,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:15:00,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2024-06-03 20:15:00,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44761904761904764 [2024-06-03 20:15:00,123 INFO L175 Difference]: Start difference. First operand has 85 places, 85 transitions, 654 flow. Second operand 5 states and 94 transitions. [2024-06-03 20:15:00,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 91 transitions, 870 flow [2024-06-03 20:15:00,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 91 transitions, 845 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-06-03 20:15:00,135 INFO L231 Difference]: Finished difference. Result has 90 places, 89 transitions, 709 flow [2024-06-03 20:15:00,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=709, PETRI_PLACES=90, PETRI_TRANSITIONS=89} [2024-06-03 20:15:00,136 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 47 predicate places. [2024-06-03 20:15:00,136 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 89 transitions, 709 flow [2024-06-03 20:15:00,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:00,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:00,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:00,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 20:15:00,137 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:15:00,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:00,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1863656329, now seen corresponding path program 1 times [2024-06-03 20:15:00,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:00,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886534444] [2024-06-03 20:15:00,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:00,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:01,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:15:01,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:01,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886534444] [2024-06-03 20:15:01,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886534444] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:01,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:01,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:15:01,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850559161] [2024-06-03 20:15:01,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:01,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:15:01,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:01,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:15:01,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:15:01,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:15:01,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 709 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:01,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:01,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:15:01,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:02,903 INFO L124 PetriNetUnfolderBase]: 995/1615 cut-off events. [2024-06-03 20:15:02,903 INFO L125 PetriNetUnfolderBase]: For 4031/4033 co-relation queries the response was YES. [2024-06-03 20:15:02,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5727 conditions, 1615 events. 995/1615 cut-off events. For 4031/4033 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7994 event pairs, 340 based on Foata normal form. 2/1617 useless extension candidates. Maximal degree in co-relation 5686. Up to 1525 conditions per place. [2024-06-03 20:15:02,914 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 79 selfloop transitions, 26 changer transitions 0/111 dead transitions. [2024-06-03 20:15:02,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 111 transitions, 1066 flow [2024-06-03 20:15:02,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:15:02,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:15:02,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-03 20:15:02,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4421768707482993 [2024-06-03 20:15:02,916 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 709 flow. Second operand 7 states and 130 transitions. [2024-06-03 20:15:02,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 111 transitions, 1066 flow [2024-06-03 20:15:02,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 111 transitions, 1054 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 20:15:02,926 INFO L231 Difference]: Finished difference. Result has 96 places, 97 transitions, 842 flow [2024-06-03 20:15:02,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=842, PETRI_PLACES=96, PETRI_TRANSITIONS=97} [2024-06-03 20:15:02,927 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 53 predicate places. [2024-06-03 20:15:02,927 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 97 transitions, 842 flow [2024-06-03 20:15:02,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:02,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:02,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:02,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 20:15:02,928 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:15:02,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:02,928 INFO L85 PathProgramCache]: Analyzing trace with hash -2063970889, now seen corresponding path program 2 times [2024-06-03 20:15:02,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:02,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142632261] [2024-06-03 20:15:02,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:02,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:04,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:15:04,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:04,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142632261] [2024-06-03 20:15:04,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142632261] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:04,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:04,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:15:04,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848480730] [2024-06-03 20:15:04,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:04,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:15:04,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:04,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:15:04,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:15:04,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:15:04,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 97 transitions, 842 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:04,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:04,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:15:04,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:05,732 INFO L124 PetriNetUnfolderBase]: 996/1617 cut-off events. [2024-06-03 20:15:05,732 INFO L125 PetriNetUnfolderBase]: For 5246/5248 co-relation queries the response was YES. [2024-06-03 20:15:05,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6093 conditions, 1617 events. 996/1617 cut-off events. For 5246/5248 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8028 event pairs, 347 based on Foata normal form. 1/1618 useless extension candidates. Maximal degree in co-relation 6049. Up to 1551 conditions per place. [2024-06-03 20:15:05,741 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 79 selfloop transitions, 23 changer transitions 0/108 dead transitions. [2024-06-03 20:15:05,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 108 transitions, 1117 flow [2024-06-03 20:15:05,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:15:05,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:15:05,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-03 20:15:05,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41496598639455784 [2024-06-03 20:15:05,744 INFO L175 Difference]: Start difference. First operand has 96 places, 97 transitions, 842 flow. Second operand 7 states and 122 transitions. [2024-06-03 20:15:05,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 108 transitions, 1117 flow [2024-06-03 20:15:05,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 108 transitions, 1053 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-03 20:15:05,756 INFO L231 Difference]: Finished difference. Result has 102 places, 102 transitions, 899 flow [2024-06-03 20:15:05,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=899, PETRI_PLACES=102, PETRI_TRANSITIONS=102} [2024-06-03 20:15:05,756 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 59 predicate places. [2024-06-03 20:15:05,756 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 102 transitions, 899 flow [2024-06-03 20:15:05,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:05,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:05,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:05,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 20:15:05,757 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:15:05,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:05,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1457919957, now seen corresponding path program 3 times [2024-06-03 20:15:05,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:05,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051655920] [2024-06-03 20:15:05,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:05,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:07,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:15:07,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:07,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051655920] [2024-06-03 20:15:07,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051655920] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:07,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:07,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:15:07,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885656940] [2024-06-03 20:15:07,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:07,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:15:07,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:07,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:15:07,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:15:07,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:15:07,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 102 transitions, 899 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:07,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:07,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:15:07,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:08,687 INFO L124 PetriNetUnfolderBase]: 995/1615 cut-off events. [2024-06-03 20:15:08,688 INFO L125 PetriNetUnfolderBase]: For 5582/5584 co-relation queries the response was YES. [2024-06-03 20:15:08,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6171 conditions, 1615 events. 995/1615 cut-off events. For 5582/5584 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8008 event pairs, 349 based on Foata normal form. 1/1615 useless extension candidates. Maximal degree in co-relation 6123. Up to 1549 conditions per place. [2024-06-03 20:15:08,698 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 79 selfloop transitions, 24 changer transitions 0/109 dead transitions. [2024-06-03 20:15:08,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 109 transitions, 1160 flow [2024-06-03 20:15:08,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:15:08,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:15:08,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-03 20:15:08,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3945578231292517 [2024-06-03 20:15:08,699 INFO L175 Difference]: Start difference. First operand has 102 places, 102 transitions, 899 flow. Second operand 7 states and 116 transitions. [2024-06-03 20:15:08,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 109 transitions, 1160 flow [2024-06-03 20:15:08,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 109 transitions, 1101 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-03 20:15:08,711 INFO L231 Difference]: Finished difference. Result has 106 places, 106 transitions, 946 flow [2024-06-03 20:15:08,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=946, PETRI_PLACES=106, PETRI_TRANSITIONS=106} [2024-06-03 20:15:08,712 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 63 predicate places. [2024-06-03 20:15:08,712 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 106 transitions, 946 flow [2024-06-03 20:15:08,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:08,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:08,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:08,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 20:15:08,713 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:15:08,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:08,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1510980689, now seen corresponding path program 4 times [2024-06-03 20:15:08,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:08,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553255249] [2024-06-03 20:15:08,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:08,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:10,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:15:10,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:10,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553255249] [2024-06-03 20:15:10,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553255249] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:10,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:10,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:15:10,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313289435] [2024-06-03 20:15:10,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:10,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:15:10,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:10,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:15:10,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:15:10,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:15:10,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 106 transitions, 946 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:10,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:10,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:15:10,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:11,330 INFO L124 PetriNetUnfolderBase]: 996/1617 cut-off events. [2024-06-03 20:15:11,330 INFO L125 PetriNetUnfolderBase]: For 5944/5946 co-relation queries the response was YES. [2024-06-03 20:15:11,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6260 conditions, 1617 events. 996/1617 cut-off events. For 5944/5946 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8002 event pairs, 348 based on Foata normal form. 1/1617 useless extension candidates. Maximal degree in co-relation 6210. Up to 1548 conditions per place. [2024-06-03 20:15:11,338 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 76 selfloop transitions, 29 changer transitions 0/111 dead transitions. [2024-06-03 20:15:11,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 111 transitions, 1196 flow [2024-06-03 20:15:11,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:15:11,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:15:11,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-03 20:15:11,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3945578231292517 [2024-06-03 20:15:11,339 INFO L175 Difference]: Start difference. First operand has 106 places, 106 transitions, 946 flow. Second operand 7 states and 116 transitions. [2024-06-03 20:15:11,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 111 transitions, 1196 flow [2024-06-03 20:15:11,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 111 transitions, 1148 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-03 20:15:11,351 INFO L231 Difference]: Finished difference. Result has 110 places, 108 transitions, 993 flow [2024-06-03 20:15:11,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=993, PETRI_PLACES=110, PETRI_TRANSITIONS=108} [2024-06-03 20:15:11,352 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 67 predicate places. [2024-06-03 20:15:11,352 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 108 transitions, 993 flow [2024-06-03 20:15:11,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:11,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:11,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:11,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 20:15:11,353 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:15:11,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:11,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1856304679, now seen corresponding path program 5 times [2024-06-03 20:15:11,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:11,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128591207] [2024-06-03 20:15:11,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:11,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:13,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:15:13,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:13,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128591207] [2024-06-03 20:15:13,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128591207] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:13,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:13,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:15:13,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112042085] [2024-06-03 20:15:13,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:13,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:15:13,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:13,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:15:13,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:15:13,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:15:13,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 108 transitions, 993 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:13,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:13,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:15:13,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:13,897 INFO L124 PetriNetUnfolderBase]: 999/1623 cut-off events. [2024-06-03 20:15:13,898 INFO L125 PetriNetUnfolderBase]: For 6673/6675 co-relation queries the response was YES. [2024-06-03 20:15:13,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6377 conditions, 1623 events. 999/1623 cut-off events. For 6673/6675 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8062 event pairs, 316 based on Foata normal form. 2/1624 useless extension candidates. Maximal degree in co-relation 6325. Up to 1495 conditions per place. [2024-06-03 20:15:13,905 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 90 selfloop transitions, 34 changer transitions 0/130 dead transitions. [2024-06-03 20:15:13,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 130 transitions, 1471 flow [2024-06-03 20:15:13,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:15:13,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:15:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-03 20:15:13,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517 [2024-06-03 20:15:13,906 INFO L175 Difference]: Start difference. First operand has 110 places, 108 transitions, 993 flow. Second operand 7 states and 131 transitions. [2024-06-03 20:15:13,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 130 transitions, 1471 flow [2024-06-03 20:15:13,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 130 transitions, 1394 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-03 20:15:13,919 INFO L231 Difference]: Finished difference. Result has 113 places, 116 transitions, 1099 flow [2024-06-03 20:15:13,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1099, PETRI_PLACES=113, PETRI_TRANSITIONS=116} [2024-06-03 20:15:13,920 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 70 predicate places. [2024-06-03 20:15:13,920 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 116 transitions, 1099 flow [2024-06-03 20:15:13,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:13,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:13,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:13,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 20:15:13,921 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:15:13,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:13,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1857109129, now seen corresponding path program 6 times [2024-06-03 20:15:13,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:13,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228848516] [2024-06-03 20:15:13,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:13,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:15,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:15:15,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:15,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228848516] [2024-06-03 20:15:15,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228848516] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:15,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:15,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:15:15,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266834289] [2024-06-03 20:15:15,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:15,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:15:15,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:15,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:15:15,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:15:15,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:15:15,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 116 transitions, 1099 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:15,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:15,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:15:15,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:16,728 INFO L124 PetriNetUnfolderBase]: 1000/1624 cut-off events. [2024-06-03 20:15:16,728 INFO L125 PetriNetUnfolderBase]: For 8099/8101 co-relation queries the response was YES. [2024-06-03 20:15:16,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6706 conditions, 1624 events. 1000/1624 cut-off events. For 8099/8101 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8061 event pairs, 317 based on Foata normal form. 2/1625 useless extension candidates. Maximal degree in co-relation 6652. Up to 1497 conditions per place. [2024-06-03 20:15:16,736 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 84 selfloop transitions, 39 changer transitions 0/129 dead transitions. [2024-06-03 20:15:16,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 129 transitions, 1487 flow [2024-06-03 20:15:16,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:15:16,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:15:16,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-03 20:15:16,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43197278911564624 [2024-06-03 20:15:16,737 INFO L175 Difference]: Start difference. First operand has 113 places, 116 transitions, 1099 flow. Second operand 7 states and 127 transitions. [2024-06-03 20:15:16,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 129 transitions, 1487 flow [2024-06-03 20:15:16,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 129 transitions, 1368 flow, removed 34 selfloop flow, removed 4 redundant places. [2024-06-03 20:15:16,753 INFO L231 Difference]: Finished difference. Result has 116 places, 119 transitions, 1112 flow [2024-06-03 20:15:16,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=988, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1112, PETRI_PLACES=116, PETRI_TRANSITIONS=119} [2024-06-03 20:15:16,754 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 73 predicate places. [2024-06-03 20:15:16,754 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 119 transitions, 1112 flow [2024-06-03 20:15:16,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:16,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:16,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:16,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 20:15:16,755 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:15:16,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:16,755 INFO L85 PathProgramCache]: Analyzing trace with hash -2107470366, now seen corresponding path program 1 times [2024-06-03 20:15:16,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:16,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220615195] [2024-06-03 20:15:16,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:16,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:18,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:15:18,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:18,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220615195] [2024-06-03 20:15:18,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220615195] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:18,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:18,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:15:18,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725803171] [2024-06-03 20:15:18,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:18,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:15:18,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:18,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:15:18,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:15:18,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:15:18,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 119 transitions, 1112 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:18,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:18,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:15:18,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:19,625 INFO L124 PetriNetUnfolderBase]: 1501/2339 cut-off events. [2024-06-03 20:15:19,625 INFO L125 PetriNetUnfolderBase]: For 8744/8902 co-relation queries the response was YES. [2024-06-03 20:15:19,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8921 conditions, 2339 events. 1501/2339 cut-off events. For 8744/8902 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11802 event pairs, 839 based on Foata normal form. 2/2340 useless extension candidates. Maximal degree in co-relation 8866. Up to 2246 conditions per place. [2024-06-03 20:15:19,637 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 94 selfloop transitions, 31 changer transitions 0/131 dead transitions. [2024-06-03 20:15:19,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 131 transitions, 1473 flow [2024-06-03 20:15:19,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:15:19,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:15:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2024-06-03 20:15:19,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44841269841269843 [2024-06-03 20:15:19,638 INFO L175 Difference]: Start difference. First operand has 116 places, 119 transitions, 1112 flow. Second operand 6 states and 113 transitions. [2024-06-03 20:15:19,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 131 transitions, 1473 flow [2024-06-03 20:15:19,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 131 transitions, 1398 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-03 20:15:19,651 INFO L231 Difference]: Finished difference. Result has 119 places, 125 transitions, 1206 flow [2024-06-03 20:15:19,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1206, PETRI_PLACES=119, PETRI_TRANSITIONS=125} [2024-06-03 20:15:19,652 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 76 predicate places. [2024-06-03 20:15:19,652 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 125 transitions, 1206 flow [2024-06-03 20:15:19,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:19,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:19,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:19,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 20:15:19,653 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:15:19,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:19,653 INFO L85 PathProgramCache]: Analyzing trace with hash -2089941726, now seen corresponding path program 2 times [2024-06-03 20:15:19,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:19,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551083082] [2024-06-03 20:15:19,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:19,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:15:21,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:21,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551083082] [2024-06-03 20:15:21,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551083082] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:21,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:21,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:15:21,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518458552] [2024-06-03 20:15:21,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:21,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:15:21,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:21,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:15:21,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:15:21,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-03 20:15:21,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 125 transitions, 1206 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:21,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:21,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-03 20:15:21,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:22,377 INFO L124 PetriNetUnfolderBase]: 1495/2330 cut-off events. [2024-06-03 20:15:22,378 INFO L125 PetriNetUnfolderBase]: For 9580/9762 co-relation queries the response was YES. [2024-06-03 20:15:22,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9295 conditions, 2330 events. 1495/2330 cut-off events. For 9580/9762 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11752 event pairs, 834 based on Foata normal form. 2/2328 useless extension candidates. Maximal degree in co-relation 9238. Up to 2241 conditions per place. [2024-06-03 20:15:22,390 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 94 selfloop transitions, 34 changer transitions 0/134 dead transitions. [2024-06-03 20:15:22,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 134 transitions, 1580 flow [2024-06-03 20:15:22,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:15:22,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:15:22,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-03 20:15:22,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-03 20:15:22,391 INFO L175 Difference]: Start difference. First operand has 119 places, 125 transitions, 1206 flow. Second operand 6 states and 108 transitions. [2024-06-03 20:15:22,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 134 transitions, 1580 flow [2024-06-03 20:15:22,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 134 transitions, 1536 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-03 20:15:22,409 INFO L231 Difference]: Finished difference. Result has 122 places, 130 transitions, 1322 flow [2024-06-03 20:15:22,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1322, PETRI_PLACES=122, PETRI_TRANSITIONS=130} [2024-06-03 20:15:22,410 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 79 predicate places. [2024-06-03 20:15:22,410 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 130 transitions, 1322 flow [2024-06-03 20:15:22,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:22,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:22,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:22,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 20:15:22,411 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:15:22,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:22,411 INFO L85 PathProgramCache]: Analyzing trace with hash -2088832732, now seen corresponding path program 1 times [2024-06-03 20:15:22,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:22,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645521680] [2024-06-03 20:15:22,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:22,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:24,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:15:24,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:24,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645521680] [2024-06-03 20:15:24,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645521680] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:24,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:24,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:15:24,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028774017] [2024-06-03 20:15:24,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:24,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:15:24,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:24,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:15:24,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:15:24,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 20:15:24,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 130 transitions, 1322 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:24,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:24,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 20:15:24,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:24,950 INFO L124 PetriNetUnfolderBase]: 1246/2003 cut-off events. [2024-06-03 20:15:24,950 INFO L125 PetriNetUnfolderBase]: For 9372/9554 co-relation queries the response was YES. [2024-06-03 20:15:24,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8307 conditions, 2003 events. 1246/2003 cut-off events. For 9372/9554 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10310 event pairs, 633 based on Foata normal form. 1/2002 useless extension candidates. Maximal degree in co-relation 8249. Up to 1906 conditions per place. [2024-06-03 20:15:24,960 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 112 selfloop transitions, 18 changer transitions 0/137 dead transitions. [2024-06-03 20:15:24,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 137 transitions, 1630 flow [2024-06-03 20:15:24,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:15:24,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:15:24,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2024-06-03 20:15:24,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-03 20:15:24,961 INFO L175 Difference]: Start difference. First operand has 122 places, 130 transitions, 1322 flow. Second operand 6 states and 111 transitions. [2024-06-03 20:15:24,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 137 transitions, 1630 flow [2024-06-03 20:15:24,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 137 transitions, 1588 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-03 20:15:24,974 INFO L231 Difference]: Finished difference. Result has 126 places, 133 transitions, 1359 flow [2024-06-03 20:15:24,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1280, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1359, PETRI_PLACES=126, PETRI_TRANSITIONS=133} [2024-06-03 20:15:24,974 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 83 predicate places. [2024-06-03 20:15:24,974 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 133 transitions, 1359 flow [2024-06-03 20:15:24,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:24,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:24,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:24,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 20:15:24,975 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:15:24,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:24,975 INFO L85 PathProgramCache]: Analyzing trace with hash -2089934782, now seen corresponding path program 2 times [2024-06-03 20:15:24,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:24,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562741542] [2024-06-03 20:15:24,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:24,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:15:26,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:15:26,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:15:26,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562741542] [2024-06-03 20:15:26,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562741542] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:15:26,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:15:26,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:15:26,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065895881] [2024-06-03 20:15:26,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:15:26,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:15:26,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:15:26,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:15:26,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:15:26,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-06-03 20:15:26,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 133 transitions, 1359 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:26,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:15:26,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-06-03 20:15:26,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:15:27,386 INFO L124 PetriNetUnfolderBase]: 1244/2000 cut-off events. [2024-06-03 20:15:27,386 INFO L125 PetriNetUnfolderBase]: For 10794/10976 co-relation queries the response was YES. [2024-06-03 20:15:27,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8647 conditions, 2000 events. 1244/2000 cut-off events. For 10794/10976 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10269 event pairs, 633 based on Foata normal form. 1/1999 useless extension candidates. Maximal degree in co-relation 8586. Up to 1913 conditions per place. [2024-06-03 20:15:27,400 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 116 selfloop transitions, 14 changer transitions 0/137 dead transitions. [2024-06-03 20:15:27,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 137 transitions, 1655 flow [2024-06-03 20:15:27,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:15:27,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:15:27,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-03 20:15:27,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4246031746031746 [2024-06-03 20:15:27,401 INFO L175 Difference]: Start difference. First operand has 126 places, 133 transitions, 1359 flow. Second operand 6 states and 107 transitions. [2024-06-03 20:15:27,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 137 transitions, 1655 flow [2024-06-03 20:15:27,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 137 transitions, 1624 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-03 20:15:27,417 INFO L231 Difference]: Finished difference. Result has 129 places, 135 transitions, 1393 flow [2024-06-03 20:15:27,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1330, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1393, PETRI_PLACES=129, PETRI_TRANSITIONS=135} [2024-06-03 20:15:27,417 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 86 predicate places. [2024-06-03 20:15:27,417 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 135 transitions, 1393 flow [2024-06-03 20:15:27,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:15:27,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:15:27,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:15:27,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 20:15:27,418 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-03 20:15:27,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:15:27,418 INFO L85 PathProgramCache]: Analyzing trace with hash -2089928830, now seen corresponding path program 1 times [2024-06-03 20:15:27,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:15:27,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216537308] [2024-06-03 20:15:27,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:15:27,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:15:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-03 20:15:27,441 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-03 20:15:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-03 20:15:27,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-03 20:15:27,495 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-03 20:15:27,496 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 6 remaining) [2024-06-03 20:15:27,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 6 remaining) [2024-06-03 20:15:27,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-06-03 20:15:27,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-06-03 20:15:27,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-06-03 20:15:27,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-06-03 20:15:27,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 20:15:27,500 INFO L445 BasicCegarLoop]: Path program histogram: [6, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-06-03 20:15:27,509 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-03 20:15:27,509 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-03 20:15:27,560 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,564 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,564 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,565 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,565 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,565 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,565 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,565 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,566 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,566 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,566 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,566 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,571 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,572 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,572 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,572 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,572 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,572 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,572 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,572 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,572 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,573 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,573 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,573 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,577 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,577 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,577 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,578 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,578 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,578 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,578 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,578 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,578 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,578 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,579 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,579 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:15:27,584 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-03 20:15:27,592 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-06-03 20:15:27,593 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-06-03 20:15:27,593 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.06 08:15:27 BasicIcfg [2024-06-03 20:15:27,593 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-03 20:15:27,594 INFO L158 Benchmark]: Toolchain (without parser) took 74478.36ms. Allocated memory was 144.7MB in the beginning and 1.0GB in the end (delta: 903.9MB). Free memory was 92.5MB in the beginning and 563.2MB in the end (delta: -470.7MB). Peak memory consumption was 433.0MB. Max. memory is 16.1GB. [2024-06-03 20:15:27,596 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 144.7MB. Free memory is still 113.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 20:15:27,596 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 144.7MB. Free memory was 105.4MB in the beginning and 105.1MB in the end (delta: 305.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 20:15:27,597 INFO L158 Benchmark]: CACSL2BoogieTranslator took 881.01ms. Allocated memory is still 144.7MB. Free memory was 92.5MB in the beginning and 88.8MB in the end (delta: 3.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-06-03 20:15:27,597 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.30ms. Allocated memory is still 144.7MB. Free memory was 88.8MB in the beginning and 84.0MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-03 20:15:27,597 INFO L158 Benchmark]: Boogie Preprocessor took 99.05ms. Allocated memory is still 144.7MB. Free memory was 84.0MB in the beginning and 78.3MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-03 20:15:27,597 INFO L158 Benchmark]: RCFGBuilder took 1543.98ms. Allocated memory was 144.7MB in the beginning and 174.1MB in the end (delta: 29.4MB). Free memory was 78.3MB in the beginning and 71.7MB in the end (delta: 6.6MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2024-06-03 20:15:27,598 INFO L158 Benchmark]: TraceAbstraction took 71860.97ms. Allocated memory was 174.1MB in the beginning and 1.0GB in the end (delta: 874.5MB). Free memory was 70.7MB in the beginning and 563.2MB in the end (delta: -492.6MB). Peak memory consumption was 381.9MB. Max. memory is 16.1GB. [2024-06-03 20:15:27,599 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 144.7MB. Free memory is still 113.5MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.17ms. Allocated memory is still 144.7MB. Free memory was 105.4MB in the beginning and 105.1MB in the end (delta: 305.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 881.01ms. Allocated memory is still 144.7MB. Free memory was 92.5MB in the beginning and 88.8MB in the end (delta: 3.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.30ms. Allocated memory is still 144.7MB. Free memory was 88.8MB in the beginning and 84.0MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.05ms. Allocated memory is still 144.7MB. Free memory was 84.0MB in the beginning and 78.3MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1543.98ms. Allocated memory was 144.7MB in the beginning and 174.1MB in the end (delta: 29.4MB). Free memory was 78.3MB in the beginning and 71.7MB in the end (delta: 6.6MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. * TraceAbstraction took 71860.97ms. Allocated memory was 174.1MB in the beginning and 1.0GB in the end (delta: 874.5MB). Free memory was 70.7MB in the beginning and 563.2MB in the end (delta: -492.6MB). Peak memory consumption was 381.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 879]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L873] 0 pthread_t t2369; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L874] 0 //@ ghost multithreaded = 1; [L874] FCALL, FORK 0 pthread_create(&t2369, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2369=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L875] 0 pthread_t t2370; [L876] 0 //@ assert (((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$mem_tmp) && (x$mem_tmp <= 2)) && (x$mem_tmp <= 127)) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 1)) && ((__unbuffered_p2_EBX == 0) || (__unbuffered_p2_EBX == 1))))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)) || (__unbuffered_p2_EAX == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || (((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 2)) && (*__unbuffered_p2_EAX$read_delayed_var <= 127)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && (((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)) || (*__unbuffered_p2_EAX$read_delayed_var == 2)))))) && (!multithreaded || ((((0 <= x$w_buff1) && (x$w_buff1 <= 2)) && (x$w_buff1 <= 127)) && (((x$w_buff1 == 0) || (x$w_buff1 == 1)) || (x$w_buff1 == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$w_buff0) && (x$w_buff0 <= 2)) && (x$w_buff0 <= 127)) && (((x$w_buff0 == 0) || (x$w_buff0 == 1)) || (x$w_buff0 == 2))))); [L876] 0 x [L876] 0 x [L876] 0 x [L876] 0 x [L876] 0 x [L876] 0 x [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] FCALL, FORK 0 pthread_create(&t2370, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2369=-2, t2370=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L876] 0 x [L876] 0 x [L876] 0 x [L876] 0 x [L876] 0 x [L876] 0 x [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L877] 0 pthread_t t2371; [L878] 0 //@ assert (((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$mem_tmp) && (x$mem_tmp <= 2)) && (x$mem_tmp <= 127)) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 1)) && ((__unbuffered_p2_EBX == 0) || (__unbuffered_p2_EBX == 1))))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)) || (__unbuffered_p2_EAX == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || (((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 2)) && (*__unbuffered_p2_EAX$read_delayed_var <= 127)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && (((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)) || (*__unbuffered_p2_EAX$read_delayed_var == 2)))))) && (!multithreaded || ((((0 <= x$w_buff1) && (x$w_buff1 <= 2)) && (x$w_buff1 <= 127)) && (((x$w_buff1 == 0) || (x$w_buff1 == 1)) || (x$w_buff1 == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$w_buff0) && (x$w_buff0 <= 2)) && (x$w_buff0 <= 127)) && (((x$w_buff0 == 0) || (x$w_buff0 == 1)) || (x$w_buff0 == 2))))); [L878] 0 x [L878] 0 x [L878] 0 x [L878] 0 x [L878] 0 x [L878] 0 x [L878] 0 __unbuffered_p2_EAX$read_delayed_var [L878] 0 __unbuffered_p2_EAX$read_delayed_var [L878] 0 __unbuffered_p2_EAX$read_delayed_var [L878] 0 __unbuffered_p2_EAX$read_delayed_var [L878] 0 __unbuffered_p2_EAX$read_delayed_var [L878] 0 __unbuffered_p2_EAX$read_delayed_var [L878] FCALL, FORK 0 pthread_create(&t2371, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2369=-2, t2370=-1, t2371=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L878] 0 x [L878] 0 x [L878] 0 x [L878] 0 x [L878] 0 x [L878] 0 x [L878] 0 __unbuffered_p2_EAX$read_delayed_var [L878] 0 __unbuffered_p2_EAX$read_delayed_var [L878] 0 __unbuffered_p2_EAX$read_delayed_var [L878] 0 __unbuffered_p2_EAX$read_delayed_var [L878] 0 __unbuffered_p2_EAX$read_delayed_var [L878] 0 __unbuffered_p2_EAX$read_delayed_var [L829] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 3 x$flush_delayed = weak$$choice2 [L832] EXPR 3 \read(x) [L832] 3 x$mem_tmp = x [L833] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L834] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L834] EXPR 3 \read(x) [L834] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L834] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L835] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L836] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L837] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L838] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L839] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L840] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L841] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L842] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L843] EXPR 3 \read(x) [L843] 3 __unbuffered_p2_EAX = x [L844] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L844] EXPR 3 \read(x) [L844] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L844] 3 x = x$flush_delayed ? x$mem_tmp : x [L845] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L879] 0 //@ assert (((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$mem_tmp) && (x$mem_tmp <= 2)) && (x$mem_tmp <= 127)) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 1)) && ((__unbuffered_p2_EBX == 0) || (__unbuffered_p2_EBX == 1))))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)) || (__unbuffered_p2_EAX == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || (((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 2)) && (*__unbuffered_p2_EAX$read_delayed_var <= 127)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && (((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)) || (*__unbuffered_p2_EAX$read_delayed_var == 2)))))) && (!multithreaded || ((((0 <= x$w_buff1) && (x$w_buff1 <= 2)) && (x$w_buff1 <= 127)) && (((x$w_buff1 == 0) || (x$w_buff1 == 1)) || (x$w_buff1 == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$w_buff0) && (x$w_buff0 <= 2)) && (x$w_buff0 <= 127)) && (((x$w_buff0 == 0) || (x$w_buff0 == 1)) || (x$w_buff0 == 2))))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2369=-2, t2370=-1, t2371=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] - UnprovableResult [Line: 876]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 71.6s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 22.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 962 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 765 mSDsluCounter, 177 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5001 IncrementalHoareTripleChecker+Invalid, 5116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 85 mSDtfsCounter, 5001 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 22.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1393occurred in iteration=26, InterpolantAutomatonStates: 162, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 47.8s InterpolantComputationTime, 319 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 30952 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-03 20:15:27,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE