./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe001_tso.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe001_tso.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7c74aec 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/safe001_tso.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe001_tso.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 --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.fix-undeclared-acsl-variable-e7c74ae-m [2024-02-07 19:03:30,000 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 19:03:30,138 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 19:03:30,145 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 19:03:30,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 19:03:30,192 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 19:03:30,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 19:03:30,193 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 19:03:30,194 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 19:03:30,197 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 19:03:30,198 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 19:03:30,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 19:03:30,199 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 19:03:30,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 19:03:30,200 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 19:03:30,201 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 19:03:30,201 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 19:03:30,208 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 19:03:30,208 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 19:03:30,208 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 19:03:30,209 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 19:03:30,209 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 19:03:30,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 19:03:30,210 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 19:03:30,210 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 19:03:30,210 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 19:03:30,211 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 19:03:30,211 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 19:03:30,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 19:03:30,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 19:03:30,213 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 19:03:30,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 19:03:30,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:03:30,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 19:03:30,214 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 19:03:30,214 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 19:03:30,214 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 19:03:30,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 19:03:30,215 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 19:03:30,215 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 19:03:30,215 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 19:03:30,215 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 19:03:30,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 19:03:30,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 [2024-02-07 19:03:30,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 19:03:30,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 19:03:30,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 19:03:30,722 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 19:03:30,722 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 19:03:30,724 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_tso.i [2024-02-07 19:03:32,136 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 19:03:32,459 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 19:03:32,460 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_tso.i [2024-02-07 19:03:32,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8accacc0b/5d8dd128ce6246749936eb65fbef9837/FLAG38a96b96a [2024-02-07 19:03:32,546 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8accacc0b/5d8dd128ce6246749936eb65fbef9837 [2024-02-07 19:03:32,548 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 19:03:32,549 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 19:03:32,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe001_tso.yml/witness.yml [2024-02-07 19:03:32,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 19:03:32,649 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 19:03:32,650 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 19:03:32,650 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 19:03:32,655 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 19:03:32,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:03:32" (1/2) ... [2024-02-07 19:03:32,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2da85351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:32, skipping insertion in model container [2024-02-07 19:03:32,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:03:32" (1/2) ... [2024-02-07 19:03:32,663 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5a4e3030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:32, skipping insertion in model container [2024-02-07 19:03:32,663 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:03:32" (2/2) ... [2024-02-07 19:03:32,664 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2da85351 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:03:32, skipping insertion in model container [2024-02-07 19:03:32,664 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:03:32" (2/2) ... [2024-02-07 19:03:32,664 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 19:03:32,729 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 19:03:32,730 INFO L76 edCorrectnessWitness]: Location invariant before [L791-L791] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 19:03:32,730 INFO L76 edCorrectnessWitness]: Location invariant before [L753-L753] (((0 <= y) && (y <= 2)) && (y <= 127)) && ((y == 0 || y == 1) || y == 2) [2024-02-07 19:03:32,730 INFO L76 edCorrectnessWitness]: Location invariant before [L783-L783] 0 <= __unbuffered_cnt [2024-02-07 19:03:32,731 INFO L76 edCorrectnessWitness]: Location invariant before [L761-L761] 0 <= __unbuffered_cnt [2024-02-07 19:03:32,731 INFO L76 edCorrectnessWitness]: Location invariant before [L789-L789] (((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (x == 2)) && ((y == 2 && (__unbuffered_p0_EAX == 2 || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) || ((((((0 <= __unbuffered_p0_EAX && 0 <= y) && __unbuffered_p0_EAX <= 2) && y <= 2) && y <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((y == 0 || y == 1) || y == 2)))) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2) [2024-02-07 19:03:32,732 INFO L76 edCorrectnessWitness]: Location invariant before [L785-L785] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 19:03:32,732 INFO L76 edCorrectnessWitness]: Location invariant before [L784-L784] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 19:03:32,732 INFO L76 edCorrectnessWitness]: Location invariant before [L723-L723] (((0 <= y) && (y <= 2)) && (y <= 127)) && ((y == 0 || y == 1) || y == 2) [2024-02-07 19:03:32,732 INFO L76 edCorrectnessWitness]: Location invariant before [L746-L746] 0 <= __unbuffered_cnt [2024-02-07 19:03:32,732 INFO L76 edCorrectnessWitness]: Location invariant before [L732-L732] 1 <= __unbuffered_cnt [2024-02-07 19:03:32,733 INFO L76 edCorrectnessWitness]: Location invariant before [L724-L724] (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2) [2024-02-07 19:03:32,733 INFO L76 edCorrectnessWitness]: Location invariant before [L762-L762] 1 <= __unbuffered_cnt [2024-02-07 19:03:32,733 INFO L76 edCorrectnessWitness]: Location invariant before [L757-L757] y == 2 [2024-02-07 19:03:32,733 INFO L76 edCorrectnessWitness]: Location invariant before [L727-L727] x == 1 [2024-02-07 19:03:32,733 INFO L76 edCorrectnessWitness]: Location invariant before [L790-L790] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 19:03:32,733 INFO L76 edCorrectnessWitness]: Location invariant before [L18-L18] ((0 <= expression) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-02-07 19:03:32,733 INFO L76 edCorrectnessWitness]: Location invariant before [L754-L754] (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2) [2024-02-07 19:03:32,733 INFO L76 edCorrectnessWitness]: Location invariant before [L731-L731] 0 <= __unbuffered_cnt [2024-02-07 19:03:32,734 INFO L76 edCorrectnessWitness]: Location invariant before [L747-L747] 1 <= __unbuffered_cnt [2024-02-07 19:03:32,734 INFO L76 edCorrectnessWitness]: Location invariant before [L739-L739] x == 2 [2024-02-07 19:03:32,734 INFO L76 edCorrectnessWitness]: Location invariant before [L742-L742] y == 1 [2024-02-07 19:03:32,774 INFO L181 MainTranslator]: Built tables and reachable declarations [2024-02-07 19:03:32,966 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_tso.i[945,958] [2024-02-07 19:03:33,208 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:03:33,220 INFO L206 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 19:03:33,260 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_tso.i[945,958] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 19:03:33,314 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:03:33,343 INFO L211 MainTranslator]: Completed translation [2024-02-07 19:03:33,344 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:03:33 WrapperNode [2024-02-07 19:03:33,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 19:03:33,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 19:03:33,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 19:03:33,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 19:03:33,351 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 07.02 07:03:33" (1/1) ... [2024-02-07 19:03:33,381 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 07.02 07:03:33" (1/1) ... [2024-02-07 19:03:33,407 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2024-02-07 19:03:33,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 19:03:33,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 19:03:33,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 19:03:33,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 19:03:33,420 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:03:33" (1/1) ... [2024-02-07 19:03:33,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:03:33" (1/1) ... [2024-02-07 19:03:33,422 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:03:33" (1/1) ... [2024-02-07 19:03:33,436 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-02-07 19:03:33,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:03:33" (1/1) ... [2024-02-07 19:03:33,438 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:03:33" (1/1) ... [2024-02-07 19:03:33,463 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:03:33" (1/1) ... [2024-02-07 19:03:33,465 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:03:33" (1/1) ... [2024-02-07 19:03:33,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:03:33" (1/1) ... [2024-02-07 19:03:33,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:03:33" (1/1) ... [2024-02-07 19:03:33,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 19:03:33,478 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 19:03:33,483 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 19:03:33,483 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 19:03:33,484 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:03:33" (1/1) ... [2024-02-07 19:03:33,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:03:33,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:03:33,514 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-02-07 19:03:33,520 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-02-07 19:03:33,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 19:03:33,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 19:03:33,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 19:03:33,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 19:03:33,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 19:03:33,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 19:03:33,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 19:03:33,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 19:03:33,542 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-02-07 19:03:33,543 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-02-07 19:03:33,543 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-02-07 19:03:33,543 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-02-07 19:03:33,543 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-02-07 19:03:33,543 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-02-07 19:03:33,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 19:03:33,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 19:03:33,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 19:03:33,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 19:03:33,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 19:03:33,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 19:03:33,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 19:03:33,545 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-07 19:03:33,725 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 19:03:33,727 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 19:03:33,983 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 19:03:33,984 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 19:03:34,138 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 19:03:34,140 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-07 19:03:34,141 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:03:34 BoogieIcfgContainer [2024-02-07 19:03:34,141 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 19:03:34,143 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 19:03:34,156 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 19:03:34,159 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 19:03:34,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 07:03:32" (1/4) ... [2024-02-07 19:03:34,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e5036a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:03:34, skipping insertion in model container [2024-02-07 19:03:34,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:03:32" (2/4) ... [2024-02-07 19:03:34,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e5036a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:03:34, skipping insertion in model container [2024-02-07 19:03:34,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:03:33" (3/4) ... [2024-02-07 19:03:34,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e5036a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:03:34, skipping insertion in model container [2024-02-07 19:03:34,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:03:34" (4/4) ... [2024-02-07 19:03:34,162 INFO L112 eAbstractionObserver]: Analyzing ICFG safe001_tso.i [2024-02-07 19:03:34,180 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 19:03:34,180 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-02-07 19:03:34,181 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 19:03:34,246 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-07 19:03:34,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 60 transitions, 132 flow [2024-02-07 19:03:34,350 INFO L124 PetriNetUnfolderBase]: 1/57 cut-off events. [2024-02-07 19:03:34,350 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:03:34,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 57 events. 1/57 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 175 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2024-02-07 19:03:34,355 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 60 transitions, 132 flow [2024-02-07 19:03:34,360 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 57 transitions, 123 flow [2024-02-07 19:03:34,369 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 19:03:34,377 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;@469e508f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 19:03:34,378 INFO L358 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2024-02-07 19:03:34,384 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 19:03:34,384 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-02-07 19:03:34,385 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:03:34,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:34,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-07 19:03:34,387 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 19:03:34,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:34,395 INFO L85 PathProgramCache]: Analyzing trace with hash 9425671, now seen corresponding path program 1 times [2024-02-07 19:03:34,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:34,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153139186] [2024-02-07 19:03:34,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:34,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:34,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:03:34,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:34,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153139186] [2024-02-07 19:03:34,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153139186] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:34,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:34,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:03:34,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320300659] [2024-02-07 19:03:34,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:34,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:34,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:34,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:34,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:34,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 60 [2024-02-07 19:03:34,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 123 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:34,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:34,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 60 [2024-02-07 19:03:34,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:36,088 INFO L124 PetriNetUnfolderBase]: 6142/9406 cut-off events. [2024-02-07 19:03:36,089 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-02-07 19:03:36,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18224 conditions, 9406 events. 6142/9406 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 63912 event pairs, 1654 based on Foata normal form. 264/7248 useless extension candidates. Maximal degree in co-relation 18213. Up to 8052 conditions per place. [2024-02-07 19:03:36,202 INFO L140 encePairwiseOnDemand]: 43/60 looper letters, 47 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2024-02-07 19:03:36,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 64 transitions, 240 flow [2024-02-07 19:03:36,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:36,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:36,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2024-02-07 19:03:36,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2024-02-07 19:03:36,219 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 123 flow. Second operand 3 states and 125 transitions. [2024-02-07 19:03:36,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 64 transitions, 240 flow [2024-02-07 19:03:36,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 236 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-07 19:03:36,232 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 117 flow [2024-02-07 19:03:36,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2024-02-07 19:03:36,239 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -11 predicate places. [2024-02-07 19:03:36,240 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 117 flow [2024-02-07 19:03:36,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:36,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:36,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:36,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 19:03:36,241 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 19:03:36,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:36,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1627658959, now seen corresponding path program 1 times [2024-02-07 19:03:36,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:36,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004285305] [2024-02-07 19:03:36,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:36,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:03:36,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:36,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004285305] [2024-02-07 19:03:36,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004285305] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:36,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:36,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:03:36,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419935690] [2024-02-07 19:03:36,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:36,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:36,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:36,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:36,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:36,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 60 [2024-02-07 19:03:36,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:36,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:36,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 60 [2024-02-07 19:03:36,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:37,185 INFO L124 PetriNetUnfolderBase]: 4700/7100 cut-off events. [2024-02-07 19:03:37,186 INFO L125 PetriNetUnfolderBase]: For 945/951 co-relation queries the response was YES. [2024-02-07 19:03:37,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15144 conditions, 7100 events. 4700/7100 cut-off events. For 945/951 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 43660 event pairs, 1430 based on Foata normal form. 0/5958 useless extension candidates. Maximal degree in co-relation 15133. Up to 5904 conditions per place. [2024-02-07 19:03:37,306 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 53 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2024-02-07 19:03:37,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 297 flow [2024-02-07 19:03:37,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:37,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:37,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-02-07 19:03:37,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-02-07 19:03:37,311 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 117 flow. Second operand 3 states and 108 transitions. [2024-02-07 19:03:37,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 297 flow [2024-02-07 19:03:37,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 71 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:03:37,315 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 146 flow [2024-02-07 19:03:37,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2024-02-07 19:03:37,316 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -9 predicate places. [2024-02-07 19:03:37,316 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 146 flow [2024-02-07 19:03:37,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:37,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:37,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:37,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 19:03:37,318 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 19:03:37,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:37,321 INFO L85 PathProgramCache]: Analyzing trace with hash -621899279, now seen corresponding path program 1 times [2024-02-07 19:03:37,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:37,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803910584] [2024-02-07 19:03:37,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:37,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:37,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:03:37,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:37,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803910584] [2024-02-07 19:03:37,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803910584] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:37,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:37,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:37,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175000009] [2024-02-07 19:03:37,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:37,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:37,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:37,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:37,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:37,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 60 [2024-02-07 19:03:37,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 146 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-02-07 19:03:37,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:37,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 60 [2024-02-07 19:03:37,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:38,296 INFO L124 PetriNetUnfolderBase]: 5817/9580 cut-off events. [2024-02-07 19:03:38,296 INFO L125 PetriNetUnfolderBase]: For 1972/1980 co-relation queries the response was YES. [2024-02-07 19:03:38,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21823 conditions, 9580 events. 5817/9580 cut-off events. For 1972/1980 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 70051 event pairs, 2779 based on Foata normal form. 346/8311 useless extension candidates. Maximal degree in co-relation 21810. Up to 4579 conditions per place. [2024-02-07 19:03:38,377 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 57 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2024-02-07 19:03:38,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 74 transitions, 337 flow [2024-02-07 19:03:38,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:38,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:38,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-02-07 19:03:38,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2024-02-07 19:03:38,380 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 146 flow. Second operand 3 states and 106 transitions. [2024-02-07 19:03:38,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 74 transitions, 337 flow [2024-02-07 19:03:38,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 74 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:03:38,384 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 149 flow [2024-02-07 19:03:38,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=149, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2024-02-07 19:03:38,386 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -8 predicate places. [2024-02-07 19:03:38,386 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 149 flow [2024-02-07 19:03:38,386 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-02-07 19:03:38,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:38,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:38,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 19:03:38,387 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 19:03:38,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:38,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1973335177, now seen corresponding path program 1 times [2024-02-07 19:03:38,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:38,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395433245] [2024-02-07 19:03:38,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:38,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:38,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:03:38,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:38,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395433245] [2024-02-07 19:03:38,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395433245] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:38,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:38,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:38,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118344489] [2024-02-07 19:03:38,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:38,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:38,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:38,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:38,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:38,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2024-02-07 19:03:38,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 149 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 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-02-07 19:03:38,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:38,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2024-02-07 19:03:38,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:39,847 INFO L124 PetriNetUnfolderBase]: 5817/9775 cut-off events. [2024-02-07 19:03:39,848 INFO L125 PetriNetUnfolderBase]: For 3671/3671 co-relation queries the response was YES. [2024-02-07 19:03:39,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22477 conditions, 9775 events. 5817/9775 cut-off events. For 3671/3671 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 73261 event pairs, 5345 based on Foata normal form. 0/7973 useless extension candidates. Maximal degree in co-relation 22463. Up to 8498 conditions per place. [2024-02-07 19:03:39,960 INFO L140 encePairwiseOnDemand]: 58/60 looper letters, 34 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2024-02-07 19:03:39,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 217 flow [2024-02-07 19:03:39,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:39,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-02-07 19:03:39,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4388888888888889 [2024-02-07 19:03:39,964 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 149 flow. Second operand 3 states and 79 transitions. [2024-02-07 19:03:39,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 217 flow [2024-02-07 19:03:39,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 48 transitions, 212 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-02-07 19:03:39,974 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 144 flow [2024-02-07 19:03:39,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2024-02-07 19:03:39,976 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -8 predicate places. [2024-02-07 19:03:39,977 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 144 flow [2024-02-07 19:03:39,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 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-02-07 19:03:39,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:39,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:39,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 19:03:39,979 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 19:03:39,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:39,980 INFO L85 PathProgramCache]: Analyzing trace with hash 2010252473, now seen corresponding path program 1 times [2024-02-07 19:03:39,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:39,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301540175] [2024-02-07 19:03:39,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:39,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:40,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:03:40,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:40,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301540175] [2024-02-07 19:03:40,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301540175] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:40,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:40,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:40,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034476557] [2024-02-07 19:03:40,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:40,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:40,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:40,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:40,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:40,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 60 [2024-02-07 19:03:40,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:40,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:40,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 60 [2024-02-07 19:03:40,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:40,824 INFO L124 PetriNetUnfolderBase]: 5275/8578 cut-off events. [2024-02-07 19:03:40,825 INFO L125 PetriNetUnfolderBase]: For 2304/2304 co-relation queries the response was YES. [2024-02-07 19:03:40,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19511 conditions, 8578 events. 5275/8578 cut-off events. For 2304/2304 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 60117 event pairs, 2484 based on Foata normal form. 168/7287 useless extension candidates. Maximal degree in co-relation 19500. Up to 4146 conditions per place. [2024-02-07 19:03:40,879 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 54 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2024-02-07 19:03:40,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 70 transitions, 318 flow [2024-02-07 19:03:40,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:40,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:40,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-02-07 19:03:40,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2024-02-07 19:03:40,881 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 144 flow. Second operand 3 states and 102 transitions. [2024-02-07 19:03:40,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 70 transitions, 318 flow [2024-02-07 19:03:40,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 70 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:03:40,884 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 140 flow [2024-02-07 19:03:40,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2024-02-07 19:03:40,886 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -9 predicate places. [2024-02-07 19:03:40,887 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 140 flow [2024-02-07 19:03:40,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:40,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:40,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:40,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 19:03:40,888 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 19:03:40,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:40,888 INFO L85 PathProgramCache]: Analyzing trace with hash -2000430357, now seen corresponding path program 1 times [2024-02-07 19:03:40,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:40,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954760584] [2024-02-07 19:03:40,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:40,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:41,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:03:41,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:41,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954760584] [2024-02-07 19:03:41,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954760584] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:41,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:41,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:03:41,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054330483] [2024-02-07 19:03:41,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:41,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:03:41,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:41,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:03:41,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:03:41,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2024-02-07 19:03:41,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:41,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:41,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2024-02-07 19:03:41,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:41,779 INFO L124 PetriNetUnfolderBase]: 5117/9283 cut-off events. [2024-02-07 19:03:41,780 INFO L125 PetriNetUnfolderBase]: For 2159/2159 co-relation queries the response was YES. [2024-02-07 19:03:41,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20329 conditions, 9283 events. 5117/9283 cut-off events. For 2159/2159 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 74293 event pairs, 909 based on Foata normal form. 262/7783 useless extension candidates. Maximal degree in co-relation 20319. Up to 4537 conditions per place. [2024-02-07 19:03:41,816 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 60 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2024-02-07 19:03:41,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 78 transitions, 378 flow [2024-02-07 19:03:41,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:03:41,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:03:41,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2024-02-07 19:03:41,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2024-02-07 19:03:41,818 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 140 flow. Second operand 4 states and 125 transitions. [2024-02-07 19:03:41,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 78 transitions, 378 flow [2024-02-07 19:03:41,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 78 transitions, 356 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-02-07 19:03:41,821 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 158 flow [2024-02-07 19:03:41,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2024-02-07 19:03:41,822 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -6 predicate places. [2024-02-07 19:03:41,822 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 158 flow [2024-02-07 19:03:41,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:41,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:41,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:41,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 19:03:41,823 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 19:03:41,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:41,823 INFO L85 PathProgramCache]: Analyzing trace with hash -164979829, now seen corresponding path program 1 times [2024-02-07 19:03:41,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:41,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923200663] [2024-02-07 19:03:41,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:41,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:03:41,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:41,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923200663] [2024-02-07 19:03:41,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923200663] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:41,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:41,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:41,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209545520] [2024-02-07 19:03:41,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:41,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:41,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:41,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:41,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:41,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 60 [2024-02-07 19:03:41,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:41,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:41,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 60 [2024-02-07 19:03:41,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:42,312 INFO L124 PetriNetUnfolderBase]: 2803/5145 cut-off events. [2024-02-07 19:03:42,312 INFO L125 PetriNetUnfolderBase]: For 1920/1920 co-relation queries the response was YES. [2024-02-07 19:03:42,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11449 conditions, 5145 events. 2803/5145 cut-off events. For 1920/1920 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 36793 event pairs, 1275 based on Foata normal form. 140/4847 useless extension candidates. Maximal degree in co-relation 11437. Up to 3932 conditions per place. [2024-02-07 19:03:42,331 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 39 selfloop transitions, 3 changer transitions 2/57 dead transitions. [2024-02-07 19:03:42,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 268 flow [2024-02-07 19:03:42,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:42,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2024-02-07 19:03:42,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-02-07 19:03:42,333 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 158 flow. Second operand 3 states and 95 transitions. [2024-02-07 19:03:42,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 57 transitions, 268 flow [2024-02-07 19:03:42,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 57 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:03:42,336 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 136 flow [2024-02-07 19:03:42,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2024-02-07 19:03:42,337 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -10 predicate places. [2024-02-07 19:03:42,337 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 136 flow [2024-02-07 19:03:42,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:42,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:42,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:42,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 19:03:42,338 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 19:03:42,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:42,339 INFO L85 PathProgramCache]: Analyzing trace with hash 347680688, now seen corresponding path program 1 times [2024-02-07 19:03:42,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:42,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873323913] [2024-02-07 19:03:42,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:42,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:42,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:03:42,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:42,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873323913] [2024-02-07 19:03:42,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873323913] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:42,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:42,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:03:42,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615187013] [2024-02-07 19:03:42,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:42,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:03:42,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:42,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:03:42,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:03:42,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2024-02-07 19:03:42,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:42,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:42,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2024-02-07 19:03:42,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:42,847 INFO L124 PetriNetUnfolderBase]: 1625/3081 cut-off events. [2024-02-07 19:03:42,847 INFO L125 PetriNetUnfolderBase]: For 1251/1251 co-relation queries the response was YES. [2024-02-07 19:03:42,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6840 conditions, 3081 events. 1625/3081 cut-off events. For 1251/1251 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 19910 event pairs, 169 based on Foata normal form. 140/2987 useless extension candidates. Maximal degree in co-relation 6829. Up to 1041 conditions per place. [2024-02-07 19:03:42,860 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 61 selfloop transitions, 8 changer transitions 1/83 dead transitions. [2024-02-07 19:03:42,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 83 transitions, 394 flow [2024-02-07 19:03:42,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:03:42,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:03:42,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2024-02-07 19:03:42,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2024-02-07 19:03:42,862 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 136 flow. Second operand 5 states and 148 transitions. [2024-02-07 19:03:42,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 83 transitions, 394 flow [2024-02-07 19:03:42,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 83 transitions, 378 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-02-07 19:03:42,865 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 169 flow [2024-02-07 19:03:42,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2024-02-07 19:03:42,866 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -8 predicate places. [2024-02-07 19:03:42,866 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 169 flow [2024-02-07 19:03:42,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:42,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:42,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:42,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 19:03:42,867 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 19:03:42,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:42,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1933709442, now seen corresponding path program 1 times [2024-02-07 19:03:42,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:42,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400179702] [2024-02-07 19:03:42,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:42,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:42,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:03:42,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:42,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400179702] [2024-02-07 19:03:42,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400179702] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:42,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:43,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 19:03:43,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503171490] [2024-02-07 19:03:43,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:43,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 19:03:43,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:43,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 19:03:43,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-07 19:03:43,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2024-02-07 19:03:43,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:43,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:43,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2024-02-07 19:03:43,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:43,222 INFO L124 PetriNetUnfolderBase]: 951/1667 cut-off events. [2024-02-07 19:03:43,222 INFO L125 PetriNetUnfolderBase]: For 1349/1349 co-relation queries the response was YES. [2024-02-07 19:03:43,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4369 conditions, 1667 events. 951/1667 cut-off events. For 1349/1349 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 8279 event pairs, 139 based on Foata normal form. 72/1673 useless extension candidates. Maximal degree in co-relation 4357. Up to 512 conditions per place. [2024-02-07 19:03:43,229 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 53 selfloop transitions, 11 changer transitions 1/78 dead transitions. [2024-02-07 19:03:43,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 78 transitions, 387 flow [2024-02-07 19:03:43,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 19:03:43,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 19:03:43,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2024-02-07 19:03:43,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2024-02-07 19:03:43,230 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 169 flow. Second operand 6 states and 159 transitions. [2024-02-07 19:03:43,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 78 transitions, 387 flow [2024-02-07 19:03:43,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 78 transitions, 362 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-02-07 19:03:43,235 INFO L231 Difference]: Finished difference. Result has 61 places, 45 transitions, 183 flow [2024-02-07 19:03:43,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=183, PETRI_PLACES=61, PETRI_TRANSITIONS=45} [2024-02-07 19:03:43,236 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -5 predicate places. [2024-02-07 19:03:43,236 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 45 transitions, 183 flow [2024-02-07 19:03:43,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:43,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:43,236 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:43,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 19:03:43,237 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 36 more)] === [2024-02-07 19:03:43,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:43,237 INFO L85 PathProgramCache]: Analyzing trace with hash 39317304, now seen corresponding path program 1 times [2024-02-07 19:03:43,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:43,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813448218] [2024-02-07 19:03:43,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:43,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:03:43,255 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 19:03:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:03:43,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 19:03:43,287 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 19:03:43,288 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 39 remaining) [2024-02-07 19:03:43,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 39 remaining) [2024-02-07 19:03:43,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 39 remaining) [2024-02-07 19:03:43,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 39 remaining) [2024-02-07 19:03:43,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 39 remaining) [2024-02-07 19:03:43,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 39 remaining) [2024-02-07 19:03:43,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 39 remaining) [2024-02-07 19:03:43,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 39 remaining) [2024-02-07 19:03:43,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 39 remaining) [2024-02-07 19:03:43,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 39 remaining) [2024-02-07 19:03:43,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 39 remaining) [2024-02-07 19:03:43,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 39 remaining) [2024-02-07 19:03:43,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 39 remaining) [2024-02-07 19:03:43,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 39 remaining) [2024-02-07 19:03:43,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 39 remaining) [2024-02-07 19:03:43,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 39 remaining) [2024-02-07 19:03:43,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 39 remaining) [2024-02-07 19:03:43,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 39 remaining) [2024-02-07 19:03:43,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 39 remaining) [2024-02-07 19:03:43,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 39 remaining) [2024-02-07 19:03:43,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 39 remaining) [2024-02-07 19:03:43,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (17 of 39 remaining) [2024-02-07 19:03:43,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 39 remaining) [2024-02-07 19:03:43,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 39 remaining) [2024-02-07 19:03:43,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 39 remaining) [2024-02-07 19:03:43,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 39 remaining) [2024-02-07 19:03:43,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 39 remaining) [2024-02-07 19:03:43,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 39 remaining) [2024-02-07 19:03:43,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 39 remaining) [2024-02-07 19:03:43,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 39 remaining) [2024-02-07 19:03:43,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 39 remaining) [2024-02-07 19:03:43,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 39 remaining) [2024-02-07 19:03:43,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 39 remaining) [2024-02-07 19:03:43,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 39 remaining) [2024-02-07 19:03:43,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 39 remaining) [2024-02-07 19:03:43,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 39 remaining) [2024-02-07 19:03:43,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 39 remaining) [2024-02-07 19:03:43,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 39 remaining) [2024-02-07 19:03:43,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 39 remaining) [2024-02-07 19:03:43,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 19:03:43,295 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:43,300 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 19:03:43,301 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 19:03:43,334 INFO L503 ceAbstractionStarter]: Automizer considered 21 witness invariants [2024-02-07 19:03:43,334 INFO L504 ceAbstractionStarter]: WitnessConsidered=21 [2024-02-07 19:03:43,336 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 07:03:43 BasicIcfg [2024-02-07 19:03:43,336 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 19:03:43,336 INFO L158 Benchmark]: Toolchain (without parser) took 10687.70ms. Allocated memory was 142.6MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 111.4MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 308.5MB. Max. memory is 16.1GB. [2024-02-07 19:03:43,337 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 142.6MB. Free memory was 116.3MB in the beginning and 116.1MB in the end (delta: 241.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:03:43,337 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 142.6MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:03:43,337 INFO L158 Benchmark]: CACSL2BoogieTranslator took 694.05ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 81.0MB in the end (delta: 30.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-02-07 19:03:43,337 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.20ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 78.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-07 19:03:43,341 INFO L158 Benchmark]: Boogie Preprocessor took 66.49ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 76.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:03:43,341 INFO L158 Benchmark]: RCFGBuilder took 663.35ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 83.6MB in the end (delta: -7.3MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2024-02-07 19:03:43,342 INFO L158 Benchmark]: TraceAbstraction took 9192.67ms. Allocated memory was 142.6MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 82.9MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 281.9MB. Max. memory is 16.1GB. [2024-02-07 19:03:43,343 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.31ms. Allocated memory is still 142.6MB. Free memory was 116.3MB in the beginning and 116.1MB in the end (delta: 241.1kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.17ms. Allocated memory is still 142.6MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 694.05ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 81.0MB in the end (delta: 30.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.20ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 78.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.49ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 76.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 663.35ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 83.6MB in the end (delta: -7.3MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9192.67ms. Allocated memory was 142.6MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 82.9MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 281.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 789]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L776] 0 pthread_t t1819; [L777] FCALL, FORK 0 pthread_create(&t1819, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1819={5:0}, x=0, y=0] [L723] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]]]] [L723] 1 __unbuffered_p0_EAX = y [L724] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[2]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L778] 0 pthread_t t1820; [L779] FCALL, FORK 0 pthread_create(&t1820, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1819={5:0}, t1820={6:0}, x=0, y=0] [L738] 2 x = 2 [L739] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=2, y=0] [L780] 0 pthread_t t1821; [L726] 1 x = 1 [L727] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=0] [L781] FCALL, FORK 0 pthread_create(&t1821, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1819={5:0}, t1820={6:0}, t1821={3:0}, x=1, y=0] [L753] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]]]] [L753] 3 __unbuffered_p2_EAX = y [L754] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[2]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=0] [L741] 2 y = 1 [L742] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1] [L756] 3 y = 2 [L757] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=2] [L731] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L731] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L732] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=2] [L746] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L746] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=2] [L761] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L761] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=2] [L783] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L784] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1819={5:0}, t1820={6:0}, t1821={3:0}, x=1, y=2] [L785] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L785] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L785] RET 0 assume_abort_if_not(main$tmp_guard0) [L789] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[127]]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[2]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[2]]]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EAX]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[2]]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[2]]]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1819={5:0}, t1820={6:0}, t1821={3:0}, x=1, y=2] - UnprovableResult [Line: 723]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 731]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 732]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 739]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 742]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 746]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 753]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 754]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 757]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 761]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 783]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 784]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 785]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 790]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 781]: 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: 779]: 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: 777]: 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, 98 locations, 39 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: 9.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 335 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 329 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 600 IncrementalHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 5 mSDtfsCounter, 600 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=9, InterpolantAutomatonStates: 33, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-02-07 19:03:43,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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