./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe012_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/safe012_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/safe012_tso.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe012_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:49,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 19:03:49,627 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:49,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 19:03:49,631 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 19:03:49,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 19:03:49,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 19:03:49,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 19:03:49,659 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 19:03:49,659 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 19:03:49,659 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 19:03:49,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 19:03:49,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 19:03:49,666 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 19:03:49,667 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 19:03:49,667 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 19:03:49,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 19:03:49,669 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 19:03:49,669 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 19:03:49,670 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 19:03:49,670 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 19:03:49,670 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 19:03:49,671 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 19:03:49,671 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 19:03:49,671 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 19:03:49,671 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 19:03:49,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 19:03:49,672 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 19:03:49,673 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 19:03:49,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 19:03:49,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 19:03:49,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 19:03:49,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:03:49,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 19:03:49,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 19:03:49,675 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 19:03:49,676 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 19:03:49,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 19:03:49,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 19:03:49,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 19:03:49,677 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 19:03:49,677 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 19:03:49,677 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 19:03:49,677 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:49,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 19:03:50,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 19:03:50,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 19:03:50,014 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 19:03:50,014 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 19:03:50,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_tso.i [2024-02-07 19:03:51,280 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 19:03:51,524 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 19:03:51,531 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_tso.i [2024-02-07 19:03:51,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2640ade5/444a0bba15974961bdaa4f63e0a189cb/FLAGe3c1825eb [2024-02-07 19:03:51,569 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2640ade5/444a0bba15974961bdaa4f63e0a189cb [2024-02-07 19:03:51,571 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 19:03:51,572 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 19:03:51,572 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/safe012_tso.yml/witness.yml [2024-02-07 19:03:51,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 19:03:51,665 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 19:03:51,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 19:03:51,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 19:03:51,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 19:03:51,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:03:51" (1/2) ... [2024-02-07 19:03:51,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b7ffb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:51, skipping insertion in model container [2024-02-07 19:03:51,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:03:51" (1/2) ... [2024-02-07 19:03:51,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4f8f2a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:03:51, skipping insertion in model container [2024-02-07 19:03:51,675 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:51" (2/2) ... [2024-02-07 19:03:51,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b7ffb8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:03:51, skipping insertion in model container [2024-02-07 19:03:51,676 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:51" (2/2) ... [2024-02-07 19:03:51,676 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 19:03:51,753 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 19:03:51,754 INFO L76 edCorrectnessWitness]: Location invariant before [L795-L795] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 19:03:51,755 INFO L76 edCorrectnessWitness]: Location invariant before [L761-L761] z == 1 [2024-02-07 19:03:51,755 INFO L76 edCorrectnessWitness]: Location invariant before [L789-L789] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 19:03:51,755 INFO L76 edCorrectnessWitness]: Location invariant before [L788-L788] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 19:03:51,755 INFO L76 edCorrectnessWitness]: Location invariant before [L743-L743] x == 1 [2024-02-07 19:03:51,756 INFO L76 edCorrectnessWitness]: Location invariant before [L736-L736] 1 <= __unbuffered_cnt [2024-02-07 19:03:51,756 INFO L76 edCorrectnessWitness]: Location invariant before [L751-L751] 1 <= __unbuffered_cnt [2024-02-07 19:03:51,756 INFO L76 edCorrectnessWitness]: Location invariant before [L730-L730] ((0 <= x) && (x <= 1)) && (x == 0 || x == 1) [2024-02-07 19:03:51,756 INFO L76 edCorrectnessWitness]: Location invariant before [L727-L727] ((0 <= z) && (z <= 1)) && (z == 0 || z == 1) [2024-02-07 19:03:51,756 INFO L76 edCorrectnessWitness]: Location invariant before [L758-L758] ((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) [2024-02-07 19:03:51,757 INFO L76 edCorrectnessWitness]: Location invariant before [L766-L766] 1 <= __unbuffered_cnt [2024-02-07 19:03:51,757 INFO L76 edCorrectnessWitness]: Location invariant before [L731-L731] ((0 <= __unbuffered_p0_EBX) && (__unbuffered_p0_EBX <= 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1) [2024-02-07 19:03:51,757 INFO L76 edCorrectnessWitness]: Location invariant before [L757-L757] ((0 <= y) && (y <= 1)) && (y == 0 || y == 1) [2024-02-07 19:03:51,757 INFO L76 edCorrectnessWitness]: Location invariant before [L728-L728] ((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) [2024-02-07 19:03:51,757 INFO L76 edCorrectnessWitness]: Location invariant before [L746-L746] y == 1 [2024-02-07 19:03:51,757 INFO L76 edCorrectnessWitness]: Location invariant before [L787-L787] 0 <= __unbuffered_cnt [2024-02-07 19:03:51,757 INFO L76 edCorrectnessWitness]: Location invariant before [L765-L765] 0 <= __unbuffered_cnt [2024-02-07 19:03:51,758 INFO L76 edCorrectnessWitness]: Location invariant before [L18-L18] ((0 <= expression) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-02-07 19:03:51,758 INFO L76 edCorrectnessWitness]: Location invariant before [L793-L793] ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && (__unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) [2024-02-07 19:03:51,758 INFO L76 edCorrectnessWitness]: Location invariant before [L750-L750] 0 <= __unbuffered_cnt [2024-02-07 19:03:51,758 INFO L76 edCorrectnessWitness]: Location invariant before [L794-L794] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 19:03:51,759 INFO L76 edCorrectnessWitness]: Location invariant before [L735-L735] 0 <= __unbuffered_cnt [2024-02-07 19:03:51,799 INFO L181 MainTranslator]: Built tables and reachable declarations [2024-02-07 19:03:51,987 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/safe012_tso.i[945,958] [2024-02-07 19:03:52,137 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:03:52,159 INFO L206 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 19:03:52,188 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/safe012_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 Start Parsing Local [2024-02-07 19:03:52,239 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:03:52,288 INFO L211 MainTranslator]: Completed translation [2024-02-07 19:03:52,290 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:03:52 WrapperNode [2024-02-07 19:03:52,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 19:03:52,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 19:03:52,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 19:03:52,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 19:03:52,297 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:52" (1/1) ... [2024-02-07 19:03:52,327 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:52" (1/1) ... [2024-02-07 19:03:52,348 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 78 [2024-02-07 19:03:52,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 19:03:52,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 19:03:52,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 19:03:52,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 19:03:52,364 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:52" (1/1) ... [2024-02-07 19:03:52,364 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:52" (1/1) ... [2024-02-07 19:03:52,366 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:52" (1/1) ... [2024-02-07 19:03:52,377 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:52,378 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:52" (1/1) ... [2024-02-07 19:03:52,379 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:52" (1/1) ... [2024-02-07 19:03:52,383 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:52" (1/1) ... [2024-02-07 19:03:52,385 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:52" (1/1) ... [2024-02-07 19:03:52,386 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:52" (1/1) ... [2024-02-07 19:03:52,387 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:52" (1/1) ... [2024-02-07 19:03:52,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 19:03:52,390 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 19:03:52,390 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 19:03:52,390 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 19:03:52,391 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:52" (1/1) ... [2024-02-07 19:03:52,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:03:52,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:03:52,414 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:52,429 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:52,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 19:03:52,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 19:03:52,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 19:03:52,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 19:03:52,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 19:03:52,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 19:03:52,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 19:03:52,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 19:03:52,446 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-02-07 19:03:52,446 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-02-07 19:03:52,446 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-02-07 19:03:52,447 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-02-07 19:03:52,447 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-02-07 19:03:52,447 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-02-07 19:03:52,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 19:03:52,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 19:03:52,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 19:03:52,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 19:03:52,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 19:03:52,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 19:03:52,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 19:03:52,449 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:52,610 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 19:03:52,612 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 19:03:52,813 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 19:03:52,826 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 19:03:52,978 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 19:03:52,978 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-07 19:03:52,979 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:03:52 BoogieIcfgContainer [2024-02-07 19:03:52,979 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 19:03:52,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 19:03:52,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 19:03:52,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 19:03:52,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 07:03:51" (1/4) ... [2024-02-07 19:03:52,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a4100d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:03:52, skipping insertion in model container [2024-02-07 19:03:52,986 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:51" (2/4) ... [2024-02-07 19:03:52,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a4100d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:03:52, skipping insertion in model container [2024-02-07 19:03:52,986 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:52" (3/4) ... [2024-02-07 19:03:52,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a4100d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:03:52, skipping insertion in model container [2024-02-07 19:03:52,988 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:52" (4/4) ... [2024-02-07 19:03:52,989 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_tso.i [2024-02-07 19:03:53,003 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 19:03:53,004 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-02-07 19:03:53,004 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 19:03:53,086 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-07 19:03:53,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 61 transitions, 134 flow [2024-02-07 19:03:53,184 INFO L124 PetriNetUnfolderBase]: 1/58 cut-off events. [2024-02-07 19:03:53,184 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:03:53,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 58 events. 1/58 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2024-02-07 19:03:53,190 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 61 transitions, 134 flow [2024-02-07 19:03:53,193 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 58 transitions, 125 flow [2024-02-07 19:03:53,199 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 19:03:53,206 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;@77757175, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 19:03:53,210 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-02-07 19:03:53,213 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 19:03:53,214 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-02-07 19:03:53,214 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:03:53,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:53,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-07 19:03:53,216 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:53,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:53,222 INFO L85 PathProgramCache]: Analyzing trace with hash 9824838, now seen corresponding path program 1 times [2024-02-07 19:03:53,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:53,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500358989] [2024-02-07 19:03:53,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:53,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:53,521 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:53,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:53,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500358989] [2024-02-07 19:03:53,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500358989] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:53,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:53,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:03:53,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529436529] [2024-02-07 19:03:53,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:53,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:53,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:53,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:53,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:53,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 61 [2024-02-07 19:03:53,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 125 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:53,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:53,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 61 [2024-02-07 19:03:53,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:54,782 INFO L124 PetriNetUnfolderBase]: 7136/11474 cut-off events. [2024-02-07 19:03:54,782 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2024-02-07 19:03:54,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21676 conditions, 11474 events. 7136/11474 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 84192 event pairs, 2864 based on Foata normal form. 318/8550 useless extension candidates. Maximal degree in co-relation 21665. Up to 6163 conditions per place. [2024-02-07 19:03:54,872 INFO L140 encePairwiseOnDemand]: 46/61 looper letters, 49 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2024-02-07 19:03:54,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 65 transitions, 241 flow [2024-02-07 19:03:54,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:54,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:54,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2024-02-07 19:03:54,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6775956284153005 [2024-02-07 19:03:54,884 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 125 flow. Second operand 3 states and 124 transitions. [2024-02-07 19:03:54,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 65 transitions, 241 flow [2024-02-07 19:03:54,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 65 transitions, 238 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-07 19:03:54,889 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 106 flow [2024-02-07 19:03:54,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2024-02-07 19:03:54,892 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -11 predicate places. [2024-02-07 19:03:54,893 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 106 flow [2024-02-07 19:03:54,893 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:54,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:54,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-07 19:03:54,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 19:03:54,894 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:54,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:54,894 INFO L85 PathProgramCache]: Analyzing trace with hash 304570361, now seen corresponding path program 1 times [2024-02-07 19:03:54,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:54,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094811661] [2024-02-07 19:03:54,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:54,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:55,037 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:55,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:55,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094811661] [2024-02-07 19:03:55,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094811661] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:55,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:55,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:03:55,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195997553] [2024-02-07 19:03:55,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:55,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:55,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:55,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:55,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:55,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 61 [2024-02-07 19:03:55,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:55,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:55,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 61 [2024-02-07 19:03:55,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:55,688 INFO L124 PetriNetUnfolderBase]: 6957/10570 cut-off events. [2024-02-07 19:03:55,689 INFO L125 PetriNetUnfolderBase]: For 573/573 co-relation queries the response was YES. [2024-02-07 19:03:55,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21476 conditions, 10570 events. 6957/10570 cut-off events. For 573/573 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 72042 event pairs, 1156 based on Foata normal form. 0/7848 useless extension candidates. Maximal degree in co-relation 21465. Up to 8736 conditions per place. [2024-02-07 19:03:55,759 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 52 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2024-02-07 19:03:55,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 265 flow [2024-02-07 19:03:55,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:55,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-02-07 19:03:55,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5792349726775956 [2024-02-07 19:03:55,762 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 106 flow. Second operand 3 states and 106 transitions. [2024-02-07 19:03:55,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 265 flow [2024-02-07 19:03:55,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 68 transitions, 259 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:03:55,766 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 110 flow [2024-02-07 19:03:55,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2024-02-07 19:03:55,767 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -10 predicate places. [2024-02-07 19:03:55,767 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 110 flow [2024-02-07 19:03:55,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:03:55,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:55,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:55,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 19:03:55,769 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:55,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:55,772 INFO L85 PathProgramCache]: Analyzing trace with hash 634353084, now seen corresponding path program 1 times [2024-02-07 19:03:55,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:55,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711634857] [2024-02-07 19:03:55,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:55,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:55,830 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:55,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:55,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711634857] [2024-02-07 19:03:55,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711634857] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:55,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:55,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:03:55,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55332208] [2024-02-07 19:03:55,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:55,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:55,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:55,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:55,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:55,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 61 [2024-02-07 19:03:55,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 110 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:55,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:55,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 61 [2024-02-07 19:03:55,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:56,400 INFO L124 PetriNetUnfolderBase]: 5326/8084 cut-off events. [2024-02-07 19:03:56,401 INFO L125 PetriNetUnfolderBase]: For 731/731 co-relation queries the response was YES. [2024-02-07 19:03:56,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17185 conditions, 8084 events. 5326/8084 cut-off events. For 731/731 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 50759 event pairs, 1728 based on Foata normal form. 0/6543 useless extension candidates. Maximal degree in co-relation 17173. Up to 6475 conditions per place. [2024-02-07 19:03:56,446 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 51 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2024-02-07 19:03:56,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 69 transitions, 278 flow [2024-02-07 19:03:56,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:56,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:56,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2024-02-07 19:03:56,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6010928961748634 [2024-02-07 19:03:56,451 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 110 flow. Second operand 3 states and 110 transitions. [2024-02-07 19:03:56,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 69 transitions, 278 flow [2024-02-07 19:03:56,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 69 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:03:56,454 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 138 flow [2024-02-07 19:03:56,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2024-02-07 19:03:56,455 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -9 predicate places. [2024-02-07 19:03:56,456 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 138 flow [2024-02-07 19:03:56,456 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:56,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:56,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:56,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 19:03:56,457 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:56,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:56,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1167061850, now seen corresponding path program 1 times [2024-02-07 19:03:56,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:56,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014561650] [2024-02-07 19:03:56,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:56,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:56,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:03:56,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:56,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014561650] [2024-02-07 19:03:56,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014561650] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:56,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:56,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:03:56,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285964618] [2024-02-07 19:03:56,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:56,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:56,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:56,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:56,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:56,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 61 [2024-02-07 19:03:56,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 138 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:56,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:56,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 61 [2024-02-07 19:03:56,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:57,003 INFO L124 PetriNetUnfolderBase]: 5079/7993 cut-off events. [2024-02-07 19:03:57,003 INFO L125 PetriNetUnfolderBase]: For 1223/1223 co-relation queries the response was YES. [2024-02-07 19:03:57,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18580 conditions, 7993 events. 5079/7993 cut-off events. For 1223/1223 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 53395 event pairs, 1748 based on Foata normal form. 0/6751 useless extension candidates. Maximal degree in co-relation 18567. Up to 5483 conditions per place. [2024-02-07 19:03:57,049 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 57 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2024-02-07 19:03:57,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 73 transitions, 327 flow [2024-02-07 19:03:57,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:57,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:57,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-02-07 19:03:57,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5792349726775956 [2024-02-07 19:03:57,051 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 138 flow. Second operand 3 states and 106 transitions. [2024-02-07 19:03:57,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 73 transitions, 327 flow [2024-02-07 19:03:57,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 73 transitions, 321 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:03:57,055 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 142 flow [2024-02-07 19:03:57,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2024-02-07 19:03:57,056 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -7 predicate places. [2024-02-07 19:03:57,056 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 142 flow [2024-02-07 19:03:57,056 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:57,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:57,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:57,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 19:03:57,057 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:57,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:57,058 INFO L85 PathProgramCache]: Analyzing trace with hash -320170138, now seen corresponding path program 1 times [2024-02-07 19:03:57,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:57,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721605383] [2024-02-07 19:03:57,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:57,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:57,107 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:57,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:57,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721605383] [2024-02-07 19:03:57,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721605383] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:57,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:57,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:57,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851293089] [2024-02-07 19:03:57,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:57,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:57,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:57,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:57,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:57,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 61 [2024-02-07 19:03:57,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 142 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:57,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:57,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 61 [2024-02-07 19:03:57,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:57,534 INFO L124 PetriNetUnfolderBase]: 4492/6898 cut-off events. [2024-02-07 19:03:57,534 INFO L125 PetriNetUnfolderBase]: For 1328/1328 co-relation queries the response was YES. [2024-02-07 19:03:57,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16628 conditions, 6898 events. 4492/6898 cut-off events. For 1328/1328 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 43237 event pairs, 1149 based on Foata normal form. 244/6237 useless extension candidates. Maximal degree in co-relation 16613. Up to 5758 conditions per place. [2024-02-07 19:03:57,566 INFO L140 encePairwiseOnDemand]: 59/61 looper letters, 56 selfloop transitions, 1 changer transitions 0/71 dead transitions. [2024-02-07 19:03:57,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 71 transitions, 317 flow [2024-02-07 19:03:57,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:57,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:57,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-02-07 19:03:57,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5683060109289617 [2024-02-07 19:03:57,567 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 142 flow. Second operand 3 states and 104 transitions. [2024-02-07 19:03:57,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 71 transitions, 317 flow [2024-02-07 19:03:57,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 71 transitions, 311 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-07 19:03:57,585 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 134 flow [2024-02-07 19:03:57,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=132, 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=134, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2024-02-07 19:03:57,587 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -9 predicate places. [2024-02-07 19:03:57,587 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 134 flow [2024-02-07 19:03:57,587 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:57,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:57,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:57,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 19:03:57,588 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:57,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:57,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1819136832, now seen corresponding path program 1 times [2024-02-07 19:03:57,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:57,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405423405] [2024-02-07 19:03:57,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:57,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:57,634 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:57,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:57,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405423405] [2024-02-07 19:03:57,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405423405] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:57,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:57,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:57,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305866971] [2024-02-07 19:03:57,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:57,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:57,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:57,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:57,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:57,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2024-02-07 19:03:57,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 134 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:57,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:57,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2024-02-07 19:03:57,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:58,100 INFO L124 PetriNetUnfolderBase]: 4492/7517 cut-off events. [2024-02-07 19:03:58,101 INFO L125 PetriNetUnfolderBase]: For 1417/1417 co-relation queries the response was YES. [2024-02-07 19:03:58,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16957 conditions, 7517 events. 4492/7517 cut-off events. For 1417/1417 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 53804 event pairs, 4200 based on Foata normal form. 0/6276 useless extension candidates. Maximal degree in co-relation 16944. Up to 6481 conditions per place. [2024-02-07 19:03:58,130 INFO L140 encePairwiseOnDemand]: 59/61 looper letters, 33 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2024-02-07 19:03:58,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 47 transitions, 200 flow [2024-02-07 19:03:58,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:58,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:58,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-02-07 19:03:58,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4371584699453552 [2024-02-07 19:03:58,131 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 134 flow. Second operand 3 states and 80 transitions. [2024-02-07 19:03:58,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 47 transitions, 200 flow [2024-02-07 19:03:58,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 47 transitions, 199 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:03:58,133 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 133 flow [2024-02-07 19:03:58,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2024-02-07 19:03:58,135 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -9 predicate places. [2024-02-07 19:03:58,136 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 133 flow [2024-02-07 19:03:58,136 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:58,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:58,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:58,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 19:03:58,136 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:58,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:58,137 INFO L85 PathProgramCache]: Analyzing trace with hash 179712541, now seen corresponding path program 1 times [2024-02-07 19:03:58,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:58,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871288649] [2024-02-07 19:03:58,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:58,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:58,182 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:58,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:58,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871288649] [2024-02-07 19:03:58,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871288649] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:58,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:58,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:58,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789030202] [2024-02-07 19:03:58,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:58,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:58,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:58,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:58,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:58,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 61 [2024-02-07 19:03:58,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 133 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:58,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:58,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 61 [2024-02-07 19:03:58,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:58,522 INFO L124 PetriNetUnfolderBase]: 4097/6654 cut-off events. [2024-02-07 19:03:58,522 INFO L125 PetriNetUnfolderBase]: For 1031/1031 co-relation queries the response was YES. [2024-02-07 19:03:58,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15192 conditions, 6654 events. 4097/6654 cut-off events. For 1031/1031 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 45329 event pairs, 1528 based on Foata normal form. 168/5871 useless extension candidates. Maximal degree in co-relation 15182. Up to 3695 conditions per place. [2024-02-07 19:03:58,556 INFO L140 encePairwiseOnDemand]: 59/61 looper letters, 52 selfloop transitions, 1 changer transitions 0/66 dead transitions. [2024-02-07 19:03:58,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 291 flow [2024-02-07 19:03:58,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:58,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:58,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-02-07 19:03:58,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.546448087431694 [2024-02-07 19:03:58,558 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 133 flow. Second operand 3 states and 100 transitions. [2024-02-07 19:03:58,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 291 flow [2024-02-07 19:03:58,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 66 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:03:58,560 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 128 flow [2024-02-07 19:03:58,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2024-02-07 19:03:58,561 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -10 predicate places. [2024-02-07 19:03:58,561 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 128 flow [2024-02-07 19:03:58,562 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:58,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:58,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:58,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 19:03:58,562 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:58,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:58,563 INFO L85 PathProgramCache]: Analyzing trace with hash -990799361, now seen corresponding path program 1 times [2024-02-07 19:03:58,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:58,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110165926] [2024-02-07 19:03:58,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:58,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:58,590 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:58,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:58,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110165926] [2024-02-07 19:03:58,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110165926] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:58,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:58,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:58,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111775447] [2024-02-07 19:03:58,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:58,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:58,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:58,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:58,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:58,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 61 [2024-02-07 19:03:58,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 128 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:58,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:58,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 61 [2024-02-07 19:03:58,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:58,954 INFO L124 PetriNetUnfolderBase]: 3702/5900 cut-off events. [2024-02-07 19:03:58,954 INFO L125 PetriNetUnfolderBase]: For 961/961 co-relation queries the response was YES. [2024-02-07 19:03:58,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13586 conditions, 5900 events. 3702/5900 cut-off events. For 961/961 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 37748 event pairs, 1341 based on Foata normal form. 168/5215 useless extension candidates. Maximal degree in co-relation 13577. Up to 3799 conditions per place. [2024-02-07 19:03:58,988 INFO L140 encePairwiseOnDemand]: 59/61 looper letters, 53 selfloop transitions, 1 changer transitions 0/67 dead transitions. [2024-02-07 19:03:58,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 67 transitions, 294 flow [2024-02-07 19:03:58,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:58,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-02-07 19:03:58,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5519125683060109 [2024-02-07 19:03:58,989 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 128 flow. Second operand 3 states and 101 transitions. [2024-02-07 19:03:58,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 67 transitions, 294 flow [2024-02-07 19:03:58,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 67 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:03:58,992 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 123 flow [2024-02-07 19:03:58,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2024-02-07 19:03:58,992 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -11 predicate places. [2024-02-07 19:03:58,993 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 123 flow [2024-02-07 19:03:58,993 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:58,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:58,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:58,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 19:03:58,994 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:58,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:58,994 INFO L85 PathProgramCache]: Analyzing trace with hash 138815457, now seen corresponding path program 1 times [2024-02-07 19:03:58,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:58,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183860672] [2024-02-07 19:03:58,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:58,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:59,106 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:59,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:59,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183860672] [2024-02-07 19:03:59,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183860672] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:59,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:59,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:03:59,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984372433] [2024-02-07 19:03:59,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:59,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:03:59,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:59,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:03:59,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:03:59,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2024-02-07 19:03:59,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 123 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:59,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:59,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2024-02-07 19:03:59,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:59,492 INFO L124 PetriNetUnfolderBase]: 3493/6287 cut-off events. [2024-02-07 19:03:59,492 INFO L125 PetriNetUnfolderBase]: For 825/825 co-relation queries the response was YES. [2024-02-07 19:03:59,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13690 conditions, 6287 events. 3493/6287 cut-off events. For 825/825 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 46348 event pairs, 597 based on Foata normal form. 179/5385 useless extension candidates. Maximal degree in co-relation 13682. Up to 3001 conditions per place. [2024-02-07 19:03:59,525 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 54 selfloop transitions, 5 changer transitions 0/72 dead transitions. [2024-02-07 19:03:59,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 72 transitions, 319 flow [2024-02-07 19:03:59,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:03:59,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:03:59,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2024-02-07 19:03:59,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5122950819672131 [2024-02-07 19:03:59,527 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 123 flow. Second operand 4 states and 125 transitions. [2024-02-07 19:03:59,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 72 transitions, 319 flow [2024-02-07 19:03:59,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 72 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:03:59,531 INFO L231 Difference]: Finished difference. Result has 60 places, 46 transitions, 148 flow [2024-02-07 19:03:59,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=60, PETRI_TRANSITIONS=46} [2024-02-07 19:03:59,532 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -7 predicate places. [2024-02-07 19:03:59,532 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 46 transitions, 148 flow [2024-02-07 19:03:59,532 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:59,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:59,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:03:59,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 19:03:59,533 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:59,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:59,534 INFO L85 PathProgramCache]: Analyzing trace with hash -815753530, now seen corresponding path program 1 times [2024-02-07 19:03:59,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:59,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084920271] [2024-02-07 19:03:59,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:59,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:59,572 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:59,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:59,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084920271] [2024-02-07 19:03:59,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084920271] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:59,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:59,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:03:59,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989872139] [2024-02-07 19:03:59,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:59,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:03:59,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:59,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:03:59,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:03:59,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 61 [2024-02-07 19:03:59,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 46 transitions, 148 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:59,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:59,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 61 [2024-02-07 19:03:59,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:03:59,815 INFO L124 PetriNetUnfolderBase]: 2080/3786 cut-off events. [2024-02-07 19:03:59,815 INFO L125 PetriNetUnfolderBase]: For 1165/1177 co-relation queries the response was YES. [2024-02-07 19:03:59,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8638 conditions, 3786 events. 2080/3786 cut-off events. For 1165/1177 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 25235 event pairs, 864 based on Foata normal form. 98/3573 useless extension candidates. Maximal degree in co-relation 8627. Up to 2834 conditions per place. [2024-02-07 19:03:59,833 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 35 selfloop transitions, 3 changer transitions 2/53 dead transitions. [2024-02-07 19:03:59,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 53 transitions, 241 flow [2024-02-07 19:03:59,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:03:59,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:03:59,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2024-02-07 19:03:59,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5191256830601093 [2024-02-07 19:03:59,835 INFO L175 Difference]: Start difference. First operand has 60 places, 46 transitions, 148 flow. Second operand 3 states and 95 transitions. [2024-02-07 19:03:59,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 53 transitions, 241 flow [2024-02-07 19:03:59,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 53 transitions, 235 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:03:59,837 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 126 flow [2024-02-07 19:03:59,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2024-02-07 19:03:59,838 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -11 predicate places. [2024-02-07 19:03:59,840 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 126 flow [2024-02-07 19:03:59,840 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:59,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:03:59,840 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:59,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 19:03:59,840 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:03:59,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:03:59,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1188104774, now seen corresponding path program 1 times [2024-02-07 19:03:59,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:03:59,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336641576] [2024-02-07 19:03:59,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:03:59,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:03:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:03:59,971 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:59,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:03:59,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336641576] [2024-02-07 19:03:59,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336641576] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:03:59,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:03:59,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:03:59,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447413591] [2024-02-07 19:03:59,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:03:59,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:03:59,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:03:59,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:03:59,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:03:59,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2024-02-07 19:03:59,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 126 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:59,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:03:59,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2024-02-07 19:03:59,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:00,177 INFO L124 PetriNetUnfolderBase]: 1159/2147 cut-off events. [2024-02-07 19:04:00,177 INFO L125 PetriNetUnfolderBase]: For 765/765 co-relation queries the response was YES. [2024-02-07 19:04:00,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4953 conditions, 2147 events. 1159/2147 cut-off events. For 765/765 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 12378 event pairs, 149 based on Foata normal form. 98/2102 useless extension candidates. Maximal degree in co-relation 4943. Up to 641 conditions per place. [2024-02-07 19:04:00,186 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 57 selfloop transitions, 8 changer transitions 1/79 dead transitions. [2024-02-07 19:04:00,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 79 transitions, 365 flow [2024-02-07 19:04:00,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:04:00,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:04:00,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2024-02-07 19:04:00,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4852459016393443 [2024-02-07 19:04:00,188 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 126 flow. Second operand 5 states and 148 transitions. [2024-02-07 19:04:00,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 79 transitions, 365 flow [2024-02-07 19:04:00,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 79 transitions, 349 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-02-07 19:04:00,191 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 159 flow [2024-02-07 19:04:00,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2024-02-07 19:04:00,192 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -9 predicate places. [2024-02-07 19:04:00,192 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 159 flow [2024-02-07 19:04:00,192 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:04:00,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:00,193 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:04:00,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-07 19:04:00,193 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:04:00,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:00,193 INFO L85 PathProgramCache]: Analyzing trace with hash 903091292, now seen corresponding path program 1 times [2024-02-07 19:04:00,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:00,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56280575] [2024-02-07 19:04:00,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:00,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:00,349 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:04:00,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:00,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56280575] [2024-02-07 19:04:00,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56280575] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:00,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:00,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 19:04:00,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672190016] [2024-02-07 19:04:00,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:00,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 19:04:00,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:00,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 19:04:00,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-07 19:04:00,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2024-02-07 19:04:00,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 159 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:04:00,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:00,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2024-02-07 19:04:00,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:00,477 INFO L124 PetriNetUnfolderBase]: 700/1202 cut-off events. [2024-02-07 19:04:00,478 INFO L125 PetriNetUnfolderBase]: For 872/872 co-relation queries the response was YES. [2024-02-07 19:04:00,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3238 conditions, 1202 events. 700/1202 cut-off events. For 872/872 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5437 event pairs, 128 based on Foata normal form. 44/1211 useless extension candidates. Maximal degree in co-relation 3227. Up to 378 conditions per place. [2024-02-07 19:04:00,484 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 49 selfloop transitions, 11 changer transitions 1/74 dead transitions. [2024-02-07 19:04:00,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 74 transitions, 359 flow [2024-02-07 19:04:00,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 19:04:00,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 19:04:00,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2024-02-07 19:04:00,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4344262295081967 [2024-02-07 19:04:00,486 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 159 flow. Second operand 6 states and 159 transitions. [2024-02-07 19:04:00,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 74 transitions, 359 flow [2024-02-07 19:04:00,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 74 transitions, 334 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-02-07 19:04:00,489 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 173 flow [2024-02-07 19:04:00,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=173, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2024-02-07 19:04:00,490 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -6 predicate places. [2024-02-07 19:04:00,490 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 173 flow [2024-02-07 19:04:00,490 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:04:00,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:00,491 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:04:00,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-07 19:04:00,491 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-07 19:04:00,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:00,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1338338, now seen corresponding path program 1 times [2024-02-07 19:04:00,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:00,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59720473] [2024-02-07 19:04:00,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:00,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:04:00,507 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 19:04:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:04:00,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 19:04:00,543 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 19:04:00,543 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 41 remaining) [2024-02-07 19:04:00,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 41 remaining) [2024-02-07 19:04:00,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 41 remaining) [2024-02-07 19:04:00,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 41 remaining) [2024-02-07 19:04:00,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 41 remaining) [2024-02-07 19:04:00,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 41 remaining) [2024-02-07 19:04:00,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 41 remaining) [2024-02-07 19:04:00,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 41 remaining) [2024-02-07 19:04:00,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 41 remaining) [2024-02-07 19:04:00,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 41 remaining) [2024-02-07 19:04:00,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 41 remaining) [2024-02-07 19:04:00,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 41 remaining) [2024-02-07 19:04:00,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 41 remaining) [2024-02-07 19:04:00,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 41 remaining) [2024-02-07 19:04:00,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 41 remaining) [2024-02-07 19:04:00,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 41 remaining) [2024-02-07 19:04:00,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 41 remaining) [2024-02-07 19:04:00,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 41 remaining) [2024-02-07 19:04:00,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 41 remaining) [2024-02-07 19:04:00,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 41 remaining) [2024-02-07 19:04:00,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 41 remaining) [2024-02-07 19:04:00,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 41 remaining) [2024-02-07 19:04:00,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (18 of 41 remaining) [2024-02-07 19:04:00,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 41 remaining) [2024-02-07 19:04:00,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 41 remaining) [2024-02-07 19:04:00,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 41 remaining) [2024-02-07 19:04:00,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 41 remaining) [2024-02-07 19:04:00,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 41 remaining) [2024-02-07 19:04:00,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 41 remaining) [2024-02-07 19:04:00,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 41 remaining) [2024-02-07 19:04:00,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 41 remaining) [2024-02-07 19:04:00,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 41 remaining) [2024-02-07 19:04:00,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 41 remaining) [2024-02-07 19:04:00,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 41 remaining) [2024-02-07 19:04:00,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 41 remaining) [2024-02-07 19:04:00,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 41 remaining) [2024-02-07 19:04:00,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 41 remaining) [2024-02-07 19:04:00,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 41 remaining) [2024-02-07 19:04:00,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 41 remaining) [2024-02-07 19:04:00,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 41 remaining) [2024-02-07 19:04:00,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 41 remaining) [2024-02-07 19:04:00,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-07 19:04:00,551 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:00,557 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 19:04:00,557 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 19:04:00,605 INFO L503 ceAbstractionStarter]: Automizer considered 22 witness invariants [2024-02-07 19:04:00,606 INFO L504 ceAbstractionStarter]: WitnessConsidered=22 [2024-02-07 19:04:00,608 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 07:04:00 BasicIcfg [2024-02-07 19:04:00,608 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 19:04:00,608 INFO L158 Benchmark]: Toolchain (without parser) took 8943.24ms. Allocated memory was 151.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 71.2MB in the beginning and 422.7MB in the end (delta: -351.5MB). Peak memory consumption was 800.3MB. Max. memory is 16.1GB. [2024-02-07 19:04:00,609 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 151.0MB. Free memory is still 102.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:04:00,609 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 75.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:04:00,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 623.93ms. Allocated memory was 151.0MB in the beginning and 199.2MB in the end (delta: 48.2MB). Free memory was 71.0MB in the beginning and 157.7MB in the end (delta: -86.7MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2024-02-07 19:04:00,609 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.75ms. Allocated memory is still 199.2MB. Free memory was 157.7MB in the beginning and 155.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:04:00,610 INFO L158 Benchmark]: Boogie Preprocessor took 34.12ms. Allocated memory is still 199.2MB. Free memory was 155.6MB in the beginning and 152.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-07 19:04:00,610 INFO L158 Benchmark]: RCFGBuilder took 589.16ms. Allocated memory is still 199.2MB. Free memory was 152.5MB in the beginning and 118.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-02-07 19:04:00,610 INFO L158 Benchmark]: TraceAbstraction took 7626.32ms. Allocated memory was 199.2MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 117.9MB in the beginning and 422.7MB in the end (delta: -304.8MB). Peak memory consumption was 798.3MB. Max. memory is 16.1GB. [2024-02-07 19:04:00,612 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.29ms. Allocated memory is still 151.0MB. Free memory is still 102.5MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 75.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 623.93ms. Allocated memory was 151.0MB in the beginning and 199.2MB in the end (delta: 48.2MB). Free memory was 71.0MB in the beginning and 157.7MB in the end (delta: -86.7MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.75ms. Allocated memory is still 199.2MB. Free memory was 157.7MB in the beginning and 155.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.12ms. Allocated memory is still 199.2MB. Free memory was 155.6MB in the beginning and 152.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 589.16ms. Allocated memory is still 199.2MB. Free memory was 152.5MB in the beginning and 118.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7626.32ms. Allocated memory was 199.2MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 117.9MB in the beginning and 422.7MB in the end (delta: -304.8MB). Peak memory consumption was 798.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 793]: 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_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L723] 0 int z = 0; [L780] 0 pthread_t t2067; [L781] FCALL, FORK 0 pthread_create(&t2067, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2067={5:0}, x=0, y=0, z=0] [L727] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[z]],BinaryExpression[COMPLEQ,IdentifierExpression[z],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[z],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[z],IntegerLiteral[1]]]]]] [L727] 1 __unbuffered_p0_EAX = z [L728] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L782] 0 pthread_t t2068; [L783] FCALL, FORK 0 pthread_create(&t2068, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2067={5:0}, t2068={6:0}, x=0, y=0, z=0] [L742] 2 x = 1 [L743] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0] [L784] 0 pthread_t t2069; [L730] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]]]] [L730] 1 __unbuffered_p0_EBX = x [L731] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EBX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=1, __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, z=0] [L785] FCALL, FORK 0 pthread_create(&t2069, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=1, __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, t2067={5:0}, t2068={6:0}, t2069={3:0}, x=1, y=0, z=0] [L757] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[y]],BinaryExpression[COMPLEQ,IdentifierExpression[y],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]]]] [L757] 3 __unbuffered_p2_EAX = y [L758] 3 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=1, __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, z=0] [L745] 2 y = 1 [L746] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=1, __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, z=0] [L760] 3 z = 1 [L761] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[z],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=1, __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, z=1] [L735] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L735] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L736] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=1, __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, z=1] [L750] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L750] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=1, __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, z=1] [L765] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L765] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=1, __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, z=1] [L787] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L787] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L788] 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_p0_EBX=1, __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, t2067={5:0}, t2068={6:0}, t2069={3:0}, x=1, y=1, z=1] [L789] 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]]]]]] [L789] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L789] RET 0 assume_abort_if_not(main$tmp_guard0) [L793] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p2_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[0]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EBX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EBX],IntegerLiteral[1]]]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p2_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=1, __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, t2067={5:0}, t2068={6:0}, t2069={3:0}, x=1, y=1, z=1] - 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: 728]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 730]: 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: 735]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 736]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 743]: 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: 750]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 751]: 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: 758]: 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: 765]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 766]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 787]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 788]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 789]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 794]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 795]: 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: 785]: 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: 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: 783]: 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, 100 locations, 41 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: 7.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 425 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 421 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 782 IncrementalHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 2 mSDtfsCounter, 782 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173occurred in iteration=12, InterpolantAutomatonStates: 42, 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.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 277 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:04:00,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE